{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KCKZDJZH3IF66QCFGZO5CI3DEZ","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":"fa169622de78df717a5806aec9d9b220c8f8f80b29a335594c2f5f13f551a13b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-30T19:02:12Z","title_canon_sha256":"d8232f1d4f23a911aa958f91ac0607a66116781982fb1bc16d42b6982c259346"},"schema_version":"1.0","source":{"id":"1503.08796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08796","created_at":"2026-05-18T02:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08796v1","created_at":"2026-05-18T02:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08796","created_at":"2026-05-18T02:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"KCKZDJZH3IF6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KCKZDJZH3IF66QCF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KCKZDJZH","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:2317440eb0caadb78f4a868cf5dd53576fb5c3ba7eb325529b443c6c5413b5fe","target":"graph","created_at":"2026-05-18T02:20:00Z","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":"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","authors_text":"Rebecca Hoberg, Thomas Rothvoss","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-30T19:02:12Z","title":"A Logarithmic Additive Integrality Gap for Bin Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08796","kind":"arxiv","version":1},"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:ba6eb8aad86f82b5902e2e42ff772c276d7b7603e07388ba4c7b7f6bbac2b595","target":"record","created_at":"2026-05-18T02:20:00Z","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":"fa169622de78df717a5806aec9d9b220c8f8f80b29a335594c2f5f13f551a13b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-30T19:02:12Z","title_canon_sha256":"d8232f1d4f23a911aa958f91ac0607a66116781982fb1bc16d42b6982c259346"},"schema_version":"1.0","source":{"id":"1503.08796","kind":"arxiv","version":1}},"canonical_sha256":"509591a727da0bef4045365dd123632659f72528426d9a41603a732d94d701be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"509591a727da0bef4045365dd123632659f72528426d9a41603a732d94d701be","first_computed_at":"2026-05-18T02:20:00.914137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:00.914137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hShMmk3fqUThOb0bgF7PtpzClRW8BNlt/iPepQ1W7gmqc3Kok02rh0yNC6f2iHF4zGA9x0m6TnwNhAhkUrQiCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:00.914631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba6eb8aad86f82b5902e2e42ff772c276d7b7603e07388ba4c7b7f6bbac2b595","sha256:2317440eb0caadb78f4a868cf5dd53576fb5c3ba7eb325529b443c6c5413b5fe"],"state_sha256":"dcd2ad9298a68cfb801776dcab2eb593302e77989768f401ccdfdde2593bdb34"}