{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5VCTJSKEXNFVXXVPZ54YJ4MPJ4","short_pith_number":"pith:5VCTJSKE","canonical_record":{"source":{"id":"2607.04388","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T16:31:42Z","cross_cats_sorted":[],"title_canon_sha256":"645744a03f25ff8bd759ea1e8253040621778827215cd5abaa23aaa0cd017d15","abstract_canon_sha256":"fcbd8ee72b39bf0edbd7be20f14c89046f97531c33db0c67dc86a01d21a77ce5"},"schema_version":"1.0"},"canonical_sha256":"ed4534c944bb4b5bdeafcf7984f18f4f01a594ca7662882dc2f5a5a8d3089c28","source":{"kind":"arxiv","id":"2607.04388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04388","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04388v1","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04388","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"5VCTJSKEXNFV","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"pith_short_16","alias_value":"5VCTJSKEXNFVXXVP","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"pith_short_8","alias_value":"5VCTJSKE","created_at":"2026-07-07T02:19:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5VCTJSKEXNFVXXVPZ54YJ4MPJ4","target":"record","payload":{"canonical_record":{"source":{"id":"2607.04388","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T16:31:42Z","cross_cats_sorted":[],"title_canon_sha256":"645744a03f25ff8bd759ea1e8253040621778827215cd5abaa23aaa0cd017d15","abstract_canon_sha256":"fcbd8ee72b39bf0edbd7be20f14c89046f97531c33db0c67dc86a01d21a77ce5"},"schema_version":"1.0"},"canonical_sha256":"ed4534c944bb4b5bdeafcf7984f18f4f01a594ca7662882dc2f5a5a8d3089c28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:16.079955Z","signature_b64":"3oXhC/wDM2l3OOL69mF9bT8p5Ht+p5YAGNs2bhjeHk5DmPTVhXqMiUUcsze1apQOf5Z3fUKzfFer/07CoV45Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed4534c944bb4b5bdeafcf7984f18f4f01a594ca7662882dc2f5a5a8d3089c28","last_reissued_at":"2026-07-07T02:19:16.079050Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:16.079050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.04388","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-07T02:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJr38o69MDNOnkxL4DlnQSHv8AwN+FQE9eEvfnWeYYNs7+gE+uNkS8PydyU9++Kp08xY1TgK19JKg4MSksbODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:26:33.659762Z"},"content_sha256":"c232675651b3ca654d84172ba9c3e2bfa63920815ff55826ca82400aa16a6151","schema_version":"1.0","event_id":"sha256:c232675651b3ca654d84172ba9c3e2bfa63920815ff55826ca82400aa16a6151"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5VCTJSKEXNFVXXVPZ54YJ4MPJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Online Discrepancy Minimization in Linear Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ishaq Aden-Ali","submitted_at":"2026-07-05T16:31:42Z","abstract_excerpt":"We provide an online algorithm with the following guarantee: for any fixed sequence of vectors $v_1,\\dots,v_T \\in \\mathbf{R}^d$ with $\\|v_i\\|_2\\le 1$, the algorithm assigns each arriving vector $v_t$ a random sign $\\varepsilon_t$ such that every prefix sum $\\sum_{i=1}^t \\varepsilon_i v_i $ can be written as the sum of three coupled standard Gaussian vectors. Our algorithm runs in $O(dT)$ time and achieves the optimal prefix discrepancy bound \\[ \\max_{1 \\le t \\le T}\\left\\| \\sum_{i=1}^t \\varepsilon_i v_i \\right\\|_\\infty = O\\left( \\sqrt{\\log T} \\right), \\] with high probability. This recovers the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04388","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/2607.04388/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-07T02:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xKnazzumX7M/nVAPNmQjaCoXybtT7ntISrOfiDpf3WDD7UsUIwCcXMB7G8rr90K6eJ+8Xs9L3qtIv/Y+v32BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:26:33.660259Z"},"content_sha256":"c99a7f17286cff4953af9bce256bef4e437ff3911c9194d37594df9a5f860060","schema_version":"1.0","event_id":"sha256:c99a7f17286cff4953af9bce256bef4e437ff3911c9194d37594df9a5f860060"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5VCTJSKEXNFVXXVPZ54YJ4MPJ4/bundle.json","state_url":"https://pith.science/pith/5VCTJSKEXNFVXXVPZ54YJ4MPJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5VCTJSKEXNFVXXVPZ54YJ4MPJ4/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-20T08:26:33Z","links":{"resolver":"https://pith.science/pith/5VCTJSKEXNFVXXVPZ54YJ4MPJ4","bundle":"https://pith.science/pith/5VCTJSKEXNFVXXVPZ54YJ4MPJ4/bundle.json","state":"https://pith.science/pith/5VCTJSKEXNFVXXVPZ54YJ4MPJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5VCTJSKEXNFVXXVPZ54YJ4MPJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5VCTJSKEXNFVXXVPZ54YJ4MPJ4","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":"fcbd8ee72b39bf0edbd7be20f14c89046f97531c33db0c67dc86a01d21a77ce5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T16:31:42Z","title_canon_sha256":"645744a03f25ff8bd759ea1e8253040621778827215cd5abaa23aaa0cd017d15"},"schema_version":"1.0","source":{"id":"2607.04388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04388","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04388v1","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04388","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"5VCTJSKEXNFV","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"pith_short_16","alias_value":"5VCTJSKEXNFVXXVP","created_at":"2026-07-07T02:19:16Z"},{"alias_kind":"pith_short_8","alias_value":"5VCTJSKE","created_at":"2026-07-07T02:19:16Z"}],"graph_snapshots":[{"event_id":"sha256:c99a7f17286cff4953af9bce256bef4e437ff3911c9194d37594df9a5f860060","target":"graph","created_at":"2026-07-07T02:19:16Z","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/2607.04388/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide an online algorithm with the following guarantee: for any fixed sequence of vectors $v_1,\\dots,v_T \\in \\mathbf{R}^d$ with $\\|v_i\\|_2\\le 1$, the algorithm assigns each arriving vector $v_t$ a random sign $\\varepsilon_t$ such that every prefix sum $\\sum_{i=1}^t \\varepsilon_i v_i $ can be written as the sum of three coupled standard Gaussian vectors. Our algorithm runs in $O(dT)$ time and achieves the optimal prefix discrepancy bound \\[ \\max_{1 \\le t \\le T}\\left\\| \\sum_{i=1}^t \\varepsilon_i v_i \\right\\|_\\infty = O\\left( \\sqrt{\\log T} \\right), \\] with high probability. This recovers the","authors_text":"Ishaq Aden-Ali","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04388","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:c232675651b3ca654d84172ba9c3e2bfa63920815ff55826ca82400aa16a6151","target":"record","created_at":"2026-07-07T02:19:16Z","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":"fcbd8ee72b39bf0edbd7be20f14c89046f97531c33db0c67dc86a01d21a77ce5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T16:31:42Z","title_canon_sha256":"645744a03f25ff8bd759ea1e8253040621778827215cd5abaa23aaa0cd017d15"},"schema_version":"1.0","source":{"id":"2607.04388","kind":"arxiv","version":1}},"canonical_sha256":"ed4534c944bb4b5bdeafcf7984f18f4f01a594ca7662882dc2f5a5a8d3089c28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed4534c944bb4b5bdeafcf7984f18f4f01a594ca7662882dc2f5a5a8d3089c28","first_computed_at":"2026-07-07T02:19:16.079050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:16.079050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3oXhC/wDM2l3OOL69mF9bT8p5Ht+p5YAGNs2bhjeHk5DmPTVhXqMiUUcsze1apQOf5Z3fUKzfFer/07CoV45Dw==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:16.079955Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c232675651b3ca654d84172ba9c3e2bfa63920815ff55826ca82400aa16a6151","sha256:c99a7f17286cff4953af9bce256bef4e437ff3911c9194d37594df9a5f860060"],"state_sha256":"1849d0ba514dbafbcd0aa1c35ff4bb51588d4dc1e34c6e621822ef4922eade46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FqdLSPUpGNw8yweYyq5lr639xtBSjwqavWHxc/1nTyte4cPZSNPaSnaZzVcSUXpSA03EB4ov+ZBwE9dIZLQYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T08:26:33.663953Z","bundle_sha256":"addbaa8a4a1b1367ad4516b10537a1c17335dcd5c2f56fa21f809a3e64378d0c"}}