{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4GVKY53W7EDRLWU4X3S2K6OST4","short_pith_number":"pith:4GVKY53W","schema_version":"1.0","canonical_sha256":"e1aaac7776f90715da9cbee5a579d29f3f374eaf9b0df84a81eda58d7b73a003","source":{"kind":"arxiv","id":"1608.06415","version":1},"attestation_state":"computed","paper":{"title":"Online bin packing with cardinality constraints resolved","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Gy\\\"orgy D\\'osa, J\\'anos Balogh, J\\'ozsef B\\'ek\\'esi, Leah Epstein","submitted_at":"2016-08-23T08:24:00Z","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"},"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":"1608.06415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-23T08:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"2e335e9c114023ccc5af40b43523b324d5ab8b09105e1537d2516fd071731999","abstract_canon_sha256":"d0fec00b6f7cbe5f75c1064a0204e01fa9fc492255450c6c9b6e865b0709d0f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:14.088950Z","signature_b64":"mqQPyefE+bVLIDqE0L+3YAygmJnPaB0jz1jo3Hhlw5y+trQLCIViUDqZVJPlNSMH1qfu7l5Uz52pRhILuccYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1aaac7776f90715da9cbee5a579d29f3f374eaf9b0df84a81eda58d7b73a003","last_reissued_at":"2026-05-18T01:08:14.088511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:14.088511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online bin packing with cardinality constraints resolved","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Gy\\\"orgy D\\'osa, J\\'anos Balogh, J\\'ozsef B\\'ek\\'esi, Leah Epstein","submitted_at":"2016-08-23T08:24:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06415","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":"1608.06415","created_at":"2026-05-18T01:08:14.088584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06415v1","created_at":"2026-05-18T01:08:14.088584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06415","created_at":"2026-05-18T01:08:14.088584+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GVKY53W7EDR","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GVKY53W7EDRLWU4","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GVKY53W","created_at":"2026-05-18T12:29:58.707656+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/4GVKY53W7EDRLWU4X3S2K6OST4","json":"https://pith.science/pith/4GVKY53W7EDRLWU4X3S2K6OST4.json","graph_json":"https://pith.science/api/pith-number/4GVKY53W7EDRLWU4X3S2K6OST4/graph.json","events_json":"https://pith.science/api/pith-number/4GVKY53W7EDRLWU4X3S2K6OST4/events.json","paper":"https://pith.science/paper/4GVKY53W"},"agent_actions":{"view_html":"https://pith.science/pith/4GVKY53W7EDRLWU4X3S2K6OST4","download_json":"https://pith.science/pith/4GVKY53W7EDRLWU4X3S2K6OST4.json","view_paper":"https://pith.science/paper/4GVKY53W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06415&json=true","fetch_graph":"https://pith.science/api/pith-number/4GVKY53W7EDRLWU4X3S2K6OST4/graph.json","fetch_events":"https://pith.science/api/pith-number/4GVKY53W7EDRLWU4X3S2K6OST4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GVKY53W7EDRLWU4X3S2K6OST4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GVKY53W7EDRLWU4X3S2K6OST4/action/storage_attestation","attest_author":"https://pith.science/pith/4GVKY53W7EDRLWU4X3S2K6OST4/action/author_attestation","sign_citation":"https://pith.science/pith/4GVKY53W7EDRLWU4X3S2K6OST4/action/citation_signature","submit_replication":"https://pith.science/pith/4GVKY53W7EDRLWU4X3S2K6OST4/action/replication_record"}},"created_at":"2026-05-18T01:08:14.088584+00:00","updated_at":"2026-05-18T01:08:14.088584+00:00"}