{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:H52PCZZGYOLTCY6NVHB3NGX4PY","short_pith_number":"pith:H52PCZZG","schema_version":"1.0","canonical_sha256":"3f74f16726c3973163cda9c3b69afc7e3cceb0659a53b63d85e5dfa00066711c","source":{"kind":"arxiv","id":"1611.01805","version":2},"attestation_state":"computed","paper":{"title":"Algorithmic Discrepancy Beyond Partial Coloring","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-11-06T16:35:24Z","abstract_excerpt":"The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number of times, and the errors can add up in an adversarial way. We give a new and general algorithmic framework that overcomes the limitations of the partial coloring method and can be applied in a black-box manner to various problems. Using this framework, we give new improved bounds and algorithms for several classic problems in discrepancy. In particular, for T"},"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":"1611.01805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-06T16:35:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0b2bfc5becffec3cbca2c60697fb00f064b179ba41efa7f51f0a6c78e5c1357f","abstract_canon_sha256":"34f5dff773c6ad163b71d575a08956eae6952ca6df836a631afadd44b6f63a99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:28.712859Z","signature_b64":"xuL/ANjnYs8/6SvSmBShbYRSp5pU3Zmu2p4jq5pG1fV9Dc7WrGcWBX4gGPiiSj67rh9F3zEav2w8HLd4E8PcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f74f16726c3973163cda9c3b69afc7e3cceb0659a53b63d85e5dfa00066711c","last_reissued_at":"2026-05-18T00:40:28.712343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:28.712343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Discrepancy Beyond Partial Coloring","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-11-06T16:35:24Z","abstract_excerpt":"The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number of times, and the errors can add up in an adversarial way. We give a new and general algorithmic framework that overcomes the limitations of the partial coloring method and can be applied in a black-box manner to various problems. Using this framework, we give new improved bounds and algorithms for several classic problems in discrepancy. In particular, for T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01805","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.01805","created_at":"2026-05-18T00:40:28.712407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01805v2","created_at":"2026-05-18T00:40:28.712407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01805","created_at":"2026-05-18T00:40:28.712407+00:00"},{"alias_kind":"pith_short_12","alias_value":"H52PCZZGYOLT","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"H52PCZZGYOLTCY6N","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"H52PCZZG","created_at":"2026-05-18T12:30:19.053100+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/H52PCZZGYOLTCY6NVHB3NGX4PY","json":"https://pith.science/pith/H52PCZZGYOLTCY6NVHB3NGX4PY.json","graph_json":"https://pith.science/api/pith-number/H52PCZZGYOLTCY6NVHB3NGX4PY/graph.json","events_json":"https://pith.science/api/pith-number/H52PCZZGYOLTCY6NVHB3NGX4PY/events.json","paper":"https://pith.science/paper/H52PCZZG"},"agent_actions":{"view_html":"https://pith.science/pith/H52PCZZGYOLTCY6NVHB3NGX4PY","download_json":"https://pith.science/pith/H52PCZZGYOLTCY6NVHB3NGX4PY.json","view_paper":"https://pith.science/paper/H52PCZZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01805&json=true","fetch_graph":"https://pith.science/api/pith-number/H52PCZZGYOLTCY6NVHB3NGX4PY/graph.json","fetch_events":"https://pith.science/api/pith-number/H52PCZZGYOLTCY6NVHB3NGX4PY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H52PCZZGYOLTCY6NVHB3NGX4PY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H52PCZZGYOLTCY6NVHB3NGX4PY/action/storage_attestation","attest_author":"https://pith.science/pith/H52PCZZGYOLTCY6NVHB3NGX4PY/action/author_attestation","sign_citation":"https://pith.science/pith/H52PCZZGYOLTCY6NVHB3NGX4PY/action/citation_signature","submit_replication":"https://pith.science/pith/H52PCZZGYOLTCY6NVHB3NGX4PY/action/replication_record"}},"created_at":"2026-05-18T00:40:28.712407+00:00","updated_at":"2026-05-18T00:40:28.712407+00:00"}