{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XYXST5G7ERBW3DN52M4PL55X4Z","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"33543d947cf6ba05f035984e6b8bacfb50c4d0c3238d9a0b08f8a8471f1c07a9","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T22:00:17Z","title_canon_sha256":"e45b7d59b1ba5059c71ce81e45be38166c29a5b520047e4ef02daecb5704bfc8"},"schema_version":"1.0","source":{"id":"2605.14149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14149","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14149v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14149","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"XYXST5G7ERBW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XYXST5G7ERBW3DN5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XYXST5G7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2b3ea264185b34d8b664f31d6b2bba3cf95932413276ad304ccffe7a97a8820f","target":"graph","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our main contribution is to determine the exact limit V^∞ = lim V^n as the value of a nonstandard stochastic control problem of mean-field type: find the narrowest terminal interval into which a Brownian motion can be adaptively steered under a uniform-in-time L² constraint on the drift."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The upper bound relies on the Gaussian structure via a coupling procedure involving the Föllmer drift and dynamic programming; the lower bound holds more generally under i.i.d. mean-zero, variance-one, finite-fourth-moment entries using probabilistic compactness."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The optimal value V^n for online vector balancing with Gaussian vectors converges to the value of a mean-field stochastic control problem that finds the narrowest terminal interval for a Brownian motion under uniform L2 drift constraint."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The optimal value for online vector balancing converges exactly to the value of a mean-field problem for steering Brownian motion under an L2 drift constraint."}],"snapshot_sha256":"dec6afb69460e417ed49e75f48cce54cb7aa0135bcbb98a8b11477806fa8690b"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6caa6d10ec4a1c0e97762ce3deae8d7f1be478ab0d9f5e5539f148d58a7214a1"},"paper":{"abstract_excerpt":"We study an online vector balancing problem, in which $n$ independent Gaussian random vectors $\\boldsymbol{\\zeta}(1),\\dots,\\boldsymbol{\\zeta}(n) \\sim \\mathcal{N}(0, I_n)$, each of dimension $n$, arrive one at a time. The goal is to choose signs $\\varepsilon(1),\\dots,\\varepsilon(n) \\in \\{\\pm 1\\}$ with $\\varepsilon(k)$ depending only on $\\boldsymbol{\\zeta}(1),\\dots,\\boldsymbol{\\zeta}(k)$, so as to minimize the expected $\\ell^{\\infty}$ norm of the signed sum $\\frac{1}{\\sqrt{n}}\\sum_{k = 1}^n \\varepsilon(k) \\boldsymbol{\\zeta}(k)$. Prior work showed that the optimal value $V^n$ is $O(1)$, at least ","authors_text":"Christian Fiedler, Daniel Lacker, Joe Jackson, Jonathan Niles-Weed","cross_cats":["math.OC"],"headline":"The optimal value for online vector balancing converges exactly to the value of a mean-field problem for steering Brownian motion under an L2 drift constraint.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T22:00:17Z","title":"The Mean-Field Limit of Online Stochastic Vector Balancing"},"references":{"count":32,"internal_anchors":0,"resolved_work":32,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Altschuler and Konstantin Tikhomirov.A threshold for online balancing of sparse i.i.d","work_id":"f77b68f7-1a71-461f-ac93-a67b5bf54d08","year":2025},{"cited_arxiv_id":"","doi":"10.1137/21m1442450.url:https://doi.org/10.1137/21m1442450","is_internal_anchor":false,"ref_index":2,"title":"Discrepancy Minimization via a Self-Balancing Walk","work_id":"f2dba25c-da21-4f30-97ea-3ae90f8fd31f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Paul Dupuis Amarjit Budhiraja.Analysis and Approximation of Rare Events. Springer, 2019","work_id":"3fe44615-bd4f-40ab-bdfc-985d7950927e","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Constructive algorithms for discrepancy minimization","work_id":"3496d8d3-73bc-47e6-8569-9c43ba959776","year":2010},{"cited_arxiv_id":"","doi":"10.1002/rsa","is_internal_anchor":false,"ref_index":5,"title":"On-line balancing of random inputs","work_id":"1d66be86-0b5c-430b-81b7-bcbc57b68f84","year":2020}],"snapshot_sha256":"211d418e209c01163891b689c418bae25f7f0b9d34c5600e1658c3876e57bdc3"},"source":{"id":"2605.14149","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:56:54.790325Z","id":"da94b48b-e24d-4db0-a8c2-3970047dc09f","model_set":{"reader":"grok-4.3"},"one_line_summary":"The optimal value V^n for online vector balancing with Gaussian vectors converges to the value of a mean-field stochastic control problem that finds the narrowest terminal interval for a Brownian motion under uniform L2 drift constraint.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The optimal value for online vector balancing converges exactly to the value of a mean-field problem for steering Brownian motion under an L2 drift constraint.","strongest_claim":"Our main contribution is to determine the exact limit V^∞ = lim V^n as the value of a nonstandard stochastic control problem of mean-field type: find the narrowest terminal interval into which a Brownian motion can be adaptively steered under a uniform-in-time L² constraint on the drift.","weakest_assumption":"The upper bound relies on the Gaussian structure via a coupling procedure involving the Föllmer drift and dynamic programming; the lower bound holds more generally under i.i.d. mean-zero, variance-one, finite-fourth-moment entries using probabilistic compactness."}},"verdict_id":"da94b48b-e24d-4db0-a8c2-3970047dc09f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:40e51238bc4d175d26adc8c373f87cc82a9aa58fc46c46657e16dd0add1a4d5c","target":"record","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"33543d947cf6ba05f035984e6b8bacfb50c4d0c3238d9a0b08f8a8471f1c07a9","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T22:00:17Z","title_canon_sha256":"e45b7d59b1ba5059c71ce81e45be38166c29a5b520047e4ef02daecb5704bfc8"},"schema_version":"1.0","source":{"id":"2605.14149","kind":"arxiv","version":1}},"canonical_sha256":"be2f29f4df24436d8dbdd338f5f7b7e6657e9861bb5c14a57baf5337e403280d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be2f29f4df24436d8dbdd338f5f7b7e6657e9861bb5c14a57baf5337e403280d","first_computed_at":"2026-05-17T23:39:11.597751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.597751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"taG58KYVP0d0FGWRdtlb/N3M+FQAZwUYdN8s2//1Wd3tfKnd4DulKcv+9NVIvpH+OdMiFZT2mkzDyKouBcN1AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.598233Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14149","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:092929e294f3cf639352a4f7d10bcdac39697660564c5c23416a91eb57a1c68d","sha256:10e04bb4455923c7df8ef79bca59067203ae6e206739d120b5c9a8f912334657","sha256:465cf4dffe28d4f1e5dc1216487818d73e476553d4bdffc4717ae4dd89dfbb2b","sha256:c19522f99f690f3352d14df9b03c60cd4f022f7e5386573d8752ec7d778bcb0e"]}],"invalid_events":[],"applied_event_ids":["sha256:40e51238bc4d175d26adc8c373f87cc82a9aa58fc46c46657e16dd0add1a4d5c","sha256:2b3ea264185b34d8b664f31d6b2bba3cf95932413276ad304ccffe7a97a8820f"],"state_sha256":"2de33541eec0dadd3d3f8b84e37a8cf4d924018bf8b3b0aebb8fbfed46d14caa"}