{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XF3YS5TX6P266ODPFUY473DIF6","short_pith_number":"pith:XF3YS5TX","schema_version":"1.0","canonical_sha256":"b977897677f3f5ef386f2d31cfec682f958dcf460ab3c3b682ede2cda30ec72d","source":{"kind":"arxiv","id":"1611.08752","version":3},"attestation_state":"computed","paper":{"title":"Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Avi Levy, Harishchandra Ramadas, Thomas Rothvoss","submitted_at":"2016-11-26T22:27:17Z","abstract_excerpt":"A well-known theorem of Spencer shows that any set system with $n$ sets over $n$ elements admits a coloring of discrepancy $O(\\sqrt{n})$. While the original proof was non-constructive, recent progress brought polynomial time algorithms by Bansal, Lovett and Meka, and Rothvoss. All those algorithms are randomized, even though Bansal's algorithm admitted a complicated derandomization.\n  We propose an elegant deterministic polynomial time algorithm that is inspired by Lovett-Meka as well as the Multiplicative Weight Update method. The algorithm iteratively updates a fractional coloring while cont"},"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.08752","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-26T22:27:17Z","cross_cats_sorted":["cs.CG","cs.DS","math.CO"],"title_canon_sha256":"410bf860ff13bb06b972581ea99b070f2db89a2251fccd8f78e4a7e8207f1176","abstract_canon_sha256":"260bc81c848279c614a3fdc3f3ea0ff0849a3137aae8ad3509d2da8583846139"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:53.664801Z","signature_b64":"IN1ivhg76HpgEEMILOIKQYuilCl/i9G+c69+FjNc58ztgbjf9ORv5jfA+dHofUR24BSTuZ1L4nun5BmAfvDrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b977897677f3f5ef386f2d31cfec682f958dcf460ab3c3b682ede2cda30ec72d","last_reissued_at":"2026-05-18T00:48:53.664110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:53.664110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Avi Levy, Harishchandra Ramadas, Thomas Rothvoss","submitted_at":"2016-11-26T22:27:17Z","abstract_excerpt":"A well-known theorem of Spencer shows that any set system with $n$ sets over $n$ elements admits a coloring of discrepancy $O(\\sqrt{n})$. While the original proof was non-constructive, recent progress brought polynomial time algorithms by Bansal, Lovett and Meka, and Rothvoss. All those algorithms are randomized, even though Bansal's algorithm admitted a complicated derandomization.\n  We propose an elegant deterministic polynomial time algorithm that is inspired by Lovett-Meka as well as the Multiplicative Weight Update method. The algorithm iteratively updates a fractional coloring while cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08752","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":"1611.08752","created_at":"2026-05-18T00:48:53.664210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08752v3","created_at":"2026-05-18T00:48:53.664210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08752","created_at":"2026-05-18T00:48:53.664210+00:00"},{"alias_kind":"pith_short_12","alias_value":"XF3YS5TX6P26","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XF3YS5TX6P266ODP","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XF3YS5TX","created_at":"2026-05-18T12:30:51.357362+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/XF3YS5TX6P266ODPFUY473DIF6","json":"https://pith.science/pith/XF3YS5TX6P266ODPFUY473DIF6.json","graph_json":"https://pith.science/api/pith-number/XF3YS5TX6P266ODPFUY473DIF6/graph.json","events_json":"https://pith.science/api/pith-number/XF3YS5TX6P266ODPFUY473DIF6/events.json","paper":"https://pith.science/paper/XF3YS5TX"},"agent_actions":{"view_html":"https://pith.science/pith/XF3YS5TX6P266ODPFUY473DIF6","download_json":"https://pith.science/pith/XF3YS5TX6P266ODPFUY473DIF6.json","view_paper":"https://pith.science/paper/XF3YS5TX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08752&json=true","fetch_graph":"https://pith.science/api/pith-number/XF3YS5TX6P266ODPFUY473DIF6/graph.json","fetch_events":"https://pith.science/api/pith-number/XF3YS5TX6P266ODPFUY473DIF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XF3YS5TX6P266ODPFUY473DIF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XF3YS5TX6P266ODPFUY473DIF6/action/storage_attestation","attest_author":"https://pith.science/pith/XF3YS5TX6P266ODPFUY473DIF6/action/author_attestation","sign_citation":"https://pith.science/pith/XF3YS5TX6P266ODPFUY473DIF6/action/citation_signature","submit_replication":"https://pith.science/pith/XF3YS5TX6P266ODPFUY473DIF6/action/replication_record"}},"created_at":"2026-05-18T00:48:53.664210+00:00","updated_at":"2026-05-18T00:48:53.664210+00:00"}