{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VBKZVLX27HXFLFT7OJMO2NJV7I","short_pith_number":"pith:VBKZVLX2","schema_version":"1.0","canonical_sha256":"a8559aaefaf9ee55967f7258ed3535fa24fdbc0b637e73aba190232b329eedc0","source":{"kind":"arxiv","id":"2606.17991","version":1},"attestation_state":"computed","paper":{"title":"Greedy Vector Balancing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arka Ghosh, Daniel Dadush, Ekin Ergen, {\\L}ukasz Orlikowski, S{\\l}awomir Lasota, Wojciech Czerwi\\'nski","submitted_at":"2026-06-16T14:42:12Z","abstract_excerpt":"In online vector balancing, vectors $t_1,\\dots,t_n$ arrive one by one from a given set $T$ and the goal is to assign signs $s_1,\\dots,s_n\\in\\{\\pm1\\}$ in an online manner so as to minimize the largest norm of any signed prefix sum $\\sum_{i=1}^ks_i t_i$, $k \\in [n]$. In this paper, we analyze the natural Euclidean greedy vector balancing algorithm for this problem: at each step $k$, the sign $s_k\\in\\{\\pm1\\}$ is chosen so that $s_k t_k$ has non-positive inner product with $\\sum_{i=1}^{k-1} s_i\\cdot t_i$. Our main result is the first finite bound, independent of the sequence length $n$, on the per"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.17991","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-06-16T14:42:12Z","cross_cats_sorted":[],"title_canon_sha256":"8654ed20787c2dad4ddaf6472a17548c2c706c51b71adf10195121e54f057e0a","abstract_canon_sha256":"4e1545c50e5f524fb1f773a507f9fac0588cbc901cef5e65fab874ece5eba4a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:45.381936Z","signature_b64":"f4u6Mam03M1uHbEOAaRRQdvHGH/6UpxgMWsMF38ByjRy10c4WcrqZzwr5ASO9sxhEWEttSIw9MGiHeqp9VSzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8559aaefaf9ee55967f7258ed3535fa24fdbc0b637e73aba190232b329eedc0","last_reissued_at":"2026-06-19T16:10:45.381588Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:45.381588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Vector Balancing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arka Ghosh, Daniel Dadush, Ekin Ergen, {\\L}ukasz Orlikowski, S{\\l}awomir Lasota, Wojciech Czerwi\\'nski","submitted_at":"2026-06-16T14:42:12Z","abstract_excerpt":"In online vector balancing, vectors $t_1,\\dots,t_n$ arrive one by one from a given set $T$ and the goal is to assign signs $s_1,\\dots,s_n\\in\\{\\pm1\\}$ in an online manner so as to minimize the largest norm of any signed prefix sum $\\sum_{i=1}^ks_i t_i$, $k \\in [n]$. In this paper, we analyze the natural Euclidean greedy vector balancing algorithm for this problem: at each step $k$, the sign $s_k\\in\\{\\pm1\\}$ is chosen so that $s_k t_k$ has non-positive inner product with $\\sum_{i=1}^{k-1} s_i\\cdot t_i$. Our main result is the first finite bound, independent of the sequence length $n$, on the per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17991","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.17991/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.17991","created_at":"2026-06-19T16:10:45.381651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.17991v1","created_at":"2026-06-19T16:10:45.381651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17991","created_at":"2026-06-19T16:10:45.381651+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBKZVLX27HXF","created_at":"2026-06-19T16:10:45.381651+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBKZVLX27HXFLFT7","created_at":"2026-06-19T16:10:45.381651+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBKZVLX2","created_at":"2026-06-19T16:10:45.381651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I","json":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I.json","graph_json":"https://pith.science/api/pith-number/VBKZVLX27HXFLFT7OJMO2NJV7I/graph.json","events_json":"https://pith.science/api/pith-number/VBKZVLX27HXFLFT7OJMO2NJV7I/events.json","paper":"https://pith.science/paper/VBKZVLX2"},"agent_actions":{"view_html":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I","download_json":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I.json","view_paper":"https://pith.science/paper/VBKZVLX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.17991&json=true","fetch_graph":"https://pith.science/api/pith-number/VBKZVLX27HXFLFT7OJMO2NJV7I/graph.json","fetch_events":"https://pith.science/api/pith-number/VBKZVLX27HXFLFT7OJMO2NJV7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/action/storage_attestation","attest_author":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/action/author_attestation","sign_citation":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/action/citation_signature","submit_replication":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/action/replication_record"}},"created_at":"2026-06-19T16:10:45.381651+00:00","updated_at":"2026-06-19T16:10:45.381651+00:00"}