{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TJP7CB5NSF75KGFSGOLUMPAFAI","short_pith_number":"pith:TJP7CB5N","schema_version":"1.0","canonical_sha256":"9a5ff107ad917fd518b23397463c05020e74be7b3179b9f9dee01d626af83c52","source":{"kind":"arxiv","id":"1404.4526","version":1},"attestation_state":"computed","paper":{"title":"An All-Around Near-Optimal Solution for the Classic Bin Packing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro L\\'opez-Ortiz, Shahin Kamali","submitted_at":"2014-04-17T13:47:49Z","abstract_excerpt":"In this paper we present the first algorithm with optimal average-case and close-to-best known worst-case performance for the classic on-line problem of bin packing. It has long been observed that known bin packing algorithms with optimal average-case performance were not optimal in the worst-case sense. In particular First Fit and Best Fit had optimal average-case ratio of 1 but a worst-case competitive ratio of 1.7. The wasted space of First Fit and Best Fit for a uniform random sequence of length $n$ is expected to be $\\Theta(n^{2/3})$ and $\\Theta(\\sqrt{n} \\log ^{3/4} n)$, respectively. The"},"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":"1404.4526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T13:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"024b6ddb1dfa1e7b94d53bd82244128787fc38bc22504e886d6e0a2ee44a8e02","abstract_canon_sha256":"ca293d01b21fea8f8fe931c0c4102988c94909d46b954f0bc3e387a8ddf77a9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:04.088218Z","signature_b64":"2FztIByYrbRRg7p/gXPUZT4ijegzcXIYPNjmPC+XmT06tB/IZiaScQ8BEi2Vo5TulNTvPzGTiUn6ixxtbKWfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a5ff107ad917fd518b23397463c05020e74be7b3179b9f9dee01d626af83c52","last_reissued_at":"2026-05-18T02:54:04.087755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:04.087755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An All-Around Near-Optimal Solution for the Classic Bin Packing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro L\\'opez-Ortiz, Shahin Kamali","submitted_at":"2014-04-17T13:47:49Z","abstract_excerpt":"In this paper we present the first algorithm with optimal average-case and close-to-best known worst-case performance for the classic on-line problem of bin packing. It has long been observed that known bin packing algorithms with optimal average-case performance were not optimal in the worst-case sense. In particular First Fit and Best Fit had optimal average-case ratio of 1 but a worst-case competitive ratio of 1.7. The wasted space of First Fit and Best Fit for a uniform random sequence of length $n$ is expected to be $\\Theta(n^{2/3})$ and $\\Theta(\\sqrt{n} \\log ^{3/4} n)$, respectively. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4526","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":"1404.4526","created_at":"2026-05-18T02:54:04.087830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4526v1","created_at":"2026-05-18T02:54:04.087830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4526","created_at":"2026-05-18T02:54:04.087830+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJP7CB5NSF75","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJP7CB5NSF75KGFS","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJP7CB5N","created_at":"2026-05-18T12:28:49.207871+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/TJP7CB5NSF75KGFSGOLUMPAFAI","json":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI.json","graph_json":"https://pith.science/api/pith-number/TJP7CB5NSF75KGFSGOLUMPAFAI/graph.json","events_json":"https://pith.science/api/pith-number/TJP7CB5NSF75KGFSGOLUMPAFAI/events.json","paper":"https://pith.science/paper/TJP7CB5N"},"agent_actions":{"view_html":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI","download_json":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI.json","view_paper":"https://pith.science/paper/TJP7CB5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4526&json=true","fetch_graph":"https://pith.science/api/pith-number/TJP7CB5NSF75KGFSGOLUMPAFAI/graph.json","fetch_events":"https://pith.science/api/pith-number/TJP7CB5NSF75KGFSGOLUMPAFAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/action/storage_attestation","attest_author":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/action/author_attestation","sign_citation":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/action/citation_signature","submit_replication":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/action/replication_record"}},"created_at":"2026-05-18T02:54:04.087830+00:00","updated_at":"2026-05-18T02:54:04.087830+00:00"}