{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MKMYP2BNIFB7U3LSCWXS2VECSE","short_pith_number":"pith:MKMYP2BN","schema_version":"1.0","canonical_sha256":"629987e82d4143fa6d7215af2d54829122179025eca688c99e49e6df41068d72","source":{"kind":"arxiv","id":"1404.1056","version":1},"attestation_state":"computed","paper":{"title":"Online bin packing with cardinality constraints revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gyorgy Dosa, Leah Epstein","submitted_at":"2014-04-03T19:34:50Z","abstract_excerpt":"Bin packing with cardinality constraints is a bin packing problem where an upper bound k \\geq 2 on the number of items packed into each bin is given, in addition to the standard constraint on the total size of items packed into a bin. We study the online scenario where items are presented one by one. We analyze it with respect to the absolute competitive ratio and prove tight bounds of 2 for any k \\geq 4. We show that First Fit also has an absolute competitive ratio of 2 for k=4, but not for larger values of k, and we present a complete analysis of its asymptotic competitive ratio for all valu"},"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":"1404.1056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T19:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"3c9aaf2445e7b55a411a16687f753f777c6f2d04e4462921262fd64acea8db27","abstract_canon_sha256":"8be125d1cd894e0bb8713eeeece498641bf45aa741735ce24c52a042dab76d3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:54.680363Z","signature_b64":"ag5FEDCzUkr6/J+CPc+C01ORHWlrPdiiXWHOBmhkrv+LP3GR5gENONpWXlZHNWf2Hf5ZUUpjyyu2FLlm++TwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"629987e82d4143fa6d7215af2d54829122179025eca688c99e49e6df41068d72","last_reissued_at":"2026-05-18T02:54:54.679732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:54.679732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online bin packing with cardinality constraints revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gyorgy Dosa, Leah Epstein","submitted_at":"2014-04-03T19:34:50Z","abstract_excerpt":"Bin packing with cardinality constraints is a bin packing problem where an upper bound k \\geq 2 on the number of items packed into each bin is given, in addition to the standard constraint on the total size of items packed into a bin. We study the online scenario where items are presented one by one. We analyze it with respect to the absolute competitive ratio and prove tight bounds of 2 for any k \\geq 4. We show that First Fit also has an absolute competitive ratio of 2 for k=4, but not for larger values of k, and we present a complete analysis of its asymptotic competitive ratio for all valu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1056","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":"1404.1056","created_at":"2026-05-18T02:54:54.679828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1056v1","created_at":"2026-05-18T02:54:54.679828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1056","created_at":"2026-05-18T02:54:54.679828+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKMYP2BNIFB7","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKMYP2BNIFB7U3LS","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKMYP2BN","created_at":"2026-05-18T12:28:38.356838+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/MKMYP2BNIFB7U3LSCWXS2VECSE","json":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE.json","graph_json":"https://pith.science/api/pith-number/MKMYP2BNIFB7U3LSCWXS2VECSE/graph.json","events_json":"https://pith.science/api/pith-number/MKMYP2BNIFB7U3LSCWXS2VECSE/events.json","paper":"https://pith.science/paper/MKMYP2BN"},"agent_actions":{"view_html":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE","download_json":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE.json","view_paper":"https://pith.science/paper/MKMYP2BN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1056&json=true","fetch_graph":"https://pith.science/api/pith-number/MKMYP2BNIFB7U3LSCWXS2VECSE/graph.json","fetch_events":"https://pith.science/api/pith-number/MKMYP2BNIFB7U3LSCWXS2VECSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/action/storage_attestation","attest_author":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/action/author_attestation","sign_citation":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/action/citation_signature","submit_replication":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/action/replication_record"}},"created_at":"2026-05-18T02:54:54.679828+00:00","updated_at":"2026-05-18T02:54:54.679828+00:00"}