{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RZHOZM2SUKTOTTQJDKO7FLGP7T","short_pith_number":"pith:RZHOZM2S","canonical_record":{"source":{"id":"2308.01406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-02T20:01:11Z","cross_cats_sorted":[],"title_canon_sha256":"d623c8169a94f81c4d959ca83a662158e8d6d43b729f89ef2f1a77b077297960","abstract_canon_sha256":"51c3c49efcaa5d19399360e548a1feca8051c5c570109918c7b1d2a8f0478a9a"},"schema_version":"1.0"},"canonical_sha256":"8e4eecb352a2a6e9ce091a9df2accffcd279222a1a2dcd1a7ac65fb0032337a1","source":{"kind":"arxiv","id":"2308.01406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.01406","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"2308.01406v1","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.01406","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"RZHOZM2SUKTO","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"pith_short_16","alias_value":"RZHOZM2SUKTOTTQJ","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"pith_short_8","alias_value":"RZHOZM2S","created_at":"2026-07-05T06:37:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RZHOZM2SUKTOTTQJDKO7FLGP7T","target":"record","payload":{"canonical_record":{"source":{"id":"2308.01406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-02T20:01:11Z","cross_cats_sorted":[],"title_canon_sha256":"d623c8169a94f81c4d959ca83a662158e8d6d43b729f89ef2f1a77b077297960","abstract_canon_sha256":"51c3c49efcaa5d19399360e548a1feca8051c5c570109918c7b1d2a8f0478a9a"},"schema_version":"1.0"},"canonical_sha256":"8e4eecb352a2a6e9ce091a9df2accffcd279222a1a2dcd1a7ac65fb0032337a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:17.955269Z","signature_b64":"mv5rdgZKxnLITBuuM2Mfrd5H1P+/7uDGu6imkPVGBf4vgSG6Qso5vL4XyeVvq1t3s0uRSdlCJ987pXDIciofCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e4eecb352a2a6e9ce091a9df2accffcd279222a1a2dcd1a7ac65fb0032337a1","last_reissued_at":"2026-07-05T06:37:17.954796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:17.954796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.01406","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-07-05T06:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4S/xY1UyFrHZWd9H+r/AhT2T2atN6boDgPn04AbZYoH6v8niuOI4EeVIeohjbs7/hKid8P3inrqvDFalSS9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T17:44:52.342883Z"},"content_sha256":"df7f59d17039e38bf491f061b37aaa4671446864188c64765a37dcfaae5d939a","schema_version":"1.0","event_id":"sha256:df7f59d17039e38bf491f061b37aaa4671446864188c64765a37dcfaae5d939a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RZHOZM2SUKTOTTQJDKO7FLGP7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Online Discrepancy Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Janardhan Kulkarni, Thomas Rothvoss, Victor Reis","submitted_at":"2023-08-02T20:01:11Z","abstract_excerpt":"We prove that there exists an online algorithm that for any sequence of vectors $v_1,\\ldots,v_T \\in \\mathbb{R}^n$ with $\\|v_i\\|_2 \\leq 1$, arriving one at a time, decides random signs $x_1,\\ldots,x_T \\in \\{ -1,1\\}$ so that for every $t \\le T$, the prefix sum $\\sum_{i=1}^t x_iv_i$ is $10$-subgaussian. This improves over the work of Alweiss, Liu and Sawhney who kept prefix sums $O(\\sqrt{\\log (nT)})$-subgaussian, and gives a $O(\\sqrt{\\log T})$ bound on the discrepancy $\\max_{t \\in T} \\|\\sum_{i=1}^t x_i v_i\\|_\\infty$. Our proof combines a generalization of Banaszczyk's prefix balancing result to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.01406","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/2308.01406/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-07-05T06:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVXAzdjZTbtTf/I2AyIYtrNoLHhUJ4lWySMArYvri09HhGd9HToIldVgtlwuP13Aww8fHHkstlJKIoRCSY09DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T17:44:52.343267Z"},"content_sha256":"38b9fe7a4a506bd368f6731bc2485a197a3ffe044abfc74487cae2f7796267b7","schema_version":"1.0","event_id":"sha256:38b9fe7a4a506bd368f6731bc2485a197a3ffe044abfc74487cae2f7796267b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZHOZM2SUKTOTTQJDKO7FLGP7T/bundle.json","state_url":"https://pith.science/pith/RZHOZM2SUKTOTTQJDKO7FLGP7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZHOZM2SUKTOTTQJDKO7FLGP7T/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-08-20T17:44:52Z","links":{"resolver":"https://pith.science/pith/RZHOZM2SUKTOTTQJDKO7FLGP7T","bundle":"https://pith.science/pith/RZHOZM2SUKTOTTQJDKO7FLGP7T/bundle.json","state":"https://pith.science/pith/RZHOZM2SUKTOTTQJDKO7FLGP7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZHOZM2SUKTOTTQJDKO7FLGP7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RZHOZM2SUKTOTTQJDKO7FLGP7T","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":"51c3c49efcaa5d19399360e548a1feca8051c5c570109918c7b1d2a8f0478a9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-02T20:01:11Z","title_canon_sha256":"d623c8169a94f81c4d959ca83a662158e8d6d43b729f89ef2f1a77b077297960"},"schema_version":"1.0","source":{"id":"2308.01406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.01406","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"2308.01406v1","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.01406","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"RZHOZM2SUKTO","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"pith_short_16","alias_value":"RZHOZM2SUKTOTTQJ","created_at":"2026-07-05T06:37:17Z"},{"alias_kind":"pith_short_8","alias_value":"RZHOZM2S","created_at":"2026-07-05T06:37:17Z"}],"graph_snapshots":[{"event_id":"sha256:38b9fe7a4a506bd368f6731bc2485a197a3ffe044abfc74487cae2f7796267b7","target":"graph","created_at":"2026-07-05T06:37:17Z","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/2308.01406/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that there exists an online algorithm that for any sequence of vectors $v_1,\\ldots,v_T \\in \\mathbb{R}^n$ with $\\|v_i\\|_2 \\leq 1$, arriving one at a time, decides random signs $x_1,\\ldots,x_T \\in \\{ -1,1\\}$ so that for every $t \\le T$, the prefix sum $\\sum_{i=1}^t x_iv_i$ is $10$-subgaussian. This improves over the work of Alweiss, Liu and Sawhney who kept prefix sums $O(\\sqrt{\\log (nT)})$-subgaussian, and gives a $O(\\sqrt{\\log T})$ bound on the discrepancy $\\max_{t \\in T} \\|\\sum_{i=1}^t x_i v_i\\|_\\infty$. Our proof combines a generalization of Banaszczyk's prefix balancing result to t","authors_text":"Janardhan Kulkarni, Thomas Rothvoss, Victor Reis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-02T20:01:11Z","title":"Optimal Online Discrepancy Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.01406","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:df7f59d17039e38bf491f061b37aaa4671446864188c64765a37dcfaae5d939a","target":"record","created_at":"2026-07-05T06:37:17Z","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":"51c3c49efcaa5d19399360e548a1feca8051c5c570109918c7b1d2a8f0478a9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-02T20:01:11Z","title_canon_sha256":"d623c8169a94f81c4d959ca83a662158e8d6d43b729f89ef2f1a77b077297960"},"schema_version":"1.0","source":{"id":"2308.01406","kind":"arxiv","version":1}},"canonical_sha256":"8e4eecb352a2a6e9ce091a9df2accffcd279222a1a2dcd1a7ac65fb0032337a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e4eecb352a2a6e9ce091a9df2accffcd279222a1a2dcd1a7ac65fb0032337a1","first_computed_at":"2026-07-05T06:37:17.954796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:37:17.954796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mv5rdgZKxnLITBuuM2Mfrd5H1P+/7uDGu6imkPVGBf4vgSG6Qso5vL4XyeVvq1t3s0uRSdlCJ987pXDIciofCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:37:17.955269Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.01406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df7f59d17039e38bf491f061b37aaa4671446864188c64765a37dcfaae5d939a","sha256:38b9fe7a4a506bd368f6731bc2485a197a3ffe044abfc74487cae2f7796267b7"],"state_sha256":"82afa962a6688d5af74e716f001a3d6952f99fee6e69a94f13e4243a702e7b5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfUUsJt8fQ1rEyHt2Axnwr3mr313lCfdJiVtQ2RiF8hDPo1oSzAX4xZZ8S8KvEiUfzorUZ1FTjAf55EHgZw1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T17:44:52.346575Z","bundle_sha256":"cde7b1885e866a3907fbab3330d8f1d50ad8d545beb20c94f807041d9a8efb0e"}}