{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OMUUTOEA627DXDUIQ3B7OF7L2A","short_pith_number":"pith:OMUUTOEA","schema_version":"1.0","canonical_sha256":"732949b880f6be3b8e8886c3f717ebd018a9f2f5dec59850b945035495ae619e","source":{"kind":"arxiv","id":"1404.3990","version":1},"attestation_state":"computed","paper":{"title":"Colorful bin packing","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-15T17:12:38Z","abstract_excerpt":"We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size s_i \\in [0,1] and a color c_i \\in C, where C is a set of colors (that is not necessarily known in advance). The total size of items packed into a bin cannot exceed its size, thus an item i can always be packed into a new bin, but an item cannot be packed into a non-empty bin if the previous item packed into that bin has the same color, or if the occupied space in it is larger than 1-s_i. This problem generalizes"},"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.3990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-15T17:12:38Z","cross_cats_sorted":[],"title_canon_sha256":"62279e69dd5642416cf49f1ab2a5dbb08afac3754467ad80e4ebd8d09414118c","abstract_canon_sha256":"6c971b619044889c88daaa47fb0e26640dd65326eb3dcf7b3adf9fd390de9f13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:13.216307Z","signature_b64":"0VItaaD/bi676SSj5mwL7ymZsrb91tXL9ML2jN1I/2p1JopjdnWQYCxpHHJIaKPA9KFWv1CkT+EWDUdd3vJ7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"732949b880f6be3b8e8886c3f717ebd018a9f2f5dec59850b945035495ae619e","last_reissued_at":"2026-05-18T02:54:13.215870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:13.215870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colorful bin packing","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-15T17:12:38Z","abstract_excerpt":"We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size s_i \\in [0,1] and a color c_i \\in C, where C is a set of colors (that is not necessarily known in advance). The total size of items packed into a bin cannot exceed its size, thus an item i can always be packed into a new bin, but an item cannot be packed into a non-empty bin if the previous item packed into that bin has the same color, or if the occupied space in it is larger than 1-s_i. This problem generalizes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3990","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.3990","created_at":"2026-05-18T02:54:13.215940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3990v1","created_at":"2026-05-18T02:54:13.215940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3990","created_at":"2026-05-18T02:54:13.215940+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMUUTOEA627D","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMUUTOEA627DXDUI","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMUUTOEA","created_at":"2026-05-18T12:28:41.024544+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/OMUUTOEA627DXDUIQ3B7OF7L2A","json":"https://pith.science/pith/OMUUTOEA627DXDUIQ3B7OF7L2A.json","graph_json":"https://pith.science/api/pith-number/OMUUTOEA627DXDUIQ3B7OF7L2A/graph.json","events_json":"https://pith.science/api/pith-number/OMUUTOEA627DXDUIQ3B7OF7L2A/events.json","paper":"https://pith.science/paper/OMUUTOEA"},"agent_actions":{"view_html":"https://pith.science/pith/OMUUTOEA627DXDUIQ3B7OF7L2A","download_json":"https://pith.science/pith/OMUUTOEA627DXDUIQ3B7OF7L2A.json","view_paper":"https://pith.science/paper/OMUUTOEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3990&json=true","fetch_graph":"https://pith.science/api/pith-number/OMUUTOEA627DXDUIQ3B7OF7L2A/graph.json","fetch_events":"https://pith.science/api/pith-number/OMUUTOEA627DXDUIQ3B7OF7L2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMUUTOEA627DXDUIQ3B7OF7L2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMUUTOEA627DXDUIQ3B7OF7L2A/action/storage_attestation","attest_author":"https://pith.science/pith/OMUUTOEA627DXDUIQ3B7OF7L2A/action/author_attestation","sign_citation":"https://pith.science/pith/OMUUTOEA627DXDUIQ3B7OF7L2A/action/citation_signature","submit_replication":"https://pith.science/pith/OMUUTOEA627DXDUIQ3B7OF7L2A/action/replication_record"}},"created_at":"2026-05-18T02:54:13.215940+00:00","updated_at":"2026-05-18T02:54:13.215940+00:00"}