{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DMDYGBEGT7PDKQEMUFTK5K7ROV","short_pith_number":"pith:DMDYGBEG","schema_version":"1.0","canonical_sha256":"1b078304869fde35408ca166aeabf175566e1d0be5f438372623eca0dc91368a","source":{"kind":"arxiv","id":"1605.02882","version":3},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.02882","created_at":"2026-05-18T01:04:49.846433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02882v3","created_at":"2026-05-18T01:04:49.846433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02882","created_at":"2026-05-18T01:04:49.846433+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMDYGBEGT7PD","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMDYGBEGT7PDKQEM","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMDYGBEG","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV","json":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV.json","graph_json":"https://pith.science/api/pith-number/DMDYGBEGT7PDKQEMUFTK5K7ROV/graph.json","events_json":"https://pith.science/api/pith-number/DMDYGBEGT7PDKQEMUFTK5K7ROV/events.json","paper":"https://pith.science/paper/DMDYGBEG"},"agent_actions":{"view_html":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV","download_json":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV.json","view_paper":"https://pith.science/paper/DMDYGBEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02882&json=true","fetch_graph":"https://pith.science/api/pith-number/DMDYGBEGT7PDKQEMUFTK5K7ROV/graph.json","fetch_events":"https://pith.science/api/pith-number/DMDYGBEGT7PDKQEMUFTK5K7ROV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/action/storage_attestation","attest_author":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/action/author_attestation","sign_citation":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/action/citation_signature","submit_replication":"https://pith.science/pith/DMDYGBEGT7PDKQEMUFTK5K7ROV/action/replication_record"}},"created_at":"2026-05-18T01:04:49.846433+00:00","updated_at":"2026-05-18T01:04:49.846433+00:00"}