{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4GVKY53W7EDRLWU4X3S2K6OST4","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":"d0fec00b6f7cbe5f75c1064a0204e01fa9fc492255450c6c9b6e865b0709d0f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-23T08:24:00Z","title_canon_sha256":"2e335e9c114023ccc5af40b43523b324d5ab8b09105e1537d2516fd071731999"},"schema_version":"1.0","source":{"id":"1608.06415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06415","created_at":"2026-05-18T01:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06415v1","created_at":"2026-05-18T01:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06415","created_at":"2026-05-18T01:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"4GVKY53W7EDR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GVKY53W7EDRLWU4","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GVKY53W","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:bcb54801471a915f650d99d822d4089a63d40375b6cd8b08d851c8c747e129e7","target":"graph","created_at":"2026-05-18T01:08:14Z","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":"Cardinality constrained bin packing or bin packing with cardinality constraints is a basic bin packing problem. In the online version with the parameter k \\geq 2, items having sizes in (0,1] associated with them are presented one by one to be packed into unit capacity bins, such that the capacities of bins are not exceeded, and no bin receives more than k items. We resolve the online problem in the sense that we prove a lower bound of 2 on the overall asymptotic competitive ratio. This closes this long standing open problem, since an algorithm of an absolute competitive ratio 2 is known. Addit","authors_text":"Asaf Levin, Gy\\\"orgy D\\'osa, J\\'anos Balogh, J\\'ozsef B\\'ek\\'esi, Leah Epstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-23T08:24:00Z","title":"Online bin packing with cardinality constraints resolved"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06415","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:a853ea31f777b3bcdb4c6dcbfe0f228d747a33959edf409a10b32b433c8341c4","target":"record","created_at":"2026-05-18T01:08:14Z","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":"d0fec00b6f7cbe5f75c1064a0204e01fa9fc492255450c6c9b6e865b0709d0f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-23T08:24:00Z","title_canon_sha256":"2e335e9c114023ccc5af40b43523b324d5ab8b09105e1537d2516fd071731999"},"schema_version":"1.0","source":{"id":"1608.06415","kind":"arxiv","version":1}},"canonical_sha256":"e1aaac7776f90715da9cbee5a579d29f3f374eaf9b0df84a81eda58d7b73a003","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1aaac7776f90715da9cbee5a579d29f3f374eaf9b0df84a81eda58d7b73a003","first_computed_at":"2026-05-18T01:08:14.088511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:14.088511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mqQPyefE+bVLIDqE0L+3YAygmJnPaB0jz1jo3Hhlw5y+trQLCIViUDqZVJPlNSMH1qfu7l5Uz52pRhILuccYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:14.088950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a853ea31f777b3bcdb4c6dcbfe0f228d747a33959edf409a10b32b433c8341c4","sha256:bcb54801471a915f650d99d822d4089a63d40375b6cd8b08d851c8c747e129e7"],"state_sha256":"2c9a098dd40ac4b3cf961ce3924d6c18d4e30d7ada41a270433d3d3c965ee1be"}