{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:LBZJGBGVEG6OJOQ5DKIGDAJYMJ","short_pith_number":"pith:LBZJGBGV","canonical_record":{"source":{"id":"0910.5599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-29T10:00:37Z","cross_cats_sorted":[],"title_canon_sha256":"164bce1e246d2d25bf05a5f3507109371683f0b20ba669d458d07a78bab894aa","abstract_canon_sha256":"91d99af65b3546b4a73db7aa90c4b8bd91a48ef3b5cee9ab603da350b65d804c"},"schema_version":"1.0"},"canonical_sha256":"58729304d521bce4ba1d1a90618138624626cf6d59ccb5b05715af3378fe5d67","source":{"kind":"arxiv","id":"0910.5599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5599","created_at":"2026-05-18T02:11:01Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5599v1","created_at":"2026-05-18T02:11:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5599","created_at":"2026-05-18T02:11:01Z"},{"alias_kind":"pith_short_12","alias_value":"LBZJGBGVEG6O","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LBZJGBGVEG6OJOQ5","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LBZJGBGV","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:LBZJGBGVEG6OJOQ5DKIGDAJYMJ","target":"record","payload":{"canonical_record":{"source":{"id":"0910.5599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-29T10:00:37Z","cross_cats_sorted":[],"title_canon_sha256":"164bce1e246d2d25bf05a5f3507109371683f0b20ba669d458d07a78bab894aa","abstract_canon_sha256":"91d99af65b3546b4a73db7aa90c4b8bd91a48ef3b5cee9ab603da350b65d804c"},"schema_version":"1.0"},"canonical_sha256":"58729304d521bce4ba1d1a90618138624626cf6d59ccb5b05715af3378fe5d67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:01.794460Z","signature_b64":"exIWRsQbqHGujEGKBqn+QEWO+l06XtQOxd934y3yrXvGuMLSL0Lte8oslSo7uQWiNmW+eXjHYm1gh4DMH1jGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58729304d521bce4ba1d1a90618138624626cf6d59ccb5b05715af3378fe5d67","last_reissued_at":"2026-05-18T02:11:01.793795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:01.793795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.5599","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:11:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ao9AF1tiSXugyaHVGguMciFH7LPZ1zKf1vrfSglGWvtOV9dld/8C8pmM+1PunmQ7OXbvZB6YY3N1PpuwZXpiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:23:30.517783Z"},"content_sha256":"fb0f4bcef359cf02de25d8de5809394acc7e1693db4d5062c5fbb627124a4b61","schema_version":"1.0","event_id":"sha256:fb0f4bcef359cf02de25d8de5809394acc7e1693db4d5062c5fbb627124a4b61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:LBZJGBGVEG6OJOQ5DKIGDAJYMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vector Bin Packing with Multiple-Choice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Boaz Patt-Shamir, Dror Rawitz","submitted_at":"2009-10-29T10:00:37Z","abstract_excerpt":"We consider a variant of bin packing called multiple-choice vector bin packing. In this problem we are given a set of items, where each item can be selected in one of several $D$-dimensional incarnations. We are also given $T$ bin types, each with its own cost and $D$-dimensional size. Our goal is to pack the items in a set of bins of minimum overall cost. The problem is motivated by scheduling in networks with guaranteed quality of service (QoS), but due to its general formulation it has many other applications as well. We present an approximation algorithm that is guaranteed to produce a sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5599","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:11:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYAygzyV1Ii812DM8Ur+e4NpH27Op7FZNOIy6rcIhC0DZg47xXdVD9QR6clZc9oGNuKMVB90K8Sj9THiv8ahBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:23:30.518521Z"},"content_sha256":"b6f88d9efc459267009e80ac54857f4a45c6720370e642c5999c953497c349ea","schema_version":"1.0","event_id":"sha256:b6f88d9efc459267009e80ac54857f4a45c6720370e642c5999c953497c349ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBZJGBGVEG6OJOQ5DKIGDAJYMJ/bundle.json","state_url":"https://pith.science/pith/LBZJGBGVEG6OJOQ5DKIGDAJYMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBZJGBGVEG6OJOQ5DKIGDAJYMJ/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-08T01:23:30Z","links":{"resolver":"https://pith.science/pith/LBZJGBGVEG6OJOQ5DKIGDAJYMJ","bundle":"https://pith.science/pith/LBZJGBGVEG6OJOQ5DKIGDAJYMJ/bundle.json","state":"https://pith.science/pith/LBZJGBGVEG6OJOQ5DKIGDAJYMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBZJGBGVEG6OJOQ5DKIGDAJYMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:LBZJGBGVEG6OJOQ5DKIGDAJYMJ","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":"91d99af65b3546b4a73db7aa90c4b8bd91a48ef3b5cee9ab603da350b65d804c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-29T10:00:37Z","title_canon_sha256":"164bce1e246d2d25bf05a5f3507109371683f0b20ba669d458d07a78bab894aa"},"schema_version":"1.0","source":{"id":"0910.5599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5599","created_at":"2026-05-18T02:11:01Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5599v1","created_at":"2026-05-18T02:11:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5599","created_at":"2026-05-18T02:11:01Z"},{"alias_kind":"pith_short_12","alias_value":"LBZJGBGVEG6O","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LBZJGBGVEG6OJOQ5","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LBZJGBGV","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:b6f88d9efc459267009e80ac54857f4a45c6720370e642c5999c953497c349ea","target":"graph","created_at":"2026-05-18T02:11:01Z","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":"We consider a variant of bin packing called multiple-choice vector bin packing. In this problem we are given a set of items, where each item can be selected in one of several $D$-dimensional incarnations. We are also given $T$ bin types, each with its own cost and $D$-dimensional size. Our goal is to pack the items in a set of bins of minimum overall cost. The problem is motivated by scheduling in networks with guaranteed quality of service (QoS), but due to its general formulation it has many other applications as well. We present an approximation algorithm that is guaranteed to produce a sol","authors_text":"Boaz Patt-Shamir, Dror Rawitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-29T10:00:37Z","title":"Vector Bin Packing with Multiple-Choice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5599","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:fb0f4bcef359cf02de25d8de5809394acc7e1693db4d5062c5fbb627124a4b61","target":"record","created_at":"2026-05-18T02:11:01Z","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":"91d99af65b3546b4a73db7aa90c4b8bd91a48ef3b5cee9ab603da350b65d804c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-29T10:00:37Z","title_canon_sha256":"164bce1e246d2d25bf05a5f3507109371683f0b20ba669d458d07a78bab894aa"},"schema_version":"1.0","source":{"id":"0910.5599","kind":"arxiv","version":1}},"canonical_sha256":"58729304d521bce4ba1d1a90618138624626cf6d59ccb5b05715af3378fe5d67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58729304d521bce4ba1d1a90618138624626cf6d59ccb5b05715af3378fe5d67","first_computed_at":"2026-05-18T02:11:01.793795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:11:01.793795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"exIWRsQbqHGujEGKBqn+QEWO+l06XtQOxd934y3yrXvGuMLSL0Lte8oslSo7uQWiNmW+eXjHYm1gh4DMH1jGBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:11:01.794460Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.5599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb0f4bcef359cf02de25d8de5809394acc7e1693db4d5062c5fbb627124a4b61","sha256:b6f88d9efc459267009e80ac54857f4a45c6720370e642c5999c953497c349ea"],"state_sha256":"fb6b5bfcdc047daeb32efbcf2f44504b74c7dbda98bdfc977a12a5e5c53e86a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uf7h1bhir6arjUIYymHGHAzTCFGg5WDq5eGFmaoFsenOfYzpy5vvGgOMmzm8H5KAHab60cByRurbilvEBmjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:23:30.522634Z","bundle_sha256":"1f7d5917276cf1a6306e21db06a264acae0c19f253af0fdcc830c1111a74f827"}}