{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BHKJUEGRF7ZKOOEMLVCLM3SDOO","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":"aa204e674d8c6ba85f06c1f4510c9b4b3f86925da96946d5eedc750f48266817","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-15T14:16:22Z","title_canon_sha256":"df58b2264dd0b685886b00f667714602fa6ed28a925792b89d4b0af495823a4d"},"schema_version":"1.0","source":{"id":"1807.05554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05554","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05554v1","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05554","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"BHKJUEGRF7ZK","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BHKJUEGRF7ZKOOEM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BHKJUEGR","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:25d9f27f00d4acf56c669991a446aab288e205aa80e7c761aabdbbc7a8a04338","target":"graph","created_at":"2026-05-18T00:10:43Z","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":"We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branching and the applicability of full adaptivity in the design of lower bounds for the classic online bin packing problem. We apply a new method for weight based analysis, which is usually applied only in proofs of upper bounds. The values of previous lower bounds were approximately 1.5401 and 1.5403.","authors_text":"Asaf Levin, Gy\\\"orgy D\\'osa, J\\'anos Balogh, J\\'ozsef B\\'ek\\'esi, Leah Epstein","cross_cats":["cs.DM","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-15T14:16:22Z","title":"A new lower bound for classic online bin packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05554","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:7ce3df2e0f5ad95ca6ebf0a84cc32f2bb27744878663b1b7ba86cf24f3b0d959","target":"record","created_at":"2026-05-18T00:10:43Z","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":"aa204e674d8c6ba85f06c1f4510c9b4b3f86925da96946d5eedc750f48266817","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-15T14:16:22Z","title_canon_sha256":"df58b2264dd0b685886b00f667714602fa6ed28a925792b89d4b0af495823a4d"},"schema_version":"1.0","source":{"id":"1807.05554","kind":"arxiv","version":1}},"canonical_sha256":"09d49a10d12ff2a7388c5d44b66e4373835a2a805973fd974ee947ac3b08517d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09d49a10d12ff2a7388c5d44b66e4373835a2a805973fd974ee947ac3b08517d","first_computed_at":"2026-05-18T00:10:43.236799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:43.236799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZfRmgVxcGAPd0QlASM2sDdp17V8QFgrU3UMmbmgR1z4Cj/kavn8jZTH2OFxfd4TyYubyK6BfnWJqVMMHBwtIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:43.237493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ce3df2e0f5ad95ca6ebf0a84cc32f2bb27744878663b1b7ba86cf24f3b0d959","sha256:25d9f27f00d4acf56c669991a446aab288e205aa80e7c761aabdbbc7a8a04338"],"state_sha256":"7af7974439ecfff375a75d7875a35a618f088e0eff52128dd62bbb9bbd1b09c7"}