{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BYY4OZQ7NHAHBAFSBZGOT6HZ2S","short_pith_number":"pith:BYY4OZQ7","schema_version":"1.0","canonical_sha256":"0e31c7661f69c07080b20e4ce9f8f9d4ad3b687ca419c0d642064d2b8449cc89","source":{"kind":"arxiv","id":"1502.02899","version":1},"attestation_state":"computed","paper":{"title":"Cutting Stock with Binary Patterns: 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":"2015-02-10T13:30:23Z","abstract_excerpt":"The cutting stock problem with binary patterns (0-1 CSP) is a variant of CSP that usually appears as a relaxation of 2D and 3D packing problems. We present an exact method, based on an arc-flow formulation with side constraints, for solving 0-1 CSP by simply representing all the patterns in a very compact graph.\n  Gilmore-Gomory's column generation approach is usually used to compute strong lower bounds for 0-1 CSP. We report a computational comparison between the arc-flow approach and the Gilmore-Gomory's approach."},"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":"1502.02899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-10T13:30:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ba7b0fc1a115202adb6907d619b888ac5cffeca7c6434f0dd60ba7adc24b8053","abstract_canon_sha256":"9be2d2cc2fc561cfd144086b065065c1dfb3cc59e21f32beb81ce3401324bf42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:30.459426Z","signature_b64":"ciIhaYB/o7AQmpi4gy/sxH959pIBKi1CLvhGQmUsFXADWgUoMDgFyGSivE8fmUIiQ5m+RlGy9saLTPukiW76BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e31c7661f69c07080b20e4ce9f8f9d4ad3b687ca419c0d642064d2b8449cc89","last_reissued_at":"2026-05-18T02:27:30.458587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:30.458587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutting Stock with Binary Patterns: 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":"2015-02-10T13:30:23Z","abstract_excerpt":"The cutting stock problem with binary patterns (0-1 CSP) is a variant of CSP that usually appears as a relaxation of 2D and 3D packing problems. We present an exact method, based on an arc-flow formulation with side constraints, for solving 0-1 CSP by simply representing all the patterns in a very compact graph.\n  Gilmore-Gomory's column generation approach is usually used to compute strong lower bounds for 0-1 CSP. We report a computational comparison between the arc-flow approach and the Gilmore-Gomory's approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02899","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":"1502.02899","created_at":"2026-05-18T02:27:30.458711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02899v1","created_at":"2026-05-18T02:27:30.458711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02899","created_at":"2026-05-18T02:27:30.458711+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYY4OZQ7NHAH","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYY4OZQ7NHAHBAFS","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYY4OZQ7","created_at":"2026-05-18T12:29:14.074870+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/BYY4OZQ7NHAHBAFSBZGOT6HZ2S","json":"https://pith.science/pith/BYY4OZQ7NHAHBAFSBZGOT6HZ2S.json","graph_json":"https://pith.science/api/pith-number/BYY4OZQ7NHAHBAFSBZGOT6HZ2S/graph.json","events_json":"https://pith.science/api/pith-number/BYY4OZQ7NHAHBAFSBZGOT6HZ2S/events.json","paper":"https://pith.science/paper/BYY4OZQ7"},"agent_actions":{"view_html":"https://pith.science/pith/BYY4OZQ7NHAHBAFSBZGOT6HZ2S","download_json":"https://pith.science/pith/BYY4OZQ7NHAHBAFSBZGOT6HZ2S.json","view_paper":"https://pith.science/paper/BYY4OZQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02899&json=true","fetch_graph":"https://pith.science/api/pith-number/BYY4OZQ7NHAHBAFSBZGOT6HZ2S/graph.json","fetch_events":"https://pith.science/api/pith-number/BYY4OZQ7NHAHBAFSBZGOT6HZ2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYY4OZQ7NHAHBAFSBZGOT6HZ2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYY4OZQ7NHAHBAFSBZGOT6HZ2S/action/storage_attestation","attest_author":"https://pith.science/pith/BYY4OZQ7NHAHBAFSBZGOT6HZ2S/action/author_attestation","sign_citation":"https://pith.science/pith/BYY4OZQ7NHAHBAFSBZGOT6HZ2S/action/citation_signature","submit_replication":"https://pith.science/pith/BYY4OZQ7NHAHBAFSBZGOT6HZ2S/action/replication_record"}},"created_at":"2026-05-18T02:27:30.458711+00:00","updated_at":"2026-05-18T02:27:30.458711+00:00"}