{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O4ZCIFXZKKKKAEDSBI7EFPPWUD","short_pith_number":"pith:O4ZCIFXZ","schema_version":"1.0","canonical_sha256":"77322416f95294a010720a3e42bdf6a0f0f37388ca2e0bf48892512479d15e0f","source":{"kind":"arxiv","id":"1611.08757","version":2},"attestation_state":"computed","paper":{"title":"Number Balancing is as hard as Minkowski's Theorem and Shortest Vector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.DS"],"primary_cat":"cs.DM","authors_text":"Harishchandra Ramadas, Rebecca Hoberg, Thomas Rothvoss, Xin Yang","submitted_at":"2016-11-26T22:59:07Z","abstract_excerpt":"The number balancing (NBP) problem is the following: given real numbers $a_1,\\ldots,a_n \\in [0,1]$, find two disjoint subsets $I_1,I_2 \\subseteq [n]$ so that the difference $|\\sum_{i \\in I_1}a_i - \\sum_{i \\in I_2}a_i|$ of their sums is minimized. An application of the pigeonhole principle shows that there is always a solution where the difference is at most $O(\\frac{\\sqrt{n}}{2^n})$. Finding the minimum, however, is NP-hard. In polynomial time,the differencing algorithm by Karmarkar and Karp from 1982 can produce a solution with difference at most $n^{-\\Theta(\\log n)}$, but no further improvem"},"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.08757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-26T22:59:07Z","cross_cats_sorted":["cs.CC","cs.CG","cs.DS"],"title_canon_sha256":"db8052c2e3431aca0a6fb1b3fd02afcf9035b037f4deb4b34c37c6c566108c91","abstract_canon_sha256":"25635afdcd646e2943a39c7bb86d8a88d4c8b53e1ac1395a4dafc0975377a94e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:18.839991Z","signature_b64":"tgHcgyfmPL5bOcIGNUoQPZyDIopsXiWq4V0SEllqYHk/Nx/GPiibr7EoDf+gycT3UKpsR1z9WMhg2IVzKiMCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77322416f95294a010720a3e42bdf6a0f0f37388ca2e0bf48892512479d15e0f","last_reissued_at":"2026-05-18T00:56:18.839147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:18.839147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Number Balancing is as hard as Minkowski's Theorem and Shortest Vector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.DS"],"primary_cat":"cs.DM","authors_text":"Harishchandra Ramadas, Rebecca Hoberg, Thomas Rothvoss, Xin Yang","submitted_at":"2016-11-26T22:59:07Z","abstract_excerpt":"The number balancing (NBP) problem is the following: given real numbers $a_1,\\ldots,a_n \\in [0,1]$, find two disjoint subsets $I_1,I_2 \\subseteq [n]$ so that the difference $|\\sum_{i \\in I_1}a_i - \\sum_{i \\in I_2}a_i|$ of their sums is minimized. An application of the pigeonhole principle shows that there is always a solution where the difference is at most $O(\\frac{\\sqrt{n}}{2^n})$. Finding the minimum, however, is NP-hard. In polynomial time,the differencing algorithm by Karmarkar and Karp from 1982 can produce a solution with difference at most $n^{-\\Theta(\\log n)}$, but no further improvem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08757","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.08757","created_at":"2026-05-18T00:56:18.839297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08757v2","created_at":"2026-05-18T00:56:18.839297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08757","created_at":"2026-05-18T00:56:18.839297+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4ZCIFXZKKKK","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4ZCIFXZKKKKAEDS","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4ZCIFXZ","created_at":"2026-05-18T12:30:36.002864+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/O4ZCIFXZKKKKAEDSBI7EFPPWUD","json":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD.json","graph_json":"https://pith.science/api/pith-number/O4ZCIFXZKKKKAEDSBI7EFPPWUD/graph.json","events_json":"https://pith.science/api/pith-number/O4ZCIFXZKKKKAEDSBI7EFPPWUD/events.json","paper":"https://pith.science/paper/O4ZCIFXZ"},"agent_actions":{"view_html":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD","download_json":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD.json","view_paper":"https://pith.science/paper/O4ZCIFXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08757&json=true","fetch_graph":"https://pith.science/api/pith-number/O4ZCIFXZKKKKAEDSBI7EFPPWUD/graph.json","fetch_events":"https://pith.science/api/pith-number/O4ZCIFXZKKKKAEDSBI7EFPPWUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/action/storage_attestation","attest_author":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/action/author_attestation","sign_citation":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/action/citation_signature","submit_replication":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/action/replication_record"}},"created_at":"2026-05-18T00:56:18.839297+00:00","updated_at":"2026-05-18T00:56:18.839297+00:00"}