{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XFKPNMXFLXLJSK2II3MOILRRYY","short_pith_number":"pith:XFKPNMXF","canonical_record":{"source":{"id":"2004.02603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-04-02T13:41:07Z","cross_cats_sorted":[],"title_canon_sha256":"85040e7aafc0e9c392c78d1fe3b3bc7b136201618adac815a3c82faf4c554b71","abstract_canon_sha256":"6c683d39a81e485e0f73dae91f988563a0beb6c79149abebeeb3a8923062cfe2"},"schema_version":"1.0"},"canonical_sha256":"b954f6b2e55dd6992b4846d8e42e31c61a245f16b4e0494aa18beeb3158cc5d5","source":{"kind":"arxiv","id":"2004.02603","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XFKPNMXFLXLJSK2II3MOILRRYY","target":"record","payload":{"canonical_record":{"source":{"id":"2004.02603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-04-02T13:41:07Z","cross_cats_sorted":[],"title_canon_sha256":"85040e7aafc0e9c392c78d1fe3b3bc7b136201618adac815a3c82faf4c554b71","abstract_canon_sha256":"6c683d39a81e485e0f73dae91f988563a0beb6c79149abebeeb3a8923062cfe2"},"schema_version":"1.0"},"canonical_sha256":"b954f6b2e55dd6992b4846d8e42e31c61a245f16b4e0494aa18beeb3158cc5d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:04.418622Z","signature_b64":"LVa2hJmzaWjLTyYSSDneZeSGSwx5OGUwxnIzVDX2T6c0Qdnf+VodMwQ14dxJltDKHeYrMXbKqsBGLO6F46eEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b954f6b2e55dd6992b4846d8e42e31c61a245f16b4e0494aa18beeb3158cc5d5","last_reissued_at":"2026-07-05T00:56:04.418102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:04.418102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.02603","source_version":2,"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-07-05T00:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQJCz5sAfRMqO4QLbva8U8iBsKed2/g0djAMgEQ4pELJZ7Gzuzdn/v+97UMh5q/7bO4uhP3eBeNh7Xq108LYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:57:02.116805Z"},"content_sha256":"3de20c9c325aa9eeae58cf76d9a81f1565cda3ee1a7464f019858aa64c9d66be","schema_version":"1.0","event_id":"sha256:3de20c9c325aa9eeae58cf76d9a81f1565cda3ee1a7464f019858aa64c9d66be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XFKPNMXFLXLJSK2II3MOILRRYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Florian Fontan, Luc Libralesso","submitted_at":"2020-04-02T13:41:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02603","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.02603/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVqUf5U28rcfK9EanC8qFtaO828Mj+7zqLZMHdBhoHw77CyeoPjWwbctyX5L8vmGQpoQrZJ48TrGDHjOAZF6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:57:02.117578Z"},"content_sha256":"7a4fb26629ab566fa7e9cf17d054fca6daebbd74e84ff446139bb5b8f83d1f14","schema_version":"1.0","event_id":"sha256:7a4fb26629ab566fa7e9cf17d054fca6daebbd74e84ff446139bb5b8f83d1f14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFKPNMXFLXLJSK2II3MOILRRYY/bundle.json","state_url":"https://pith.science/pith/XFKPNMXFLXLJSK2II3MOILRRYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFKPNMXFLXLJSK2II3MOILRRYY/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-07-07T05:57:02Z","links":{"resolver":"https://pith.science/pith/XFKPNMXFLXLJSK2II3MOILRRYY","bundle":"https://pith.science/pith/XFKPNMXFLXLJSK2II3MOILRRYY/bundle.json","state":"https://pith.science/pith/XFKPNMXFLXLJSK2II3MOILRRYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFKPNMXFLXLJSK2II3MOILRRYY/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnLF8Zb3yYCh1ZgOp2+PVmnXI2mIbftj0QV5d//ZpzJaqd/YbPIoeOvIH1NyML03FytyyaVTjlGG6ZkX5m1vBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:57:02.121199Z","bundle_sha256":"5896d154cd4578bef5464dccc8abb9df91d58df11f37f111bcf74f84aeb9414e"}}