{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SH7NTSFUNJXRS2UDJHYDRNXSMS","short_pith_number":"pith:SH7NTSFU","canonical_record":{"source":{"id":"1601.03311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-13T16:48:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6ce4c603c1035b70c2fed91ce3f40ef9a4163e8fc10bd8419b3f1fd4b523bbef","abstract_canon_sha256":"362f251c15b13f4697c197c04a6bd5ae212c76d5b3b405dcc3b73e872a029983"},"schema_version":"1.0"},"canonical_sha256":"91fed9c8b46a6f196a8349f038b6f264ba49451709289e55d67cf830feb9b254","source":{"kind":"arxiv","id":"1601.03311","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03311","created_at":"2026-05-18T01:21:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03311v2","created_at":"2026-05-18T01:21:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03311","created_at":"2026-05-18T01:21:25Z"},{"alias_kind":"pith_short_12","alias_value":"SH7NTSFUNJXR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SH7NTSFUNJXRS2UD","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SH7NTSFU","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SH7NTSFUNJXRS2UDJHYDRNXSMS","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-13T16:48:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6ce4c603c1035b70c2fed91ce3f40ef9a4163e8fc10bd8419b3f1fd4b523bbef","abstract_canon_sha256":"362f251c15b13f4697c197c04a6bd5ae212c76d5b3b405dcc3b73e872a029983"},"schema_version":"1.0"},"canonical_sha256":"91fed9c8b46a6f196a8349f038b6f264ba49451709289e55d67cf830feb9b254","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:25.306387Z","signature_b64":"LmTAJafbS2ve/qG3Xzo6A+dNEE4M7eVVW5Im6d/RZCeDCR5HloQAStToKyIItaLHjAInRSM2b/wChxO+dsfdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91fed9c8b46a6f196a8349f038b6f264ba49451709289e55d67cf830feb9b254","last_reissued_at":"2026-05-18T01:21:25.305669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:25.305669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03311","source_version":2,"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:21:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rH7ko4WGaNkCWjkvKBKxGo5z7FsCQUU4qs+r/aBHWTi1qn+a6IcWnVsHELJrL8X98Z34j7duhtmDpeZ+olG2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:35:07.247147Z"},"content_sha256":"24b8640d47bdbfa33047b11770c44db4131b481d20eb37573f9ad13b4ca9edd5","schema_version":"1.0","event_id":"sha256:24b8640d47bdbfa33047b11770c44db4131b481d20eb37573f9ad13b4ca9edd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SH7NTSFUNJXRS2UDJHYDRNXSMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithmic Bounds for Discrepancy of Sparse Set Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Nikhil Bansal, Shashwat Garg","submitted_at":"2016-01-13T16:48:59Z","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 algorithm that finds a coloring with discrepancy $O((t \\log n \\log s)^{1/2})$ where $s$ is the maximum cardinality of a set. This improves upon the previous constructive bound of $O(t^{1/2} \\log n)$ based on algorithmic variants of the partial coloring method, and for small $s$ (e.g.$s=\\textrm{poly}(t)$) comes close to the non-constructive $O((t \\log n)^{1/2})$ bound due to Banaszczyk. Previously, no algorithmic results better than $O(t^{1/2}\\log n)$ were"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03311","kind":"arxiv","version":2},"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:21:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEjrboDpJW0uCjhU0goPU5IeQDIvC2HH2rBbW783slyHjGLyrzzybZGD1HtgL7SgRRWjhS60j/pI8bZ251oMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:35:07.247888Z"},"content_sha256":"67b85635b87e0bff284d665f5a11b1ad68caed31822a04303bfedbd4fd977671","schema_version":"1.0","event_id":"sha256:67b85635b87e0bff284d665f5a11b1ad68caed31822a04303bfedbd4fd977671"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SH7NTSFUNJXRS2UDJHYDRNXSMS/bundle.json","state_url":"https://pith.science/pith/SH7NTSFUNJXRS2UDJHYDRNXSMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SH7NTSFUNJXRS2UDJHYDRNXSMS/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-30T21:35:07Z","links":{"resolver":"https://pith.science/pith/SH7NTSFUNJXRS2UDJHYDRNXSMS","bundle":"https://pith.science/pith/SH7NTSFUNJXRS2UDJHYDRNXSMS/bundle.json","state":"https://pith.science/pith/SH7NTSFUNJXRS2UDJHYDRNXSMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SH7NTSFUNJXRS2UDJHYDRNXSMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SH7NTSFUNJXRS2UDJHYDRNXSMS","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":"362f251c15b13f4697c197c04a6bd5ae212c76d5b3b405dcc3b73e872a029983","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-13T16:48:59Z","title_canon_sha256":"6ce4c603c1035b70c2fed91ce3f40ef9a4163e8fc10bd8419b3f1fd4b523bbef"},"schema_version":"1.0","source":{"id":"1601.03311","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03311","created_at":"2026-05-18T01:21:25Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03311v2","created_at":"2026-05-18T01:21:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03311","created_at":"2026-05-18T01:21:25Z"},{"alias_kind":"pith_short_12","alias_value":"SH7NTSFUNJXR","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SH7NTSFUNJXRS2UD","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SH7NTSFU","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:67b85635b87e0bff284d665f5a11b1ad68caed31822a04303bfedbd4fd977671","target":"graph","created_at":"2026-05-18T01:21:25Z","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 algorithm that finds a coloring with discrepancy $O((t \\log n \\log s)^{1/2})$ where $s$ is the maximum cardinality of a set. This improves upon the previous constructive bound of $O(t^{1/2} \\log n)$ based on algorithmic variants of the partial coloring method, and for small $s$ (e.g.$s=\\textrm{poly}(t)$) comes close to the non-constructive $O((t \\log n)^{1/2})$ bound due to Banaszczyk. Previously, no algorithmic results better than $O(t^{1/2}\\log n)$ were","authors_text":"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-01-13T16:48:59Z","title":"Improved Algorithmic Bounds for Discrepancy of Sparse Set Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03311","kind":"arxiv","version":2},"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:24b8640d47bdbfa33047b11770c44db4131b481d20eb37573f9ad13b4ca9edd5","target":"record","created_at":"2026-05-18T01:21:25Z","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":"362f251c15b13f4697c197c04a6bd5ae212c76d5b3b405dcc3b73e872a029983","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-13T16:48:59Z","title_canon_sha256":"6ce4c603c1035b70c2fed91ce3f40ef9a4163e8fc10bd8419b3f1fd4b523bbef"},"schema_version":"1.0","source":{"id":"1601.03311","kind":"arxiv","version":2}},"canonical_sha256":"91fed9c8b46a6f196a8349f038b6f264ba49451709289e55d67cf830feb9b254","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91fed9c8b46a6f196a8349f038b6f264ba49451709289e55d67cf830feb9b254","first_computed_at":"2026-05-18T01:21:25.305669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:25.305669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LmTAJafbS2ve/qG3Xzo6A+dNEE4M7eVVW5Im6d/RZCeDCR5HloQAStToKyIItaLHjAInRSM2b/wChxO+dsfdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:25.306387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03311","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24b8640d47bdbfa33047b11770c44db4131b481d20eb37573f9ad13b4ca9edd5","sha256:67b85635b87e0bff284d665f5a11b1ad68caed31822a04303bfedbd4fd977671"],"state_sha256":"bbf24de4dd8e604de72a4865dc67600a21cd0bed883f6b8afc05021a40971c7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRuf1IfZlNLlEklgtS3x8G9BAQTHE3qBasHigZwuTxraepvirRuchK372sfDoo9C/w72oTwwAFRpdas2r1+LCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:35:07.251251Z","bundle_sha256":"8693f70e8b3cceff22ca7fc22ecd539fc4f9a49e4b5023144c4d17600ccd9262"}}