{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YVWMGXHK5G7IFEDMY2BJVCK7JD","short_pith_number":"pith:YVWMGXHK","canonical_record":{"source":{"id":"1404.3330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-04-12T23:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"26404c0aefe6d9bc8d61c8bd8ef0b693c22ae4b9383ff1acdca0420c01c776a4","abstract_canon_sha256":"8ea69cd0b3d13f7d91c99c75747ee28b5a50043bacde3eef54b72c176dde1dfb"},"schema_version":"1.0"},"canonical_sha256":"c56cc35ceae9be82906cc6829a895f48d37cf33160a08827fe15095697865c05","source":{"kind":"arxiv","id":"1404.3330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3330","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3330v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3330","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"YVWMGXHK5G7I","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YVWMGXHK5G7IFEDM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YVWMGXHK","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YVWMGXHK5G7IFEDMY2BJVCK7JD","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-04-12T23:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"26404c0aefe6d9bc8d61c8bd8ef0b693c22ae4b9383ff1acdca0420c01c776a4","abstract_canon_sha256":"8ea69cd0b3d13f7d91c99c75747ee28b5a50043bacde3eef54b72c176dde1dfb"},"schema_version":"1.0"},"canonical_sha256":"c56cc35ceae9be82906cc6829a895f48d37cf33160a08827fe15095697865c05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:15.376203Z","signature_b64":"ORnfLz+eEDXTlOxC+cRzvExdAGQZAkuTrMV+qvoWoQpF3opyEaGuLN5JvK6zkiYh9rG9eHsjHJhMy35de+e3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c56cc35ceae9be82906cc6829a895f48d37cf33160a08827fe15095697865c05","last_reissued_at":"2026-05-18T02:54:15.375746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:15.375746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3330","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:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7VJwbKN4Klnr8Y1MsEy0xTpKdTSvRr9TZexXI10V6ZxuO6vXRRYZW68SztheYCGpCpKQNTorW0Gi21nN5oODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:42:38.793868Z"},"content_sha256":"3264212b06632c6408287e857cd1b4fcca56262d781fc675d210f9f89b5fd701","schema_version":"1.0","event_id":"sha256:3264212b06632c6408287e857cd1b4fcca56262d781fc675d210f9f89b5fd701"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YVWMGXHK5G7IFEDMY2BJVCK7JD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A DC programming approach for constrained two-dimensional non-guillotine cutting problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Hoai An Le Thi, Mahdi Moeini","submitted_at":"2014-04-12T23:58:20Z","abstract_excerpt":"We investigate a new application of Difference of Convex functions programming and DCA in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reformulate this problem as a DC program and solve it by DCA. The performance of the approach is compared with the standard solver CPLEX."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3330","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:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yf7+mwPq0PZJnk7WF3Is9xPT5Vs91UFMs3V3zJX657wLAY3dmIA8G6JTnkb81DSvktoeReRNdQmc+EkR3cpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:42:38.794206Z"},"content_sha256":"ce9080f3a04fcdb7b51980d1b30dd74d5d5134c1715dd50e30b887ea9f0ee1e6","schema_version":"1.0","event_id":"sha256:ce9080f3a04fcdb7b51980d1b30dd74d5d5134c1715dd50e30b887ea9f0ee1e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVWMGXHK5G7IFEDMY2BJVCK7JD/bundle.json","state_url":"https://pith.science/pith/YVWMGXHK5G7IFEDMY2BJVCK7JD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVWMGXHK5G7IFEDMY2BJVCK7JD/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-29T08:42:38Z","links":{"resolver":"https://pith.science/pith/YVWMGXHK5G7IFEDMY2BJVCK7JD","bundle":"https://pith.science/pith/YVWMGXHK5G7IFEDMY2BJVCK7JD/bundle.json","state":"https://pith.science/pith/YVWMGXHK5G7IFEDMY2BJVCK7JD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVWMGXHK5G7IFEDMY2BJVCK7JD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YVWMGXHK5G7IFEDMY2BJVCK7JD","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":"8ea69cd0b3d13f7d91c99c75747ee28b5a50043bacde3eef54b72c176dde1dfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-04-12T23:58:20Z","title_canon_sha256":"26404c0aefe6d9bc8d61c8bd8ef0b693c22ae4b9383ff1acdca0420c01c776a4"},"schema_version":"1.0","source":{"id":"1404.3330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3330","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3330v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3330","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"YVWMGXHK5G7I","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YVWMGXHK5G7IFEDM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YVWMGXHK","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:ce9080f3a04fcdb7b51980d1b30dd74d5d5134c1715dd50e30b887ea9f0ee1e6","target":"graph","created_at":"2026-05-18T02:54:15Z","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 investigate a new application of Difference of Convex functions programming and DCA in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reformulate this problem as a DC program and solve it by DCA. The performance of the approach is compared with the standard solver CPLEX.","authors_text":"Hoai An Le Thi, Mahdi Moeini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-04-12T23:58:20Z","title":"A DC programming approach for constrained two-dimensional non-guillotine cutting problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3330","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:3264212b06632c6408287e857cd1b4fcca56262d781fc675d210f9f89b5fd701","target":"record","created_at":"2026-05-18T02:54:15Z","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":"8ea69cd0b3d13f7d91c99c75747ee28b5a50043bacde3eef54b72c176dde1dfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2014-04-12T23:58:20Z","title_canon_sha256":"26404c0aefe6d9bc8d61c8bd8ef0b693c22ae4b9383ff1acdca0420c01c776a4"},"schema_version":"1.0","source":{"id":"1404.3330","kind":"arxiv","version":1}},"canonical_sha256":"c56cc35ceae9be82906cc6829a895f48d37cf33160a08827fe15095697865c05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c56cc35ceae9be82906cc6829a895f48d37cf33160a08827fe15095697865c05","first_computed_at":"2026-05-18T02:54:15.375746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:15.375746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ORnfLz+eEDXTlOxC+cRzvExdAGQZAkuTrMV+qvoWoQpF3opyEaGuLN5JvK6zkiYh9rG9eHsjHJhMy35de+e3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:15.376203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3264212b06632c6408287e857cd1b4fcca56262d781fc675d210f9f89b5fd701","sha256:ce9080f3a04fcdb7b51980d1b30dd74d5d5134c1715dd50e30b887ea9f0ee1e6"],"state_sha256":"f664adbd27a1d006a41b93a012c596a0b6ed5e84abc21d33e2f98ae13477b1c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fk+57aALJ5A2j9P31Uy71T8R8AeQF089OIWLdckWp5o9pXrLTN1xj1sj7edBKixIWswi1Wcd65eCWAFK7sYyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:42:38.796003Z","bundle_sha256":"be92246a4e39a11cc4d997c95ceb08880605a658aa451e3e9fd5c7471065767e"}}