{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DMDYGBEGT7PDKQEMUFTK5K7ROV","short_pith_number":"pith:DMDYGBEG","canonical_record":{"source":{"id":"1605.02882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-10T08:05:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"948f6da159f1b77cfa1aee4bc0dc86ef2c83d5091e35c1c1585c1d669243b5fa","abstract_canon_sha256":"40bd3e3bea4d01218c78df225bf04b021f6f4a2ef99f5be841a4b69165b66196"},"schema_version":"1.0"},"canonical_sha256":"1b078304869fde35408ca166aeabf175566e1d0be5f438372623eca0dc91368a","source":{"kind":"arxiv","id":"1605.02882","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02882","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02882v3","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02882","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"DMDYGBEGT7PD","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMDYGBEGT7PDKQEM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMDYGBEG","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DMDYGBEGT7PDKQEMUFTK5K7ROV","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-10T08:05:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"948f6da159f1b77cfa1aee4bc0dc86ef2c83d5091e35c1c1585c1d669243b5fa","abstract_canon_sha256":"40bd3e3bea4d01218c78df225bf04b021f6f4a2ef99f5be841a4b69165b66196"},"schema_version":"1.0"},"canonical_sha256":"1b078304869fde35408ca166aeabf175566e1d0be5f438372623eca0dc91368a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:49.846796Z","signature_b64":"mibQHg/J9Tsl4Y4keeL0nb9PIdOZ12trzEmgOz2GXKB/StoMRhWZ5q+ZnXA7wLei6kuoozuz5IhjzVV6EBa8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b078304869fde35408ca166aeabf175566e1d0be5f438372623eca0dc91368a","last_reissued_at":"2026-05-18T01:04:49.846359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:49.846359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02882","source_version":3,"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-18T01:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvGNNcTJQUy+N5kL/37cooCNBCdhYYm/YbpOslyIt+TYESpKVCSF84eb7eLC9ZecFUZyDNuGTeifA7u+xhQsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:35:47.708286Z"},"content_sha256":"1d607f91513abcf5f4d47322b143780b0535a7e684dbe44575b821571bec9fda","schema_version":"1.0","event_id":"sha256:1d607f91513abcf5f4d47322b143780b0535a7e684dbe44575b821571bec9fda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DMDYGBEGT7PDKQEMUFTK5K7ROV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Koml\\'os Conjecture Matching Banaszczyk's bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Nikhil Bansal, Shashwat Garg","submitted_at":"2016-05-10T08:05:58Z","abstract_excerpt":"We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most t sets. We give an efficient algorithm that finds a coloring with discrepancy O((t log n)^{1/2}), matching the best known non-constructive bound for the problem due to Banaszczyk. The previous algorithms only achieved an O(t^{1/2} log n) bound. The result also extends to the more general Koml\\'{o}s setting and gives an algorithmic O(log^{1/2} n) bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02882","kind":"arxiv","version":3},"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-18T01:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCJmHUCFU4XchdV4wb3mbR0gTe8Jovfg8G0I3UXh043nJKFx9XtoEdmIULZBcOJJDsThInu/LV18Cu/3iZkgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:35:47.708917Z"},"content_sha256":"662aa7b76f7b7eaef4fb119602ef3208a4754e04799326a8bfaf3b0b2a232b19","schema_version":"1.0","event_id":"sha256:662aa7b76f7b7eaef4fb119602ef3208a4754e04799326a8bfaf3b0b2a232b19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/bundle.json","state_url":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/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-28T07:35:47Z","links":{"resolver":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV","bundle":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/bundle.json","state":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DMDYGBEGT7PDKQEMUFTK5K7ROV","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":"40bd3e3bea4d01218c78df225bf04b021f6f4a2ef99f5be841a4b69165b66196","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-10T08:05:58Z","title_canon_sha256":"948f6da159f1b77cfa1aee4bc0dc86ef2c83d5091e35c1c1585c1d669243b5fa"},"schema_version":"1.0","source":{"id":"1605.02882","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02882","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02882v3","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02882","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"DMDYGBEGT7PD","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMDYGBEGT7PDKQEM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMDYGBEG","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:662aa7b76f7b7eaef4fb119602ef3208a4754e04799326a8bfaf3b0b2a232b19","target":"graph","created_at":"2026-05-18T01:04:49Z","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":"We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most t sets. We give an efficient algorithm that finds a coloring with discrepancy O((t log n)^{1/2}), matching the best known non-constructive bound for the problem due to Banaszczyk. The previous algorithms only achieved an O(t^{1/2} log n) bound. The result also extends to the more general Koml\\'{o}s setting and gives an algorithmic O(log^{1/2} n) bound.","authors_text":"Daniel Dadush, Nikhil Bansal, Shashwat Garg","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-10T08:05:58Z","title":"An Algorithm for Koml\\'os Conjecture Matching Banaszczyk's bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02882","kind":"arxiv","version":3},"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:1d607f91513abcf5f4d47322b143780b0535a7e684dbe44575b821571bec9fda","target":"record","created_at":"2026-05-18T01:04:49Z","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":"40bd3e3bea4d01218c78df225bf04b021f6f4a2ef99f5be841a4b69165b66196","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-10T08:05:58Z","title_canon_sha256":"948f6da159f1b77cfa1aee4bc0dc86ef2c83d5091e35c1c1585c1d669243b5fa"},"schema_version":"1.0","source":{"id":"1605.02882","kind":"arxiv","version":3}},"canonical_sha256":"1b078304869fde35408ca166aeabf175566e1d0be5f438372623eca0dc91368a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b078304869fde35408ca166aeabf175566e1d0be5f438372623eca0dc91368a","first_computed_at":"2026-05-18T01:04:49.846359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:49.846359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mibQHg/J9Tsl4Y4keeL0nb9PIdOZ12trzEmgOz2GXKB/StoMRhWZ5q+ZnXA7wLei6kuoozuz5IhjzVV6EBa8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:49.846796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02882","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d607f91513abcf5f4d47322b143780b0535a7e684dbe44575b821571bec9fda","sha256:662aa7b76f7b7eaef4fb119602ef3208a4754e04799326a8bfaf3b0b2a232b19"],"state_sha256":"581c6f98c734c0a20b3e0824e706cbb0522c54cc62be96b5a6569b379b2d6b0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ncua3rqxZnMJCHkYfFUhbPr+jNRY7f9wzyseQygQ0LTJRwHewYUnbmWuOvvKo4S2FZsjwdpm8E556Yiwedt0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:35:47.711835Z","bundle_sha256":"60afa2b2bf9498fc13490566fb70b2577ad200dd4a57c49b2d8481e463f63883"}}