{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3ZT725GTL23CARLGW7HYNONQAD","short_pith_number":"pith:3ZT725GT","canonical_record":{"source":{"id":"1312.3836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-13T15:14:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1ebcd7e1565f9c91de2901047b763edc5e02d49d76ac805536bd06358299cc28","abstract_canon_sha256":"ad6a8c45bc81269796d0989196be4873ae76889c37481bcb3f55c96ad7faf01f"},"schema_version":"1.0"},"canonical_sha256":"de67fd74d35eb6204566b7cf86b9b000d6453c2a913e0f10347b5ea8cdf76fef","source":{"kind":"arxiv","id":"1312.3836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3836","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3836v1","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3836","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"3ZT725GTL23C","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ZT725GTL23CARLG","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ZT725GT","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3ZT725GTL23CARLGW7HYNONQAD","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-13T15:14:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1ebcd7e1565f9c91de2901047b763edc5e02d49d76ac805536bd06358299cc28","abstract_canon_sha256":"ad6a8c45bc81269796d0989196be4873ae76889c37481bcb3f55c96ad7faf01f"},"schema_version":"1.0"},"canonical_sha256":"de67fd74d35eb6204566b7cf86b9b000d6453c2a913e0f10347b5ea8cdf76fef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:47.439478Z","signature_b64":"wFg+j/hLztpHVyYkb5lrvEwiJieM01xJZtteDNyMCeFsNjLqzEEdVcJtw2GSzAhqLydTJjkiR5IhGVVWyIFUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de67fd74d35eb6204566b7cf86b9b000d6453c2a913e0f10347b5ea8cdf76fef","last_reissued_at":"2026-05-18T03:04:47.438687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:47.438687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3836","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-18T03:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gSCK8BAIQosmYllb/9/poUeJSnejT/nuD73G3cMJvmfZVEWAV2bgsH/hyAhVzNXZWaZ4TQLovDKukyggwpyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:20:41.375048Z"},"content_sha256":"77bfb6d8308ae89e13b056b20fecb89f902eaf65996345c4b72a3197f6886d0c","schema_version":"1.0","event_id":"sha256:77bfb6d8308ae89e13b056b20fecb89f902eaf65996345c4b72a3197f6886d0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3ZT725GTL23CARLGW7HYNONQAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Filipe Brand\\~ao, Jo\\~ao Pedro Pedroso","submitted_at":"2013-12-13T15:14:44Z","abstract_excerpt":"The vector bin packing problem (VBP) is a generalization of bin packing with multiple constraints. In this problem we are required to pack items, represented by p-dimensional vectors, into as few bins as possible. The multiple-choice vector bin packing (MVBP) is a variant of the VBP in which bins have several types and items have several incarnations. We present an exact method, based on an arc-flow formulation with graph compression, for solving MVBP by simply representing all the patterns in a very compact graph. As a proof of concept we report computational results on a variable-sized bin p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3836","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-18T03:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLbARuu0rcmgfX5rAR3blOgsLh0VTkT2N374wCdwhrnWMtOIZO0y7qvSlBVkR7cf+NfjRoSOzD2sUD0ILhPfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:20:41.375702Z"},"content_sha256":"515dc8036e99669847b230ed0c8d0048e960619c3fdb2a095338412864bc77bf","schema_version":"1.0","event_id":"sha256:515dc8036e99669847b230ed0c8d0048e960619c3fdb2a095338412864bc77bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZT725GTL23CARLGW7HYNONQAD/bundle.json","state_url":"https://pith.science/pith/3ZT725GTL23CARLGW7HYNONQAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZT725GTL23CARLGW7HYNONQAD/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-05T00:20:41Z","links":{"resolver":"https://pith.science/pith/3ZT725GTL23CARLGW7HYNONQAD","bundle":"https://pith.science/pith/3ZT725GTL23CARLGW7HYNONQAD/bundle.json","state":"https://pith.science/pith/3ZT725GTL23CARLGW7HYNONQAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZT725GTL23CARLGW7HYNONQAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3ZT725GTL23CARLGW7HYNONQAD","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":"ad6a8c45bc81269796d0989196be4873ae76889c37481bcb3f55c96ad7faf01f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-13T15:14:44Z","title_canon_sha256":"1ebcd7e1565f9c91de2901047b763edc5e02d49d76ac805536bd06358299cc28"},"schema_version":"1.0","source":{"id":"1312.3836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3836","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3836v1","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3836","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"3ZT725GTL23C","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ZT725GTL23CARLG","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ZT725GT","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:515dc8036e99669847b230ed0c8d0048e960619c3fdb2a095338412864bc77bf","target":"graph","created_at":"2026-05-18T03:04:47Z","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":"The vector bin packing problem (VBP) is a generalization of bin packing with multiple constraints. In this problem we are required to pack items, represented by p-dimensional vectors, into as few bins as possible. The multiple-choice vector bin packing (MVBP) is a variant of the VBP in which bins have several types and items have several incarnations. We present an exact method, based on an arc-flow formulation with graph compression, for solving MVBP by simply representing all the patterns in a very compact graph. As a proof of concept we report computational results on a variable-sized bin p","authors_text":"Filipe Brand\\~ao, Jo\\~ao Pedro Pedroso","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-13T15:14:44Z","title":"Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3836","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:77bfb6d8308ae89e13b056b20fecb89f902eaf65996345c4b72a3197f6886d0c","target":"record","created_at":"2026-05-18T03:04:47Z","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":"ad6a8c45bc81269796d0989196be4873ae76889c37481bcb3f55c96ad7faf01f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-13T15:14:44Z","title_canon_sha256":"1ebcd7e1565f9c91de2901047b763edc5e02d49d76ac805536bd06358299cc28"},"schema_version":"1.0","source":{"id":"1312.3836","kind":"arxiv","version":1}},"canonical_sha256":"de67fd74d35eb6204566b7cf86b9b000d6453c2a913e0f10347b5ea8cdf76fef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de67fd74d35eb6204566b7cf86b9b000d6453c2a913e0f10347b5ea8cdf76fef","first_computed_at":"2026-05-18T03:04:47.438687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:47.438687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wFg+j/hLztpHVyYkb5lrvEwiJieM01xJZtteDNyMCeFsNjLqzEEdVcJtw2GSzAhqLydTJjkiR5IhGVVWyIFUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:47.439478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77bfb6d8308ae89e13b056b20fecb89f902eaf65996345c4b72a3197f6886d0c","sha256:515dc8036e99669847b230ed0c8d0048e960619c3fdb2a095338412864bc77bf"],"state_sha256":"44bd0406817c3b880fb8006bf3064f41e58adb6766a62acc915d7555018c099c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzVRqNDSuhAAQmRBRPcFQVDKbxR/1d+ynMHlLZKoaPiuxFSXEu0jVBO0nfAghuPsgUDkT0YGxWIvV/vyDkczAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:20:41.379042Z","bundle_sha256":"d9152b784d33ae626afc1e8bc93c3e64125f2cbb5cf48c1abe8f8aee01600243"}}