{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TJP7CB5NSF75KGFSGOLUMPAFAI","short_pith_number":"pith:TJP7CB5N","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"},"canonical_sha256":"9a5ff107ad917fd518b23397463c05020e74be7b3179b9f9dee01d626af83c52","source":{"kind":"arxiv","id":"1404.4526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4526","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4526v1","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4526","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"TJP7CB5NSF75","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TJP7CB5NSF75KGFS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TJP7CB5N","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TJP7CB5NSF75KGFSGOLUMPAFAI","target":"record","payload":{"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"},"canonical_sha256":"9a5ff107ad917fd518b23397463c05020e74be7b3179b9f9dee01d626af83c52","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"},"source_kind":"arxiv","source_id":"1404.4526","source_version":1,"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-18T02:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKNduc4r24QQ4x+ElJWJJvqP3QUAq19ov8cAg2naNyDxjRTiANkfAYdjM2T+yDUeNfw5RMvSd6yn91gm277qAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:54:10.925015Z"},"content_sha256":"4112c2e6680c5f6ff98e02acc1b2b733c54ed4f0c0da7f680060ab415ff77249","schema_version":"1.0","event_id":"sha256:4112c2e6680c5f6ff98e02acc1b2b733c54ed4f0c0da7f680060ab415ff77249"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TJP7CB5NSF75KGFSGOLUMPAFAI","target":"graph","payload":{"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"},"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-18T02:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCdOs16AxiEvXCXKRtuvVfkcksbPu6UsbBt/zM65271z11IblcGM/qzr3HS1pOXVhA/POfIq8bbpyaPlWm0+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:54:10.925390Z"},"content_sha256":"1811966bffbd2f70f107ff8f07e8a8cb1ae7f730afc97e6bbc78b0419a31dbd2","schema_version":"1.0","event_id":"sha256:1811966bffbd2f70f107ff8f07e8a8cb1ae7f730afc97e6bbc78b0419a31dbd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/bundle.json","state_url":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/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-23T16:54:10Z","links":{"resolver":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI","bundle":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/bundle.json","state":"https://pith.science/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJP7CB5NSF75KGFSGOLUMPAFAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TJP7CB5NSF75KGFSGOLUMPAFAI","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":"ca293d01b21fea8f8fe931c0c4102988c94909d46b954f0bc3e387a8ddf77a9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T13:47:49Z","title_canon_sha256":"024b6ddb1dfa1e7b94d53bd82244128787fc38bc22504e886d6e0a2ee44a8e02"},"schema_version":"1.0","source":{"id":"1404.4526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4526","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4526v1","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4526","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"TJP7CB5NSF75","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TJP7CB5NSF75KGFS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TJP7CB5N","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:1811966bffbd2f70f107ff8f07e8a8cb1ae7f730afc97e6bbc78b0419a31dbd2","target":"graph","created_at":"2026-05-18T02:54:04Z","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":"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","authors_text":"Alejandro L\\'opez-Ortiz, Shahin Kamali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T13:47:49Z","title":"An All-Around Near-Optimal Solution for the Classic Bin Packing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4526","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:4112c2e6680c5f6ff98e02acc1b2b733c54ed4f0c0da7f680060ab415ff77249","target":"record","created_at":"2026-05-18T02:54:04Z","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":"ca293d01b21fea8f8fe931c0c4102988c94909d46b954f0bc3e387a8ddf77a9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T13:47:49Z","title_canon_sha256":"024b6ddb1dfa1e7b94d53bd82244128787fc38bc22504e886d6e0a2ee44a8e02"},"schema_version":"1.0","source":{"id":"1404.4526","kind":"arxiv","version":1}},"canonical_sha256":"9a5ff107ad917fd518b23397463c05020e74be7b3179b9f9dee01d626af83c52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a5ff107ad917fd518b23397463c05020e74be7b3179b9f9dee01d626af83c52","first_computed_at":"2026-05-18T02:54:04.087755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:04.087755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2FztIByYrbRRg7p/gXPUZT4ijegzcXIYPNjmPC+XmT06tB/IZiaScQ8BEi2Vo5TulNTvPzGTiUn6ixxtbKWfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:04.088218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4112c2e6680c5f6ff98e02acc1b2b733c54ed4f0c0da7f680060ab415ff77249","sha256:1811966bffbd2f70f107ff8f07e8a8cb1ae7f730afc97e6bbc78b0419a31dbd2"],"state_sha256":"76fc5c12c4601ee4bf29bf7267ee7fd76b1eddd5e3351cfea36f4577b8444fce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQmbycBl3ZJdQCVIUAituvhS5C4ogvKhPsDUoS2zEreaic21NW+PijwdIDbziISLqkYpped1SpWqiRf4oTvQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:54:10.927294Z","bundle_sha256":"7461e7400742f519b146d79f8052da0854c6fa2457167aa1af74cbdb47096580"}}