{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7DEL2D7CX6YPGYRUHO5FQ6U6CT","short_pith_number":"pith:7DEL2D7C","canonical_record":{"source":{"id":"1511.00876","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T12:24:08Z","cross_cats_sorted":[],"title_canon_sha256":"701ef62f3b8900143e626f47d9c0976a37efb6efedd9df4dae04719731598ba1","abstract_canon_sha256":"6408dc0a8f1b05a311e95cf4587beb1f75c01987f6a0b7f344420ebee8107c0f"},"schema_version":"1.0"},"canonical_sha256":"f8c8bd0fe2bfb0f362343bba587a9e14c757e5b52ed3f156eeccd7dc020bd1bc","source":{"kind":"arxiv","id":"1511.00876","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00876","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00876v7","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00876","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"7DEL2D7CX6YP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"7DEL2D7CX6YPGYRU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"7DEL2D7C","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7DEL2D7CX6YPGYRUHO5FQ6U6CT","target":"record","payload":{"canonical_record":{"source":{"id":"1511.00876","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T12:24:08Z","cross_cats_sorted":[],"title_canon_sha256":"701ef62f3b8900143e626f47d9c0976a37efb6efedd9df4dae04719731598ba1","abstract_canon_sha256":"6408dc0a8f1b05a311e95cf4587beb1f75c01987f6a0b7f344420ebee8107c0f"},"schema_version":"1.0"},"canonical_sha256":"f8c8bd0fe2bfb0f362343bba587a9e14c757e5b52ed3f156eeccd7dc020bd1bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:11.652693Z","signature_b64":"W3uGkgVzSlHQJsL9zRKuUy3Jm/tr3VlN41DCv0VJP6+alGeKe1ZmElwvQ51E5woUpdWVFdUAlO7hNnUWGqlfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8c8bd0fe2bfb0f362343bba587a9e14c757e5b52ed3f156eeccd7dc020bd1bc","last_reissued_at":"2026-05-18T00:12:11.652213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:11.652213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.00876","source_version":7,"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-18T00:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/wwXj73UM2PZXDi6Z29LhqKArTdKAmzFcw2siCmLxFTo2gm8uTdtlOYqtLYxywWl66ffUbBChkQDZgkLc+/5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:43:09.260361Z"},"content_sha256":"f1cdb67faf27c6185ec72358a934842692f97ddc0cfd004b631b1a26f063b142","schema_version":"1.0","event_id":"sha256:f1cdb67faf27c6185ec72358a934842692f97ddc0cfd004b631b1a26f063b142"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7DEL2D7CX6YPGYRUHO5FQ6U6CT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beating the Harmonic lower bound for online bin packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rob van Stee, Sandy Heydrich","submitted_at":"2015-11-03T12:24:08Z","abstract_excerpt":"In the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. In this paper, we present an online bin packing algorithm with asymptotic competitive ratio of 1.5813. This is the first improvement in fifteen years and reduces the gap to the lower bound by 15%. Within the well-known SuperHarmonic framework, no competitive ratio below 1.58333 can be achieved.\n  We make two crucial changes to that framework. First, some of our algorithm's decisions depend on exact sizes of items, instead of only their type"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00876","kind":"arxiv","version":7},"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-18T00:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3zTh1F5KArl6ZqDCmFX4bvNv6jTKDtKPZQN5ZQUQOApSqzMsDRSERoif3nu1xXvPK7vI25kjys6F4HwoiQryCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:43:09.260709Z"},"content_sha256":"2b72c339e41cff2a271192b49cb0a1ad1384098fe08b471a1823150e21c5ae62","schema_version":"1.0","event_id":"sha256:2b72c339e41cff2a271192b49cb0a1ad1384098fe08b471a1823150e21c5ae62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DEL2D7CX6YPGYRUHO5FQ6U6CT/bundle.json","state_url":"https://pith.science/pith/7DEL2D7CX6YPGYRUHO5FQ6U6CT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DEL2D7CX6YPGYRUHO5FQ6U6CT/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-23T17:43:09Z","links":{"resolver":"https://pith.science/pith/7DEL2D7CX6YPGYRUHO5FQ6U6CT","bundle":"https://pith.science/pith/7DEL2D7CX6YPGYRUHO5FQ6U6CT/bundle.json","state":"https://pith.science/pith/7DEL2D7CX6YPGYRUHO5FQ6U6CT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DEL2D7CX6YPGYRUHO5FQ6U6CT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7DEL2D7CX6YPGYRUHO5FQ6U6CT","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":"6408dc0a8f1b05a311e95cf4587beb1f75c01987f6a0b7f344420ebee8107c0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T12:24:08Z","title_canon_sha256":"701ef62f3b8900143e626f47d9c0976a37efb6efedd9df4dae04719731598ba1"},"schema_version":"1.0","source":{"id":"1511.00876","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00876","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00876v7","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00876","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"7DEL2D7CX6YP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"7DEL2D7CX6YPGYRU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"7DEL2D7C","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:2b72c339e41cff2a271192b49cb0a1ad1384098fe08b471a1823150e21c5ae62","target":"graph","created_at":"2026-05-18T00:12:11Z","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 the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. In this paper, we present an online bin packing algorithm with asymptotic competitive ratio of 1.5813. This is the first improvement in fifteen years and reduces the gap to the lower bound by 15%. Within the well-known SuperHarmonic framework, no competitive ratio below 1.58333 can be achieved.\n  We make two crucial changes to that framework. First, some of our algorithm's decisions depend on exact sizes of items, instead of only their type","authors_text":"Rob van Stee, Sandy Heydrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T12:24:08Z","title":"Beating the Harmonic lower bound for online bin packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00876","kind":"arxiv","version":7},"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:f1cdb67faf27c6185ec72358a934842692f97ddc0cfd004b631b1a26f063b142","target":"record","created_at":"2026-05-18T00:12:11Z","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":"6408dc0a8f1b05a311e95cf4587beb1f75c01987f6a0b7f344420ebee8107c0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T12:24:08Z","title_canon_sha256":"701ef62f3b8900143e626f47d9c0976a37efb6efedd9df4dae04719731598ba1"},"schema_version":"1.0","source":{"id":"1511.00876","kind":"arxiv","version":7}},"canonical_sha256":"f8c8bd0fe2bfb0f362343bba587a9e14c757e5b52ed3f156eeccd7dc020bd1bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8c8bd0fe2bfb0f362343bba587a9e14c757e5b52ed3f156eeccd7dc020bd1bc","first_computed_at":"2026-05-18T00:12:11.652213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:11.652213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W3uGkgVzSlHQJsL9zRKuUy3Jm/tr3VlN41DCv0VJP6+alGeKe1ZmElwvQ51E5woUpdWVFdUAlO7hNnUWGqlfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:11.652693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.00876","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1cdb67faf27c6185ec72358a934842692f97ddc0cfd004b631b1a26f063b142","sha256:2b72c339e41cff2a271192b49cb0a1ad1384098fe08b471a1823150e21c5ae62"],"state_sha256":"066622e23bea27a5aa757743e8ab72ea06d9f4400e697fe46c6620175e2e28d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNVMdW8A2wZ/YqbSizEjtYma8iR4q7x/cbw8lyLijP5JjxEdVUJ35yN98w1/9Jdkvkt5qszMD7pLR5HcOnYkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:43:09.262616Z","bundle_sha256":"60853b18e7f91faffce0e6f5f5a29ea9c51e3fadf9f5b82f1cd40d93a5f93619"}}