{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6LLIVZ3XH6DP4LOPYVIWHSKJR5","short_pith_number":"pith:6LLIVZ3X","schema_version":"1.0","canonical_sha256":"f2d68ae7773f86fe2dcfc55163c9498f73b7da863a8ac2f11659a29a09cc60e5","source":{"kind":"arxiv","id":"2602.22110","version":3},"attestation_state":"computed","paper":{"title":"Robust Permutation Flowshops Under Budgeted Uncertainty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Dvir Shabtay, Noam Goldberg","submitted_at":"2026-02-25T16:57:43Z","abstract_excerpt":"We consider the robust permutation flowshop problem under the budgeted uncertainty model, where at most a given number of job processing times may deviate on each machine. We show that solutions for this problem can be determined by solving polynomially many instances of the corresponding nominal problem. As a direct consequence, our result implies that this robust flowshop problem can be solved in polynomial time for two machines, and can be approximated in polynomial time for any fixed number of machines. The reduction that is our main result follows from an analysis similar to Bertsimas and"},"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":"2602.22110","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-25T16:57:43Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"0b83595efd6227dbb91d851fc20e203bffbc2fbc4a0623cfe6ee6c21aa7636a7","abstract_canon_sha256":"293ca9420dee3debbf10f526e45fb02ca9691b9728205b9d086e60e1709c299e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:26.376598Z","signature_b64":"FUUn7MfygUpbpW+Z7WPTTuYByZDO04ET1OciT/k2UxmHxZB8HxFZCIEuRL5lAbxrSMvobDB97SzbeTbiifoAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2d68ae7773f86fe2dcfc55163c9498f73b7da863a8ac2f11659a29a09cc60e5","last_reissued_at":"2026-05-26T01:03:26.375826Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:26.375826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Permutation Flowshops Under Budgeted Uncertainty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Dvir Shabtay, Noam Goldberg","submitted_at":"2026-02-25T16:57:43Z","abstract_excerpt":"We consider the robust permutation flowshop problem under the budgeted uncertainty model, where at most a given number of job processing times may deviate on each machine. We show that solutions for this problem can be determined by solving polynomially many instances of the corresponding nominal problem. As a direct consequence, our result implies that this robust flowshop problem can be solved in polynomial time for two machines, and can be approximated in polynomial time for any fixed number of machines. The reduction that is our main result follows from an analysis similar to Bertsimas and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.22110","kind":"arxiv","version":3},"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/2602.22110/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":"2602.22110","created_at":"2026-05-26T01:03:26.375935+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.22110v3","created_at":"2026-05-26T01:03:26.375935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.22110","created_at":"2026-05-26T01:03:26.375935+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LLIVZ3XH6DP","created_at":"2026-05-26T01:03:26.375935+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LLIVZ3XH6DP4LOP","created_at":"2026-05-26T01:03:26.375935+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LLIVZ3X","created_at":"2026-05-26T01:03:26.375935+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/6LLIVZ3XH6DP4LOPYVIWHSKJR5","json":"https://pith.science/pith/6LLIVZ3XH6DP4LOPYVIWHSKJR5.json","graph_json":"https://pith.science/api/pith-number/6LLIVZ3XH6DP4LOPYVIWHSKJR5/graph.json","events_json":"https://pith.science/api/pith-number/6LLIVZ3XH6DP4LOPYVIWHSKJR5/events.json","paper":"https://pith.science/paper/6LLIVZ3X"},"agent_actions":{"view_html":"https://pith.science/pith/6LLIVZ3XH6DP4LOPYVIWHSKJR5","download_json":"https://pith.science/pith/6LLIVZ3XH6DP4LOPYVIWHSKJR5.json","view_paper":"https://pith.science/paper/6LLIVZ3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.22110&json=true","fetch_graph":"https://pith.science/api/pith-number/6LLIVZ3XH6DP4LOPYVIWHSKJR5/graph.json","fetch_events":"https://pith.science/api/pith-number/6LLIVZ3XH6DP4LOPYVIWHSKJR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LLIVZ3XH6DP4LOPYVIWHSKJR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LLIVZ3XH6DP4LOPYVIWHSKJR5/action/storage_attestation","attest_author":"https://pith.science/pith/6LLIVZ3XH6DP4LOPYVIWHSKJR5/action/author_attestation","sign_citation":"https://pith.science/pith/6LLIVZ3XH6DP4LOPYVIWHSKJR5/action/citation_signature","submit_replication":"https://pith.science/pith/6LLIVZ3XH6DP4LOPYVIWHSKJR5/action/replication_record"}},"created_at":"2026-05-26T01:03:26.375935+00:00","updated_at":"2026-05-26T01:03:26.375935+00:00"}