{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O4ZCIFXZKKKKAEDSBI7EFPPWUD","short_pith_number":"pith:O4ZCIFXZ","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"},"canonical_sha256":"77322416f95294a010720a3e42bdf6a0f0f37388ca2e0bf48892512479d15e0f","source":{"kind":"arxiv","id":"1611.08757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08757","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08757v2","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08757","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"O4ZCIFXZKKKK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O4ZCIFXZKKKKAEDS","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O4ZCIFXZ","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O4ZCIFXZKKKKAEDSBI7EFPPWUD","target":"record","payload":{"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"},"canonical_sha256":"77322416f95294a010720a3e42bdf6a0f0f37388ca2e0bf48892512479d15e0f","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"},"source_kind":"arxiv","source_id":"1611.08757","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-18T00:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9c/yLl81v14JgLxegP2RhpbLEIUhlPpPWtjDZZGuzwspWS8aLBSodCyHF661S0m2WoZJXV74CWaMVHa3wBBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:25:40.118722Z"},"content_sha256":"fceeadfa7764439b36e92fd72da31e1c519edda31767b663ddc67eec60f285bd","schema_version":"1.0","event_id":"sha256:fceeadfa7764439b36e92fd72da31e1c519edda31767b663ddc67eec60f285bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O4ZCIFXZKKKKAEDSBI7EFPPWUD","target":"graph","payload":{"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"},"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-18T00:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9x01iy73C4W200I4/ezhs8J2AKwFAuXEThl2ULqfgiW6L3mUinuVilPSf/JVgHRIzre9Djy7wl1/6oYDgvIhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:25:40.119104Z"},"content_sha256":"5e1efa422316440ef46022d39a06c205829ebae1b976eb36dafac243e65dc036","schema_version":"1.0","event_id":"sha256:5e1efa422316440ef46022d39a06c205829ebae1b976eb36dafac243e65dc036"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/bundle.json","state_url":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/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-06-04T14:25:40Z","links":{"resolver":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD","bundle":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/bundle.json","state":"https://pith.science/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4ZCIFXZKKKKAEDSBI7EFPPWUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O4ZCIFXZKKKKAEDSBI7EFPPWUD","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":"25635afdcd646e2943a39c7bb86d8a88d4c8b53e1ac1395a4dafc0975377a94e","cross_cats_sorted":["cs.CC","cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-26T22:59:07Z","title_canon_sha256":"db8052c2e3431aca0a6fb1b3fd02afcf9035b037f4deb4b34c37c6c566108c91"},"schema_version":"1.0","source":{"id":"1611.08757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08757","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08757v2","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08757","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"O4ZCIFXZKKKK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O4ZCIFXZKKKKAEDS","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O4ZCIFXZ","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:5e1efa422316440ef46022d39a06c205829ebae1b976eb36dafac243e65dc036","target":"graph","created_at":"2026-05-18T00:56:18Z","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":"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","authors_text":"Harishchandra Ramadas, Rebecca Hoberg, Thomas Rothvoss, Xin Yang","cross_cats":["cs.CC","cs.CG","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-26T22:59:07Z","title":"Number Balancing is as hard as Minkowski's Theorem and Shortest Vector"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08757","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:fceeadfa7764439b36e92fd72da31e1c519edda31767b663ddc67eec60f285bd","target":"record","created_at":"2026-05-18T00:56:18Z","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":"25635afdcd646e2943a39c7bb86d8a88d4c8b53e1ac1395a4dafc0975377a94e","cross_cats_sorted":["cs.CC","cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-26T22:59:07Z","title_canon_sha256":"db8052c2e3431aca0a6fb1b3fd02afcf9035b037f4deb4b34c37c6c566108c91"},"schema_version":"1.0","source":{"id":"1611.08757","kind":"arxiv","version":2}},"canonical_sha256":"77322416f95294a010720a3e42bdf6a0f0f37388ca2e0bf48892512479d15e0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77322416f95294a010720a3e42bdf6a0f0f37388ca2e0bf48892512479d15e0f","first_computed_at":"2026-05-18T00:56:18.839147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:18.839147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgHcgyfmPL5bOcIGNUoQPZyDIopsXiWq4V0SEllqYHk/Nx/GPiibr7EoDf+gycT3UKpsR1z9WMhg2IVzKiMCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:18.839991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fceeadfa7764439b36e92fd72da31e1c519edda31767b663ddc67eec60f285bd","sha256:5e1efa422316440ef46022d39a06c205829ebae1b976eb36dafac243e65dc036"],"state_sha256":"0c3b4243043e25613f344c0b431197d09ad05408e169f1b9f7842ea71787dde8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQkBIAu5AYUSYtufhPiuxngozZQA3qiXsZIk+e6Gl7u4LasNkpub81yslLkxVeniP8eCiVGS6UuxzlkQrx0gDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:25:40.121406Z","bundle_sha256":"ca257772a02d8924837a22c2b9b0d562b3eda6e54c9a04625c4d8f4462f8e056"}}