{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XFKPNMXFLXLJSK2II3MOILRRYY","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":"6c683d39a81e485e0f73dae91f988563a0beb6c79149abebeeb3a8923062cfe2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-04-02T13:41:07Z","title_canon_sha256":"85040e7aafc0e9c392c78d1fe3b3bc7b136201618adac815a3c82faf4c554b71"},"schema_version":"1.0","source":{"id":"2004.02603","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.02603","created_at":"2026-07-05T00:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"2004.02603v2","created_at":"2026-07-05T00:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02603","created_at":"2026-07-05T00:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"XFKPNMXFLXLJ","created_at":"2026-07-05T00:56:04Z"},{"alias_kind":"pith_short_16","alias_value":"XFKPNMXFLXLJSK2I","created_at":"2026-07-05T00:56:04Z"},{"alias_kind":"pith_short_8","alias_value":"XFKPNMXF","created_at":"2026-07-05T00:56:04Z"}],"graph_snapshots":[{"event_id":"sha256:7a4fb26629ab566fa7e9cf17d054fca6daebbd74e84ff446139bb5b8f83d1f14","target":"graph","created_at":"2026-07-05T00:56:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.02603/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"[libralesso_anytime_2020] proposed an anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (https://www.roadef.org/challenge/2018/en/index.php). The resulting program was ranked first among 64 participants. In this article, we generalize it and show that it is not only effective for the specific problem it was originally designed for, but is also very competitive and even returns state-of-the-art solutions on a large variety of Cutting and Packing problems from the literature. We adapted the algorithm for two-dimensional Bin Packing, Multiple Knapsack, and Str","authors_text":"Florian Fontan, Luc Libralesso","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-04-02T13:41:07Z","title":"An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02603","kind":"arxiv","version":2},"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:3de20c9c325aa9eeae58cf76d9a81f1565cda3ee1a7464f019858aa64c9d66be","target":"record","created_at":"2026-07-05T00:56:04Z","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":"6c683d39a81e485e0f73dae91f988563a0beb6c79149abebeeb3a8923062cfe2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-04-02T13:41:07Z","title_canon_sha256":"85040e7aafc0e9c392c78d1fe3b3bc7b136201618adac815a3c82faf4c554b71"},"schema_version":"1.0","source":{"id":"2004.02603","kind":"arxiv","version":2}},"canonical_sha256":"b954f6b2e55dd6992b4846d8e42e31c61a245f16b4e0494aa18beeb3158cc5d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b954f6b2e55dd6992b4846d8e42e31c61a245f16b4e0494aa18beeb3158cc5d5","first_computed_at":"2026-07-05T00:56:04.418102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:56:04.418102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LVa2hJmzaWjLTyYSSDneZeSGSwx5OGUwxnIzVDX2T6c0Qdnf+VodMwQ14dxJltDKHeYrMXbKqsBGLO6F46eEAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:56:04.418622Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.02603","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3de20c9c325aa9eeae58cf76d9a81f1565cda3ee1a7464f019858aa64c9d66be","sha256:7a4fb26629ab566fa7e9cf17d054fca6daebbd74e84ff446139bb5b8f83d1f14"],"state_sha256":"50536ad713ab8b1209997c99dfd9f1a96c26dc995cd0663bd949bfc094dc1ec4"}