{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MKMYP2BNIFB7U3LSCWXS2VECSE","short_pith_number":"pith:MKMYP2BN","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"},"canonical_sha256":"629987e82d4143fa6d7215af2d54829122179025eca688c99e49e6df41068d72","source":{"kind":"arxiv","id":"1404.1056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1056","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1056v1","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1056","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"MKMYP2BNIFB7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MKMYP2BNIFB7U3LS","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MKMYP2BN","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MKMYP2BNIFB7U3LSCWXS2VECSE","target":"record","payload":{"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"},"canonical_sha256":"629987e82d4143fa6d7215af2d54829122179025eca688c99e49e6df41068d72","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"},"source_kind":"arxiv","source_id":"1404.1056","source_version":1,"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-18T02:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFPNb57J2hKNgKUi9OVpDDk/gZCDRHTko7aErHqwxYvie8RMpShDxBVgLgtCgcujPtZHwA51UgCj4tmkzvrYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:52:55.623380Z"},"content_sha256":"1bbaf8f2489ceea17300e44cb96ae8266b1316e00d11ce5f79d39fd875461f08","schema_version":"1.0","event_id":"sha256:1bbaf8f2489ceea17300e44cb96ae8266b1316e00d11ce5f79d39fd875461f08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MKMYP2BNIFB7U3LSCWXS2VECSE","target":"graph","payload":{"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"},"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-18T02:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+LhPqDdUA1I3zPmK0qF4meXH5KZY83ZqK8Kav1epm+kDTc4jO0tr+nxWBeVVjloXCf+RWxulz+SfmqCWvGRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:52:55.623732Z"},"content_sha256":"25310bcb5150590b04d4a99144ba437e4d004d4d5986f16531ceb9f400f03052","schema_version":"1.0","event_id":"sha256:25310bcb5150590b04d4a99144ba437e4d004d4d5986f16531ceb9f400f03052"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/bundle.json","state_url":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/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-24T06:52:55Z","links":{"resolver":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE","bundle":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/bundle.json","state":"https://pith.science/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKMYP2BNIFB7U3LSCWXS2VECSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MKMYP2BNIFB7U3LSCWXS2VECSE","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":"8be125d1cd894e0bb8713eeeece498641bf45aa741735ce24c52a042dab76d3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T19:34:50Z","title_canon_sha256":"3c9aaf2445e7b55a411a16687f753f777c6f2d04e4462921262fd64acea8db27"},"schema_version":"1.0","source":{"id":"1404.1056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1056","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1056v1","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1056","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"MKMYP2BNIFB7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MKMYP2BNIFB7U3LS","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MKMYP2BN","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:25310bcb5150590b04d4a99144ba437e4d004d4d5986f16531ceb9f400f03052","target":"graph","created_at":"2026-05-18T02:54:54Z","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":"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","authors_text":"Gyorgy Dosa, Leah Epstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T19:34:50Z","title":"Online bin packing with cardinality constraints revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1056","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:1bbaf8f2489ceea17300e44cb96ae8266b1316e00d11ce5f79d39fd875461f08","target":"record","created_at":"2026-05-18T02:54:54Z","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":"8be125d1cd894e0bb8713eeeece498641bf45aa741735ce24c52a042dab76d3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T19:34:50Z","title_canon_sha256":"3c9aaf2445e7b55a411a16687f753f777c6f2d04e4462921262fd64acea8db27"},"schema_version":"1.0","source":{"id":"1404.1056","kind":"arxiv","version":1}},"canonical_sha256":"629987e82d4143fa6d7215af2d54829122179025eca688c99e49e6df41068d72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"629987e82d4143fa6d7215af2d54829122179025eca688c99e49e6df41068d72","first_computed_at":"2026-05-18T02:54:54.679732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:54.679732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ag5FEDCzUkr6/J+CPc+C01ORHWlrPdiiXWHOBmhkrv+LP3GR5gENONpWXlZHNWf2Hf5ZUUpjyyu2FLlm++TwDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:54.680363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bbaf8f2489ceea17300e44cb96ae8266b1316e00d11ce5f79d39fd875461f08","sha256:25310bcb5150590b04d4a99144ba437e4d004d4d5986f16531ceb9f400f03052"],"state_sha256":"a34834213a5bb159cd5c0c1c1b459ff34ab756ed14d70bd9a59565e3c5f746e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6F6mFl8ctjWaPHMewUOu6k5l1NnnwBkM+AGot3GZBi9F3PsHrn/RbQPsCY63BL1F5LcCjEgTfZpyxh7pdKaiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:52:55.625706Z","bundle_sha256":"b56aad532eb9276f66b526cc2af2720bfdd3dc01c296ae0771ba02d9fc6618e9"}}