{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KCKZDJZH3IF66QCFGZO5CI3DEZ","short_pith_number":"pith:KCKZDJZH","schema_version":"1.0","canonical_sha256":"509591a727da0bef4045365dd123632659f72528426d9a41603a732d94d701be","source":{"kind":"arxiv","id":"1503.08796","version":1},"attestation_state":"computed","paper":{"title":"A Logarithmic Additive Integrality Gap for Bin Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Rebecca Hoberg, Thomas Rothvoss","submitted_at":"2015-03-30T19:02:12Z","abstract_excerpt":"For bin packing, the input consists of $n$ items with sizes $s_1,...,s_n \\in [0,1]$ which have to be assigned to a minimum number of bins of size 1. Recently, the second author gave an LP-based polynomial time algorithm that employed techniques from discrepancy theory to find a solution using at most $OPT + O(\\log OPT \\cdot \\log \\log OPT)$ bins.\n  In this paper, we present an approximation algorithm that has an additive gap of only $O(\\log OPT)$ bins, which matches certain combinatorial lower bounds. Any further improvement would have to use more algebraic structure. Our improvement is based o"},"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":"1503.08796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-30T19:02:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d8232f1d4f23a911aa958f91ac0607a66116781982fb1bc16d42b6982c259346","abstract_canon_sha256":"fa169622de78df717a5806aec9d9b220c8f8f80b29a335594c2f5f13f551a13b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:00.914631Z","signature_b64":"hShMmk3fqUThOb0bgF7PtpzClRW8BNlt/iPepQ1W7gmqc3Kok02rh0yNC6f2iHF4zGA9x0m6TnwNhAhkUrQiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"509591a727da0bef4045365dd123632659f72528426d9a41603a732d94d701be","last_reissued_at":"2026-05-18T02:20:00.914137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:00.914137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Logarithmic Additive Integrality Gap for Bin Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Rebecca Hoberg, Thomas Rothvoss","submitted_at":"2015-03-30T19:02:12Z","abstract_excerpt":"For bin packing, the input consists of $n$ items with sizes $s_1,...,s_n \\in [0,1]$ which have to be assigned to a minimum number of bins of size 1. Recently, the second author gave an LP-based polynomial time algorithm that employed techniques from discrepancy theory to find a solution using at most $OPT + O(\\log OPT \\cdot \\log \\log OPT)$ bins.\n  In this paper, we present an approximation algorithm that has an additive gap of only $O(\\log OPT)$ bins, which matches certain combinatorial lower bounds. Any further improvement would have to use more algebraic structure. Our improvement is based o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08796","kind":"arxiv","version":1},"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":"1503.08796","created_at":"2026-05-18T02:20:00.914210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08796v1","created_at":"2026-05-18T02:20:00.914210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08796","created_at":"2026-05-18T02:20:00.914210+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCKZDJZH3IF6","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCKZDJZH3IF66QCF","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCKZDJZH","created_at":"2026-05-18T12:29:27.538025+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/KCKZDJZH3IF66QCFGZO5CI3DEZ","json":"https://pith.science/pith/KCKZDJZH3IF66QCFGZO5CI3DEZ.json","graph_json":"https://pith.science/api/pith-number/KCKZDJZH3IF66QCFGZO5CI3DEZ/graph.json","events_json":"https://pith.science/api/pith-number/KCKZDJZH3IF66QCFGZO5CI3DEZ/events.json","paper":"https://pith.science/paper/KCKZDJZH"},"agent_actions":{"view_html":"https://pith.science/pith/KCKZDJZH3IF66QCFGZO5CI3DEZ","download_json":"https://pith.science/pith/KCKZDJZH3IF66QCFGZO5CI3DEZ.json","view_paper":"https://pith.science/paper/KCKZDJZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08796&json=true","fetch_graph":"https://pith.science/api/pith-number/KCKZDJZH3IF66QCFGZO5CI3DEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KCKZDJZH3IF66QCFGZO5CI3DEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCKZDJZH3IF66QCFGZO5CI3DEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCKZDJZH3IF66QCFGZO5CI3DEZ/action/storage_attestation","attest_author":"https://pith.science/pith/KCKZDJZH3IF66QCFGZO5CI3DEZ/action/author_attestation","sign_citation":"https://pith.science/pith/KCKZDJZH3IF66QCFGZO5CI3DEZ/action/citation_signature","submit_replication":"https://pith.science/pith/KCKZDJZH3IF66QCFGZO5CI3DEZ/action/replication_record"}},"created_at":"2026-05-18T02:20:00.914210+00:00","updated_at":"2026-05-18T02:20:00.914210+00:00"}