{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UVCQU6VKG2QV7GEDTL6X2VAFRJ","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":"c8e4a34324bfaaf3bd23c486a8d34cfc3e56b7ab241ca81da71ac8411eff456c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-31T09:12:42Z","title_canon_sha256":"2a402eaf8f23dbe9facaba1bcf06566209a8eb288b3172d73f1b2e81ffb9b026"},"schema_version":"1.0","source":{"id":"1309.0081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0081","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0081v1","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0081","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"UVCQU6VKG2QV","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UVCQU6VKG2QV7GED","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UVCQU6VK","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:c2e39ec4bcf51d8129f7e5725c3cd9dd7baa1db6baa2415e42a4c762169e25f2","target":"graph","created_at":"2026-05-18T03:14:28Z","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"},"paper":{"abstract_excerpt":"This paper studies a combinatorial optimization problem which is obtained by combining the flow shop scheduling problem and the shortest path problem. The objective of the obtained problem is to select a subset of jobs that constitutes a feasible solution to the shortest path problem, and to execute the selected jobs on the flow shop machines to minimize the makespan. We argue that this problem is NP-hard even if the number of machines is two, and is NP-hard in the strong sense for the general case. We propose an intuitive approximation algorithm for the case where the number of machines is an","authors_text":"Fabrice Talla Nobibon, Kameng Nip, Roel Leus, Zhenbo Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-31T09:12:42Z","title":"A Combination of Flow Shop Scheduling and the Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0081","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:e4573f521dd3cc73238f2674d953db11686c4d0fee607c846d3a46a737596807","target":"record","created_at":"2026-05-18T03:14:28Z","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":"c8e4a34324bfaaf3bd23c486a8d34cfc3e56b7ab241ca81da71ac8411eff456c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-31T09:12:42Z","title_canon_sha256":"2a402eaf8f23dbe9facaba1bcf06566209a8eb288b3172d73f1b2e81ffb9b026"},"schema_version":"1.0","source":{"id":"1309.0081","kind":"arxiv","version":1}},"canonical_sha256":"a5450a7aaa36a15f98839afd7d54058a50d8b297ddd04f116ead9f26d0d6387a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5450a7aaa36a15f98839afd7d54058a50d8b297ddd04f116ead9f26d0d6387a","first_computed_at":"2026-05-18T03:14:28.914255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:28.914255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NTzilLfGfzK4HHXWbQ9E65fDCZMVFwwfQ6JrXkc9rwOeoe/GCyuiMJIVaEqLRg6QkCTP53rhGeNgCQQFP8+dAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:28.914725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4573f521dd3cc73238f2674d953db11686c4d0fee607c846d3a46a737596807","sha256:c2e39ec4bcf51d8129f7e5725c3cd9dd7baa1db6baa2415e42a4c762169e25f2"],"state_sha256":"7eb75aa453841e315bae8b241b1a41311db2dbebfd623470718354d6aa980d98"}