{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BEBSJ7B3IZI2OANH6SHOWRDIRB","short_pith_number":"pith:BEBSJ7B3","schema_version":"1.0","canonical_sha256":"090324fc3b4651a701a7f48eeb4468887307b48230c512deb187a00a0140fc26","source":{"kind":"arxiv","id":"2512.02691","version":3},"attestation_state":"computed","paper":{"title":"A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Felix Ohnesorge, Klaus Jansen, Lis Pirotton","submitted_at":"2025-12-02T12:24:08Z","abstract_excerpt":"Consider a high-multiplicity Bin Packing instance $I$ with $d$ distinct item types. In 2014, Goemans and Rothvoss gave an algorithm with runtime ${{|I|}^2}^{O(d)}$ for this problem~[SODA'14], where $|I|$ denotes the encoding length of the instance $I$. Although Jansen and Klein~[SODA'17] later developed an algorithm that improves upon this runtime in a special case, it has remained a major open problem by Goemans and Rothvoss~[J.ACM'20] whether the doubly exponential dependency on $d$ is necessary.\n  We solve this open problem by showing that unless the ETH fails, there is no algorithm solving"},"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":"2512.02691","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-12-02T12:24:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e8922f1d0a02a29beb918ba0f9b7eaa07fb73fb468388dc6632ff223ec06e03e","abstract_canon_sha256":"55e1eafe24105216819485058606003f11c615fe31c27ead6a668d3f9b2c5f4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:38.516505Z","signature_b64":"KGpBvlK9WJ3Bdv8Phozb1mGsDzQTw9h4gMjk0q1rlmiipXRXbpRwV8nYlMdo7gZkkSymIJe6CpHo7tSD2gFvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"090324fc3b4651a701a7f48eeb4468887307b48230c512deb187a00a0140fc26","last_reissued_at":"2026-05-20T00:05:38.515629Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:38.515629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Felix Ohnesorge, Klaus Jansen, Lis Pirotton","submitted_at":"2025-12-02T12:24:08Z","abstract_excerpt":"Consider a high-multiplicity Bin Packing instance $I$ with $d$ distinct item types. In 2014, Goemans and Rothvoss gave an algorithm with runtime ${{|I|}^2}^{O(d)}$ for this problem~[SODA'14], where $|I|$ denotes the encoding length of the instance $I$. Although Jansen and Klein~[SODA'17] later developed an algorithm that improves upon this runtime in a special case, it has remained a major open problem by Goemans and Rothvoss~[J.ACM'20] whether the doubly exponential dependency on $d$ is necessary.\n  We solve this open problem by showing that unless the ETH fails, there is no algorithm solving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.02691","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.02691/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2512.02691","created_at":"2026-05-20T00:05:38.515779+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.02691v3","created_at":"2026-05-20T00:05:38.515779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.02691","created_at":"2026-05-20T00:05:38.515779+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEBSJ7B3IZI2","created_at":"2026-05-20T00:05:38.515779+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEBSJ7B3IZI2OANH","created_at":"2026-05-20T00:05:38.515779+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEBSJ7B3","created_at":"2026-05-20T00:05:38.515779+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/BEBSJ7B3IZI2OANH6SHOWRDIRB","json":"https://pith.science/pith/BEBSJ7B3IZI2OANH6SHOWRDIRB.json","graph_json":"https://pith.science/api/pith-number/BEBSJ7B3IZI2OANH6SHOWRDIRB/graph.json","events_json":"https://pith.science/api/pith-number/BEBSJ7B3IZI2OANH6SHOWRDIRB/events.json","paper":"https://pith.science/paper/BEBSJ7B3"},"agent_actions":{"view_html":"https://pith.science/pith/BEBSJ7B3IZI2OANH6SHOWRDIRB","download_json":"https://pith.science/pith/BEBSJ7B3IZI2OANH6SHOWRDIRB.json","view_paper":"https://pith.science/paper/BEBSJ7B3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.02691&json=true","fetch_graph":"https://pith.science/api/pith-number/BEBSJ7B3IZI2OANH6SHOWRDIRB/graph.json","fetch_events":"https://pith.science/api/pith-number/BEBSJ7B3IZI2OANH6SHOWRDIRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEBSJ7B3IZI2OANH6SHOWRDIRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEBSJ7B3IZI2OANH6SHOWRDIRB/action/storage_attestation","attest_author":"https://pith.science/pith/BEBSJ7B3IZI2OANH6SHOWRDIRB/action/author_attestation","sign_citation":"https://pith.science/pith/BEBSJ7B3IZI2OANH6SHOWRDIRB/action/citation_signature","submit_replication":"https://pith.science/pith/BEBSJ7B3IZI2OANH6SHOWRDIRB/action/replication_record"}},"created_at":"2026-05-20T00:05:38.515779+00:00","updated_at":"2026-05-20T00:05:38.515779+00:00"}