{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:J26E4CI4X2XHUWESGATFNUGKRM","short_pith_number":"pith:J26E4CI4","schema_version":"1.0","canonical_sha256":"4ebc4e091cbeae7a5892302656d0ca8b2e11f9185ad14bcdedc7a08c04871ac1","source":{"kind":"arxiv","id":"2009.05800","version":1},"attestation_state":"computed","paper":{"title":"Iterative beam search algorithms for the permutation flowshop","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.OC"],"primary_cat":"cs.AI","authors_text":"Aur\\'elien Secardin, Luc Libralesso, Pablo Andres Focke, Vincent Jost","submitted_at":"2020-09-12T14:23:41Z","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."},"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":"2009.05800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-12T14:23:41Z","cross_cats_sorted":["cs.NE","math.OC"],"title_canon_sha256":"47c59a7b7cc5a51544753cec59bcdc9357b2346a49664a966e89e0f0428959f8","abstract_canon_sha256":"105e17123f6243563d373a980f3534027c9d95badbdfbe19e04f8ad11edb4446"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:35:01.456824Z","signature_b64":"CIcvSVsA60ZJYAPAApc2GVAYGua7MmzmJnARsXYZxaqvoSN/tJ+uKRr2JGLEvYPxeP9cjdbS2Ji2SU5GMJyBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ebc4e091cbeae7a5892302656d0ca8b2e11f9185ad14bcdedc7a08c04871ac1","last_reissued_at":"2026-07-05T01:35:01.456347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:35:01.456347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative beam search algorithms for the permutation flowshop","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.OC"],"primary_cat":"cs.AI","authors_text":"Aur\\'elien Secardin, Luc Libralesso, Pablo Andres Focke, Vincent Jost","submitted_at":"2020-09-12T14:23:41Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05800","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.05800/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2009.05800","created_at":"2026-07-05T01:35:01.456408+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.05800v1","created_at":"2026-07-05T01:35:01.456408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05800","created_at":"2026-07-05T01:35:01.456408+00:00"},{"alias_kind":"pith_short_12","alias_value":"J26E4CI4X2XH","created_at":"2026-07-05T01:35:01.456408+00:00"},{"alias_kind":"pith_short_16","alias_value":"J26E4CI4X2XHUWES","created_at":"2026-07-05T01:35:01.456408+00:00"},{"alias_kind":"pith_short_8","alias_value":"J26E4CI4","created_at":"2026-07-05T01:35:01.456408+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/J26E4CI4X2XHUWESGATFNUGKRM","json":"https://pith.science/pith/J26E4CI4X2XHUWESGATFNUGKRM.json","graph_json":"https://pith.science/api/pith-number/J26E4CI4X2XHUWESGATFNUGKRM/graph.json","events_json":"https://pith.science/api/pith-number/J26E4CI4X2XHUWESGATFNUGKRM/events.json","paper":"https://pith.science/paper/J26E4CI4"},"agent_actions":{"view_html":"https://pith.science/pith/J26E4CI4X2XHUWESGATFNUGKRM","download_json":"https://pith.science/pith/J26E4CI4X2XHUWESGATFNUGKRM.json","view_paper":"https://pith.science/paper/J26E4CI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.05800&json=true","fetch_graph":"https://pith.science/api/pith-number/J26E4CI4X2XHUWESGATFNUGKRM/graph.json","fetch_events":"https://pith.science/api/pith-number/J26E4CI4X2XHUWESGATFNUGKRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J26E4CI4X2XHUWESGATFNUGKRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J26E4CI4X2XHUWESGATFNUGKRM/action/storage_attestation","attest_author":"https://pith.science/pith/J26E4CI4X2XHUWESGATFNUGKRM/action/author_attestation","sign_citation":"https://pith.science/pith/J26E4CI4X2XHUWESGATFNUGKRM/action/citation_signature","submit_replication":"https://pith.science/pith/J26E4CI4X2XHUWESGATFNUGKRM/action/replication_record"}},"created_at":"2026-07-05T01:35:01.456408+00:00","updated_at":"2026-07-05T01:35:01.456408+00:00"}