{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VBKZVLX27HXFLFT7OJMO2NJV7I","short_pith_number":"pith:VBKZVLX2","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"},"canonical_sha256":"a8559aaefaf9ee55967f7258ed3535fa24fdbc0b637e73aba190232b329eedc0","source":{"kind":"arxiv","id":"2606.17991","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17991","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17991v1","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17991","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"VBKZVLX27HXF","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"pith_short_16","alias_value":"VBKZVLX27HXFLFT7","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"pith_short_8","alias_value":"VBKZVLX2","created_at":"2026-06-19T16:10:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VBKZVLX27HXFLFT7OJMO2NJV7I","target":"record","payload":{"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"},"canonical_sha256":"a8559aaefaf9ee55967f7258ed3535fa24fdbc0b637e73aba190232b329eedc0","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"},"source_kind":"arxiv","source_id":"2606.17991","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-06-19T16:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpN6+XTMhbFBgvCQ4JrGolqcOyskKHVMLRTovmkroAgMhaJ+XU8NVgo6QiRZsH6TpiwwFFo460wZ0r7fcVehBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:18:41.311679Z"},"content_sha256":"e6d40f349aaacc0769995252cd511fc63320ca10110a0ebae5c0f69c63631c2a","schema_version":"1.0","event_id":"sha256:e6d40f349aaacc0769995252cd511fc63320ca10110a0ebae5c0f69c63631c2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VBKZVLX27HXFLFT7OJMO2NJV7I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wowSuH6uazphIDLmliG2xgRtSOpT7O78vuAoS7f5id7+DDHsIu2MDpH4vEQRDQQA9uVLG2YGOIu3OUbXPxFFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:18:41.312056Z"},"content_sha256":"9e9d4b30cf5aadd0fd1bf2d14355480b480afbe1a6ecc56d35cf25393c03f399","schema_version":"1.0","event_id":"sha256:9e9d4b30cf5aadd0fd1bf2d14355480b480afbe1a6ecc56d35cf25393c03f399"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/bundle.json","state_url":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/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-06-26T01:18:41Z","links":{"resolver":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I","bundle":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/bundle.json","state":"https://pith.science/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBKZVLX27HXFLFT7OJMO2NJV7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VBKZVLX27HXFLFT7OJMO2NJV7I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4e1545c50e5f524fb1f773a507f9fac0588cbc901cef5e65fab874ece5eba4a8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-06-16T14:42:12Z","title_canon_sha256":"8654ed20787c2dad4ddaf6472a17548c2c706c51b71adf10195121e54f057e0a"},"schema_version":"1.0","source":{"id":"2606.17991","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17991","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17991v1","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17991","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"VBKZVLX27HXF","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"pith_short_16","alias_value":"VBKZVLX27HXFLFT7","created_at":"2026-06-19T16:10:45Z"},{"alias_kind":"pith_short_8","alias_value":"VBKZVLX2","created_at":"2026-06-19T16:10:45Z"}],"graph_snapshots":[{"event_id":"sha256:9e9d4b30cf5aadd0fd1bf2d14355480b480afbe1a6ecc56d35cf25393c03f399","target":"graph","created_at":"2026-06-19T16:10:45Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.17991/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Arka Ghosh, Daniel Dadush, Ekin Ergen, {\\L}ukasz Orlikowski, S{\\l}awomir Lasota, Wojciech Czerwi\\'nski","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-06-16T14:42:12Z","title":"Greedy Vector Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17991","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e6d40f349aaacc0769995252cd511fc63320ca10110a0ebae5c0f69c63631c2a","target":"record","created_at":"2026-06-19T16:10:45Z","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":"4e1545c50e5f524fb1f773a507f9fac0588cbc901cef5e65fab874ece5eba4a8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-06-16T14:42:12Z","title_canon_sha256":"8654ed20787c2dad4ddaf6472a17548c2c706c51b71adf10195121e54f057e0a"},"schema_version":"1.0","source":{"id":"2606.17991","kind":"arxiv","version":1}},"canonical_sha256":"a8559aaefaf9ee55967f7258ed3535fa24fdbc0b637e73aba190232b329eedc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8559aaefaf9ee55967f7258ed3535fa24fdbc0b637e73aba190232b329eedc0","first_computed_at":"2026-06-19T16:10:45.381588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:45.381588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f4u6Mam03M1uHbEOAaRRQdvHGH/6UpxgMWsMF38ByjRy10c4WcrqZzwr5ASO9sxhEWEttSIw9MGiHeqp9VSzBg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:45.381936Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.17991","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6d40f349aaacc0769995252cd511fc63320ca10110a0ebae5c0f69c63631c2a","sha256:9e9d4b30cf5aadd0fd1bf2d14355480b480afbe1a6ecc56d35cf25393c03f399"],"state_sha256":"7a70710b3e113e4f6c6198ad3897d53e39a875ae635743b629e01c8cfcbc85fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7DHrcwvKUqv+ISBe7SgTcu9XguZBJeBCEJcY8p/PZB9Vz1GHDvz0uq0y16H8CWQBL6N0WZGFYGXayUYQi1KDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:18:41.314132Z","bundle_sha256":"d9e26a9779d8156473d8a6928f5eb8db743d50ab9b9ba2bdb57d2e2c03f55fa4"}}