What was already known
Earlier polynomial-time methods achieved additive error for fixed privacy and relative-error parameters. Nearly linear error was known without a polynomial-time implementation. The new algorithm attains n polylog n error for fixed and and .
AI involvement
Section 6 credits AI systems with developing the first proofs of the main privacy theorems: an initial GPT-5.5 proof and later simpler GPT-5.6 and Claude 4.6 proofs. GPT-6 Astra and Claude Opus 5.5 helped refine proofs and generate Lean code. The authors selected among algorithms, verified and simplified the proofs, and restructured the presentation.
- Eliáš and coauthors: private synthetic graph releaseSection 6: AI Disclosure
Importance
The result closes the computational gap for private all-cut release up to logarithmic factors in the stated regime. It preserves cut information useful for graph optimization while protecting edge weights. The paper also proves a near-matching lower bound; downstream clustering guarantees are separate results.
Technical verification
The authors report verifying the algorithms and proofs. Their pinned Lean project reports a single theorem checking privacy, simultaneous cut accuracy and worst-case polynomial operation counts for an ellipsoid-based implementation, using only Lean’s standard axioms. Its computational model uses exact real arithmetic and exact Gaussian and Laplace sampling; bit complexity is outside the theorem. These are source-reported human and machine checks.
Formal checking
The authors report verifying the algorithms and proofs. Their pinned Lean project reports a single theorem checking privacy, simultaneous cut accuracy and worst-case polynomial operation counts for an ellipsoid-based implementation, using only Lean’s standard axioms. Its computational model uses exact real arithmetic and exact Gaussian and Laplace sampling; bit complexity is outside the theorem. These are source-reported human and machine checks.
- Checker
- Lean 4 kernel; Eliáš and coauthors
- Scope
- Main exact-real computational theorem; human proof verification separately reported
- Basis
- Reported by the linked checker
- Lean formalization: main theorem, computation model and scopeTheorem 1: implementation theorem and computational model
- Lean theorem for privacy, accuracy and operation counts
Human understanding
The authors explain the fractional witness construction and privacy accounting. A regularized optimization problem identifies portions of the remaining graph to release; the privacy charge tracks the fraction of each edge retired from later iterations. They simplified and rewrote the model-developed proofs and connect this accounting to earlier composition methods.
Correction and publication history
New source-reviewed algorithm with documented central model proof development and author checking; exact computational model retained.
Read this published revision