{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:J26E4CI4X2XHUWESGATFNUGKRM","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":"105e17123f6243563d373a980f3534027c9d95badbdfbe19e04f8ad11edb4446","cross_cats_sorted":["cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-12T14:23:41Z","title_canon_sha256":"47c59a7b7cc5a51544753cec59bcdc9357b2346a49664a966e89e0f0428959f8"},"schema_version":"1.0","source":{"id":"2009.05800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.05800","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"2009.05800v1","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05800","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"J26E4CI4X2XH","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"pith_short_16","alias_value":"J26E4CI4X2XHUWES","created_at":"2026-07-05T01:35:01Z"},{"alias_kind":"pith_short_8","alias_value":"J26E4CI4","created_at":"2026-07-05T01:35:01Z"}],"graph_snapshots":[{"event_id":"sha256:a760fff8f08633fd8478a01c0f8cb7897230959c7a705634f551130d543800cb","target":"graph","created_at":"2026-07-05T01:35:01Z","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/2009.05800/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study an iterative beam search algorithm for the permutation flowshop (makespan and flowtime minimization). This algorithm combines branching strategies inspired by recent branch-and-bounds and a guidance strategy inspired by the LR heuristic. It obtains competitive results, reports many new-best-so-far solutions on the VFR benchmark (makespan minimization) and the Taillard benchmark (flowtime minimization) without using any NEH-based branching or iterative-greedy strategy. The source code is available at: https://gitlab.com/librallu/cats-pfsp.","authors_text":"Aur\\'elien Secardin, Luc Libralesso, Pablo Andres Focke, Vincent Jost","cross_cats":["cs.NE","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-12T14:23:41Z","title":"Iterative beam search algorithms for the permutation flowshop"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05800","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:5668676161280f86c98a2c391d12be0cb264dac28107a0054f6062821ae272aa","target":"record","created_at":"2026-07-05T01:35:01Z","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":"105e17123f6243563d373a980f3534027c9d95badbdfbe19e04f8ad11edb4446","cross_cats_sorted":["cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-12T14:23:41Z","title_canon_sha256":"47c59a7b7cc5a51544753cec59bcdc9357b2346a49664a966e89e0f0428959f8"},"schema_version":"1.0","source":{"id":"2009.05800","kind":"arxiv","version":1}},"canonical_sha256":"4ebc4e091cbeae7a5892302656d0ca8b2e11f9185ad14bcdedc7a08c04871ac1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ebc4e091cbeae7a5892302656d0ca8b2e11f9185ad14bcdedc7a08c04871ac1","first_computed_at":"2026-07-05T01:35:01.456347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:35:01.456347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CIcvSVsA60ZJYAPAApc2GVAYGua7MmzmJnARsXYZxaqvoSN/tJ+uKRr2JGLEvYPxeP9cjdbS2Ji2SU5GMJyBCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:35:01.456824Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.05800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5668676161280f86c98a2c391d12be0cb264dac28107a0054f6062821ae272aa","sha256:a760fff8f08633fd8478a01c0f8cb7897230959c7a705634f551130d543800cb"],"state_sha256":"1a691e24005ce403e9396226153975ebe5810a803ff22f8b4ae0a2706c6a4efc"}