{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ELKFNYAZI7YBEUJCIUH5Y6FSAZ","short_pith_number":"pith:ELKFNYAZ","canonical_record":{"source":{"id":"1310.6887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T11:55:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9821380e17ab3bc5c2685525352b26836205599c94bfaec31bdb13460cebcad1","abstract_canon_sha256":"319bbb97c07ca765209c1b7bf3b7e7857880ccb7da63aeee3646e7a491534f11"},"schema_version":"1.0"},"canonical_sha256":"22d456e01947f0125122450fdc78b2067b5b3fb45e1f18d57e4c434efc1d30d1","source":{"kind":"arxiv","id":"1310.6887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6887","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6887v1","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6887","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"ELKFNYAZI7YB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ELKFNYAZI7YBEUJC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ELKFNYAZ","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ELKFNYAZI7YBEUJCIUH5Y6FSAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T11:55:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9821380e17ab3bc5c2685525352b26836205599c94bfaec31bdb13460cebcad1","abstract_canon_sha256":"319bbb97c07ca765209c1b7bf3b7e7857880ccb7da63aeee3646e7a491534f11"},"schema_version":"1.0"},"canonical_sha256":"22d456e01947f0125122450fdc78b2067b5b3fb45e1f18d57e4c434efc1d30d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:26.374336Z","signature_b64":"6J2fBzutwAZ5wvLos49EV+JNrVmyKTTlGvEUvHHVfq7x7e+WkECsATzZGabk6Gx0xS71fMV+116YCtVkJAZzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22d456e01947f0125122450fdc78b2067b5b3fb45e1f18d57e4c434efc1d30d1","last_reissued_at":"2026-05-18T02:57:26.373685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:26.373685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6887","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:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ou7aJrwE1pqYQw+pM82tvz4bEjOgDJekNtjMWSNTEACYX3jRYSmBbYnrl9FRnGxndn2Df9Se9mkMn67RoIdLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:42:39.340130Z"},"content_sha256":"f82c39f113ec1fd063bf6d443f9724a99ae33197e0b24273bcdb53069491c06c","schema_version":"1.0","event_id":"sha256:f82c39f113ec1fd063bf6d443f9724a99ae33197e0b24273bcdb53069491c06c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ELKFNYAZI7YBEUJCIUH5Y6FSAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bin Packing and Related Problems: General 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-10-25T11:55:30Z","abstract_excerpt":"We present an exact method, based on an arc-flow formulation with side constraints, for solving bin packing and cutting stock problems --- including multi-constraint variants --- by simply representing all the patterns in a very compact graph. Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model. As opposed to our method, which provides strong models, conventional models are usually highly symmetric and provide very weak lower bounds.\n  Our formulation is equivalent to Gilmore and Gomory's, thus provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6887","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:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EcNEQVre4LYhaNuvoiKeOBP/6ZEHxGFjckAU6+FnUfVfWEwVdTywhBx933q518VIfyQEWBbWprOK6stp2JL1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:42:39.340493Z"},"content_sha256":"f3c5cd32b91dfbf1ca1237b502ebdc7372b3fe658a5ee126e8fdeec4b165e9ec","schema_version":"1.0","event_id":"sha256:f3c5cd32b91dfbf1ca1237b502ebdc7372b3fe658a5ee126e8fdeec4b165e9ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELKFNYAZI7YBEUJCIUH5Y6FSAZ/bundle.json","state_url":"https://pith.science/pith/ELKFNYAZI7YBEUJCIUH5Y6FSAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELKFNYAZI7YBEUJCIUH5Y6FSAZ/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-05T11:42:39Z","links":{"resolver":"https://pith.science/pith/ELKFNYAZI7YBEUJCIUH5Y6FSAZ","bundle":"https://pith.science/pith/ELKFNYAZI7YBEUJCIUH5Y6FSAZ/bundle.json","state":"https://pith.science/pith/ELKFNYAZI7YBEUJCIUH5Y6FSAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELKFNYAZI7YBEUJCIUH5Y6FSAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ELKFNYAZI7YBEUJCIUH5Y6FSAZ","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":"319bbb97c07ca765209c1b7bf3b7e7857880ccb7da63aeee3646e7a491534f11","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T11:55:30Z","title_canon_sha256":"9821380e17ab3bc5c2685525352b26836205599c94bfaec31bdb13460cebcad1"},"schema_version":"1.0","source":{"id":"1310.6887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6887","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6887v1","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6887","created_at":"2026-05-18T02:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"ELKFNYAZI7YB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ELKFNYAZI7YBEUJC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ELKFNYAZ","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:f3c5cd32b91dfbf1ca1237b502ebdc7372b3fe658a5ee126e8fdeec4b165e9ec","target":"graph","created_at":"2026-05-18T02:57:26Z","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 present an exact method, based on an arc-flow formulation with side constraints, for solving bin packing and cutting stock problems --- including multi-constraint variants --- by simply representing all the patterns in a very compact graph. Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model. As opposed to our method, which provides strong models, conventional models are usually highly symmetric and provide very weak lower bounds.\n  Our formulation is equivalent to Gilmore and Gomory's, thus provid","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-10-25T11:55:30Z","title":"Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6887","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:f82c39f113ec1fd063bf6d443f9724a99ae33197e0b24273bcdb53069491c06c","target":"record","created_at":"2026-05-18T02:57:26Z","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":"319bbb97c07ca765209c1b7bf3b7e7857880ccb7da63aeee3646e7a491534f11","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T11:55:30Z","title_canon_sha256":"9821380e17ab3bc5c2685525352b26836205599c94bfaec31bdb13460cebcad1"},"schema_version":"1.0","source":{"id":"1310.6887","kind":"arxiv","version":1}},"canonical_sha256":"22d456e01947f0125122450fdc78b2067b5b3fb45e1f18d57e4c434efc1d30d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22d456e01947f0125122450fdc78b2067b5b3fb45e1f18d57e4c434efc1d30d1","first_computed_at":"2026-05-18T02:57:26.373685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:26.373685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6J2fBzutwAZ5wvLos49EV+JNrVmyKTTlGvEUvHHVfq7x7e+WkECsATzZGabk6Gx0xS71fMV+116YCtVkJAZzCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:26.374336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f82c39f113ec1fd063bf6d443f9724a99ae33197e0b24273bcdb53069491c06c","sha256:f3c5cd32b91dfbf1ca1237b502ebdc7372b3fe658a5ee126e8fdeec4b165e9ec"],"state_sha256":"d90d3b58a0dcae01646ada477fe97a4ab85c9388ef5a9019fc97ac1caf8d695d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tGKQFXf37G/tIP2BSorAm+CTDNrJhJI91wVJkrraSf+rjkU/RWVdGCxIAYIHUj26XVQTi5mZNQKujKd+yRPUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:42:39.342418Z","bundle_sha256":"c9743b1687572b465c836a2d40fd310bcdffefa8b9088a494f486aa5cfe7bdc9"}}