{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XYXST5G7ERBW3DN52M4PL55X4Z","short_pith_number":"pith:XYXST5G7","canonical_record":{"source":{"id":"2605.14149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T22:00:17Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e45b7d59b1ba5059c71ce81e45be38166c29a5b520047e4ef02daecb5704bfc8","abstract_canon_sha256":"33543d947cf6ba05f035984e6b8bacfb50c4d0c3238d9a0b08f8a8471f1c07a9"},"schema_version":"1.0"},"canonical_sha256":"be2f29f4df24436d8dbdd338f5f7b7e6657e9861bb5c14a57baf5337e403280d","source":{"kind":"arxiv","id":"2605.14149","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XYXST5G7ERBW3DN52M4PL55X4Z","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-13T22:00:17Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e45b7d59b1ba5059c71ce81e45be38166c29a5b520047e4ef02daecb5704bfc8","abstract_canon_sha256":"33543d947cf6ba05f035984e6b8bacfb50c4d0c3238d9a0b08f8a8471f1c07a9"},"schema_version":"1.0"},"canonical_sha256":"be2f29f4df24436d8dbdd338f5f7b7e6657e9861bb5c14a57baf5337e403280d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.598233Z","signature_b64":"taG58KYVP0d0FGWRdtlb/N3M+FQAZwUYdN8s2//1Wd3tfKnd4DulKcv+9NVIvpH+OdMiFZT2mkzDyKouBcN1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be2f29f4df24436d8dbdd338f5f7b7e6657e9861bb5c14a57baf5337e403280d","last_reissued_at":"2026-05-17T23:39:11.597751Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.597751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14149","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ow3E8aymlWn4a/X5QLMObgyZa7gl6tmYUNM/EFRnWWjjuyvMDneTnswHca5inIvztV+YMtXGR3VFZ32tH/dBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T07:08:04.170412Z"},"content_sha256":"40e51238bc4d175d26adc8c373f87cc82a9aa58fc46c46657e16dd0add1a4d5c","schema_version":"1.0","event_id":"sha256:40e51238bc4d175d26adc8c373f87cc82a9aa58fc46c46657e16dd0add1a4d5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XYXST5G7ERBW3DN52M4PL55X4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Mean-Field Limit of Online Stochastic Vector Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","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.","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Christian Fiedler, Daniel Lacker, Joe Jackson, Jonathan Niles-Weed","submitted_at":"2026-05-13T22:00:17Z","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 "},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","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.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"dec6afb69460e417ed49e75f48cce54cb7aa0135bcbb98a8b11477806fa8690b"},"source":{"id":"2605.14149","kind":"arxiv","version":1},"verdict":{"id":"da94b48b-e24d-4db0-a8c2-3970047dc09f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:56:54.790325Z","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.","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","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.","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."},"references":{"count":32,"sample":[{"doi":"","year":2025,"title":"Altschuler and Konstantin Tikhomirov.A threshold for online balancing of sparse i.i.d","work_id":"f77b68f7-1a71-461f-ac93-a67b5bf54d08","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/21m1442450.url:https://doi.org/10.1137/21m1442450","year":null,"title":"Discrepancy Minimization via a Self-Balancing Walk","work_id":"f2dba25c-da21-4f30-97ea-3ae90f8fd31f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Paul Dupuis Amarjit Budhiraja.Analysis and Approximation of Rare Events. Springer, 2019","work_id":"3fe44615-bd4f-40ab-bdfc-985d7950927e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Constructive algorithms for discrepancy minimization","work_id":"3496d8d3-73bc-47e6-8569-9c43ba959776","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1002/rsa","year":2020,"title":"On-line balancing of random inputs","work_id":"1d66be86-0b5c-430b-81b7-bcbc57b68f84","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":32,"snapshot_sha256":"211d418e209c01163891b689c418bae25f7f0b9d34c5600e1658c3876e57bdc3","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6caa6d10ec4a1c0e97762ce3deae8d7f1be478ab0d9f5e5539f148d58a7214a1"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"da94b48b-e24d-4db0-a8c2-3970047dc09f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4IzXBP7QUlBTZfrihsSRqsyoz2y9xj5GtLIJseJ5Cm48A8ioxyWDW7Mgnxh+GSU7PVjTTWCtYJ59buFSeHuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T07:08:04.171233Z"},"content_sha256":"2b3ea264185b34d8b664f31d6b2bba3cf95932413276ad304ccffe7a97a8820f","schema_version":"1.0","event_id":"sha256:2b3ea264185b34d8b664f31d6b2bba3cf95932413276ad304ccffe7a97a8820f"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:XYXST5G7ERBW3DN52M4PL55X4Z","target":"integrity","payload":{"note":"Identifier '10.1016/0095-8956(77' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Joel Spencer. “Balancing games”. In:Journal of Combinatorial Theory, Series B23.1 (1977), pp. 68–74.issn: 0095-8956.doi:https://doi.org/10.1016/0095-8956(77) 90057-0.url:https://www.sciencedirect.com/science/article/pii/0095895677900570","arxiv_id":"2605.14149","detector":"doi_compliance","evidence":{"doi":"10.1016/0095-8956(77","arxiv_id":null,"ref_index":31,"raw_excerpt":"Joel Spencer. “Balancing games”. In:Journal of Combinatorial Theory, Series B23.1 (1977), pp. 68–74.issn: 0095-8956.doi:https://doi.org/10.1016/0095-8956(77) 90057-0.url:https://www.sciencedirect.com/science/article/pii/0095895677900570","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":31,"audited_at":"2026-05-19T05:52:59.613061Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0095-8956(77","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"47748cb6ee6230bc2a4c5761f5d1715aa7c170980bb6b5452b2cb947e523cc7b","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":67,"payload_sha256":"0c7cee2bf341b8724f69172dbe3e05d3ee3caaefdc0cb4f205fee8ce3939a977","signature_b64":"mXP+sSez7YQEIv92WL8eTP+4czKo4RCt45kwjCY2wRd6kd7/lS5C7O5zxC6YEgIlERIOqF7jnBeMvdV6ebs1Ag==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T05:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qany1HrylNjaJ7Xm8vwIW3aqPvieSOCd2HQteI2vkjdZmViMAQOmLmSPaFs7/Cj9iDz1o3iUnQGqMWyGuzxlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T07:08:04.172843Z"},"content_sha256":"465cf4dffe28d4f1e5dc1216487818d73e476553d4bdffc4717ae4dd89dfbb2b","schema_version":"1.0","event_id":"sha256:465cf4dffe28d4f1e5dc1216487818d73e476553d4bdffc4717ae4dd89dfbb2b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:XYXST5G7ERBW3DN52M4PL55X4Z","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1070/SM1989v064n01ABEH003295.url:https://doi.org/10.1070/SM1989v064n01ABEH003295.80) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"E. D. Gluskin. “Extremal properties of orthogonal parallelepipeds and their applications to the geometry of Banach spaces”. In:Mathematics of the USSR-Sbornik64.1 (Feb. 1989), p. 85.doi:10.1070/SM1989v064n01ABEH003295.url:https://doi.org/10","arxiv_id":"2605.14149","detector":"doi_compliance","evidence":{"ref_index":16,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"E. D. Gluskin. “Extremal properties of orthogonal parallelepipeds and their applications to the geometry of Banach spaces”. In:Mathematics of the USSR-Sbornik64.1 (Feb. 1989), p. 85.doi:10.1070/SM1989v064n01ABEH003295.url:https://doi.org/10","reconstructed_doi":"10.1070/SM1989v064n01ABEH003295.url:https://doi.org/10.1070/SM1989v064n01ABEH003295.80"},"severity":"advisory","ref_index":16,"audited_at":"2026-05-19T05:52:59.613061Z","event_type":"pith.integrity.v1","detected_doi":"10.1070/SM1989v064n01ABEH003295.url:https://doi.org/10.1070/SM1989v064n01ABEH003295.80","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2e34f41a59345deee086a1c8c4a72e19e2b9147284eca6f8c127eb4c4c3f6dd7","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":66,"payload_sha256":"9f4ef40b5cc0956bee34cc1495672a4a7a972d655cf175a63e19f8fc07024e80","signature_b64":"QxAIudNaFJvvSIBi7X+6ddjQeTsoeeAXRpvn9UYdPtog2SlH0fyItO/xnwv/nbI8rK3QUvQVcqhLe/nlgFe4CA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T05:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxMN7XFiUATmQxjSbS6GebePqAiM3W6N2ad98NITvkSj4lcDshnCQXmBLcXjjZB/hsKYG7AtUXUqiY/gzLpDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T07:08:04.173163Z"},"content_sha256":"c19522f99f690f3352d14df9b03c60cd4f022f7e5386573d8752ec7d778bcb0e","schema_version":"1.0","event_id":"sha256:c19522f99f690f3352d14df9b03c60cd4f022f7e5386573d8752ec7d778bcb0e"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:XYXST5G7ERBW3DN52M4PL55X4Z","target":"integrity","payload":{"note":"Identifier '10.1214/12-aap881.url:https://doi.org/10.1214/12-aap881' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Gerard Brunick and Steven Shreve. “Mimicking an Itˆ o process by a solution of a stochas- tic differential equation”. In:The Annals of Applied Probability23.4 (2013), pp. 1584– 1628.doi:10.1214/12-AAP881.url:https://doi.org/10.1214/12-AAP88","arxiv_id":"2605.14149","detector":"doi_compliance","evidence":{"doi":"10.1214/12-aap881.url:https://doi.org/10.1214/12-aap881","arxiv_id":null,"ref_index":11,"raw_excerpt":"Gerard Brunick and Steven Shreve. “Mimicking an Itˆ o process by a solution of a stochas- tic differential equation”. In:The Annals of Applied Probability23.4 (2013), pp. 1584– 1628.doi:10.1214/12-AAP881.url:https://doi.org/10.1214/12-AAP881","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":11,"audited_at":"2026-05-19T05:52:59.613061Z","event_type":"pith.integrity.v1","detected_doi":"10.1214/12-aap881.url:https://doi.org/10.1214/12-aap881","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"13627cc2158be331524cfcc3d439bca41b1b48e823f6c491579a6505744f0d6c","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":65,"payload_sha256":"e1a95ca3870ad63133128d45e2a80a3d025f4c60d313ea746d301c5094f51c36","signature_b64":"nzM3LUYspnLDbtzwyl0kA0hLnfU4e2Uq9d9/OKPA1OqySI4DIrcPCZPUs9uJnU2q7Ga+6awCmzNtPwskz7MSCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T05:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9hIDjssPWHNqxjFukCodWdVC3w+itwd2irTnswuCiIn5fp0nKp6qwn8+6ufj83wJ/EY4TPUj1fjQvBwumk+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T07:08:04.173608Z"},"content_sha256":"10e04bb4455923c7df8ef79bca59067203ae6e206739d120b5c9a8f912334657","schema_version":"1.0","event_id":"sha256:10e04bb4455923c7df8ef79bca59067203ae6e206739d120b5c9a8f912334657"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:XYXST5G7ERBW3DN52M4PL55X4Z","target":"integrity","payload":{"note":"Identifier '10.1137/21m1442450.url:https://doi.org/10.1137/21m1442450' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Ryan Alweiss, Yang P. Liu, and Mehtaab S. Sawhney. “Discrepancy Minimization via a Self-Balancing Walk”. In:SIAM Journal on Computing0.0 (0), STOC21-211-STOC21– 224.doi:10.1137/21M1442450.url:https://doi.org/10.1137/21M1442450","arxiv_id":"2605.14149","detector":"doi_compliance","evidence":{"doi":"10.1137/21m1442450.url:https://doi.org/10.1137/21m1442450","arxiv_id":null,"ref_index":2,"raw_excerpt":"Ryan Alweiss, Yang P. Liu, and Mehtaab S. Sawhney. “Discrepancy Minimization via a Self-Balancing Walk”. In:SIAM Journal on Computing0.0 (0), STOC21-211-STOC21– 224.doi:10.1137/21M1442450.url:https://doi.org/10.1137/21M1442450","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":2,"audited_at":"2026-05-19T05:52:59.613061Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/21m1442450.url:https://doi.org/10.1137/21m1442450","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"ee1c1b45491862ba88482e8fe7237e2652313900672a0cf432bc034e5f5fbdba","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":64,"payload_sha256":"9394c7c8b695314e37e289c23e6dda2127a066ce0ec79991686188a6fb73a6c6","signature_b64":"HQkm9megfAFJPbIZpAYHXAfUTMoXLFfSi4WzA5dxvbXBqmf7GkAQWT18y7LJVJmxd2flRqi6ukHmU6syYTmYAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T05:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vsgm80Ii+VxRDWurLiOM1I5Gzt4L74W9cgWj10VmmQPRr58CF5HgHamFtRkyzaOlms4keZTP/HAwXkVwmaQzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T07:08:04.174162Z"},"content_sha256":"092929e294f3cf639352a4f7d10bcdac39697660564c5c23416a91eb57a1c68d","schema_version":"1.0","event_id":"sha256:092929e294f3cf639352a4f7d10bcdac39697660564c5c23416a91eb57a1c68d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYXST5G7ERBW3DN52M4PL55X4Z/bundle.json","state_url":"https://pith.science/pith/XYXST5G7ERBW3DN52M4PL55X4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYXST5G7ERBW3DN52M4PL55X4Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T07:08:04Z","links":{"resolver":"https://pith.science/pith/XYXST5G7ERBW3DN52M4PL55X4Z","bundle":"https://pith.science/pith/XYXST5G7ERBW3DN52M4PL55X4Z/bundle.json","state":"https://pith.science/pith/XYXST5G7ERBW3DN52M4PL55X4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYXST5G7ERBW3DN52M4PL55X4Z/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0ztXlpOf/LqxoizMVtfotwoILf1C5keoRegy8U5m97O58PGl0CgFhY00tvWU9RsMn0iJfj/aqQgiqGIDho8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T07:08:04.179057Z","bundle_sha256":"0b544208e346a40d3f3cebb89580c8a9bb35e41c9e793cca0aeb4c9846862db1"}}