{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DNPTFPMVXHQL64V22B5DLD2LGE","short_pith_number":"pith:DNPTFPMV","canonical_record":{"source":{"id":"1612.04304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-13T18:12:44Z","cross_cats_sorted":["cs.CG","math.FA","math.PR"],"title_canon_sha256":"979cefb0e111e45544ad924106a4852953d895e3a7a93c3dfd7bc8cf48eb8739","abstract_canon_sha256":"1d29c52416d5ee354866bcee7564448295983f8689978f770b5e4282d7e0737b"},"schema_version":"1.0"},"canonical_sha256":"1b5f32bd95b9e0bf72bad07a358f4b31252e4ce0e6f7fbf28971d89728f44eb9","source":{"kind":"arxiv","id":"1612.04304","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04304","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04304v1","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04304","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"DNPTFPMVXHQL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DNPTFPMVXHQL64V2","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DNPTFPMV","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DNPTFPMVXHQL64V22B5DLD2LGE","target":"record","payload":{"canonical_record":{"source":{"id":"1612.04304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-13T18:12:44Z","cross_cats_sorted":["cs.CG","math.FA","math.PR"],"title_canon_sha256":"979cefb0e111e45544ad924106a4852953d895e3a7a93c3dfd7bc8cf48eb8739","abstract_canon_sha256":"1d29c52416d5ee354866bcee7564448295983f8689978f770b5e4282d7e0737b"},"schema_version":"1.0"},"canonical_sha256":"1b5f32bd95b9e0bf72bad07a358f4b31252e4ce0e6f7fbf28971d89728f44eb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:04.869368Z","signature_b64":"27DtoreAYg5A9nOsK6h2fk2h1NpZkJ/qBb/enbBCCFNmqd9t4xLClEulJojofSd6AMlK8Zp9ZuyHH62i3b/tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b5f32bd95b9e0bf72bad07a358f4b31252e4ce0e6f7fbf28971d89728f44eb9","last_reissued_at":"2026-05-18T00:55:04.868757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:04.868757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.04304","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-18T00:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCIcdezDlB+bLuBmC8K6rgYM+vKyMRfAoM8XUXRPkHIWnyJ7mjq7fmOuhUc25AnRw9X6DVjDn8ZRGqQhB9SBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:32:22.870990Z"},"content_sha256":"51bc3e2b9b94a5cc032d0c01a1e251f75de8854f5c4cf4440b4f5d38b6e8fda7","schema_version":"1.0","event_id":"sha256:51bc3e2b9b94a5cc032d0c01a1e251f75de8854f5c4cf4440b4f5d38b6e8fda7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DNPTFPMVXHQL64V22B5DLD2LGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.FA","math.PR"],"primary_cat":"cs.DS","authors_text":"Aleksandar Nikolov, Daniel Dadush, Shachar Lovett, Shashwat Garg","submitted_at":"2016-12-13T18:12:44Z","abstract_excerpt":"An important theorem of Banaszczyk (Random Structures & Algorithms `98) states that for any sequence of vectors of $\\ell_2$ norm at most $1/5$ and any convex body $K$ of Gaussian measure $1/2$ in $\\mathbb{R}^n$, there exists a signed combination of these vectors which lands inside $K$. A major open problem is to devise a constructive version of Banaszczyk's vector balancing theorem, i.e. to find an efficient algorithm which constructs the signed combination.\n  We make progress towards this goal along several fronts. As our first contribution, we show an equivalence between Banaszczyk's theorem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04304","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":""},"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-05-18T00:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFjMl28QQhBZ+inaaBzOTDaQmO4eQf7LpxOPz9D3QyxB5FUMv3z60zVhfE07bU7ZFFUZFZnvIbUG5igdjGsnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:32:22.871368Z"},"content_sha256":"99b67d9b106d95792ddbf712391c153f574a0eea4bb0312e84d4690cc9dfff64","schema_version":"1.0","event_id":"sha256:99b67d9b106d95792ddbf712391c153f574a0eea4bb0312e84d4690cc9dfff64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNPTFPMVXHQL64V22B5DLD2LGE/bundle.json","state_url":"https://pith.science/pith/DNPTFPMVXHQL64V22B5DLD2LGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNPTFPMVXHQL64V22B5DLD2LGE/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-27T05:32:22Z","links":{"resolver":"https://pith.science/pith/DNPTFPMVXHQL64V22B5DLD2LGE","bundle":"https://pith.science/pith/DNPTFPMVXHQL64V22B5DLD2LGE/bundle.json","state":"https://pith.science/pith/DNPTFPMVXHQL64V22B5DLD2LGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNPTFPMVXHQL64V22B5DLD2LGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DNPTFPMVXHQL64V22B5DLD2LGE","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":"1d29c52416d5ee354866bcee7564448295983f8689978f770b5e4282d7e0737b","cross_cats_sorted":["cs.CG","math.FA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-13T18:12:44Z","title_canon_sha256":"979cefb0e111e45544ad924106a4852953d895e3a7a93c3dfd7bc8cf48eb8739"},"schema_version":"1.0","source":{"id":"1612.04304","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04304","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04304v1","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04304","created_at":"2026-05-18T00:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"DNPTFPMVXHQL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DNPTFPMVXHQL64V2","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DNPTFPMV","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:99b67d9b106d95792ddbf712391c153f574a0eea4bb0312e84d4690cc9dfff64","target":"graph","created_at":"2026-05-18T00:55:04Z","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"},"paper":{"abstract_excerpt":"An important theorem of Banaszczyk (Random Structures & Algorithms `98) states that for any sequence of vectors of $\\ell_2$ norm at most $1/5$ and any convex body $K$ of Gaussian measure $1/2$ in $\\mathbb{R}^n$, there exists a signed combination of these vectors which lands inside $K$. A major open problem is to devise a constructive version of Banaszczyk's vector balancing theorem, i.e. to find an efficient algorithm which constructs the signed combination.\n  We make progress towards this goal along several fronts. As our first contribution, we show an equivalence between Banaszczyk's theorem","authors_text":"Aleksandar Nikolov, Daniel Dadush, Shachar Lovett, Shashwat Garg","cross_cats":["cs.CG","math.FA","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-13T18:12:44Z","title":"Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04304","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:51bc3e2b9b94a5cc032d0c01a1e251f75de8854f5c4cf4440b4f5d38b6e8fda7","target":"record","created_at":"2026-05-18T00:55:04Z","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":"1d29c52416d5ee354866bcee7564448295983f8689978f770b5e4282d7e0737b","cross_cats_sorted":["cs.CG","math.FA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-13T18:12:44Z","title_canon_sha256":"979cefb0e111e45544ad924106a4852953d895e3a7a93c3dfd7bc8cf48eb8739"},"schema_version":"1.0","source":{"id":"1612.04304","kind":"arxiv","version":1}},"canonical_sha256":"1b5f32bd95b9e0bf72bad07a358f4b31252e4ce0e6f7fbf28971d89728f44eb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b5f32bd95b9e0bf72bad07a358f4b31252e4ce0e6f7fbf28971d89728f44eb9","first_computed_at":"2026-05-18T00:55:04.868757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:04.868757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"27DtoreAYg5A9nOsK6h2fk2h1NpZkJ/qBb/enbBCCFNmqd9t4xLClEulJojofSd6AMlK8Zp9ZuyHH62i3b/tCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:04.869368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04304","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51bc3e2b9b94a5cc032d0c01a1e251f75de8854f5c4cf4440b4f5d38b6e8fda7","sha256:99b67d9b106d95792ddbf712391c153f574a0eea4bb0312e84d4690cc9dfff64"],"state_sha256":"50f711b152ade4550191298b4a21f816c00dcdea6616708e792f4b06c9c1cd91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNLLR8Dd9o54p08w3g1pSFy7UXvZs5AGXb0mg0O3imkkevYFwE+1I61y3yeP9piCmfuB0VfFJuKQIqiKBNzYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:32:22.875216Z","bundle_sha256":"ed631c664fa9d6090d06892932de02501e4857f18a3e3f68a9530bdd2e1f9bf6"}}