{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JPQ7DTDGEWIX4WDT56BUAUQKB7","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":"ad15f7628a2b6a272d0f8b64fc7a079b2282586147d6e754f512251e63ddcae1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-07T20:12:47Z","title_canon_sha256":"702ec56bdff9a4a8f293a0fb088a0d21d8394102482f381555ea0d4b004f587c"},"schema_version":"1.0","source":{"id":"1803.02862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02862","created_at":"2026-05-18T00:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02862v1","created_at":"2026-05-18T00:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02862","created_at":"2026-05-18T00:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"JPQ7DTDGEWIX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JPQ7DTDGEWIX4WDT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JPQ7DTDG","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:55cf1595bc13e2a14ed0426dbdf81ce18a142f4feeb914936834d4863f8d1d35","target":"graph","created_at":"2026-05-18T00:21:45Z","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":"Path cover is a well-known intractable problem that finds a minimum number of vertex disjoint paths in a given graph to cover all the vertices. We show that a variant, where the objective function is not the number of paths but the number of length-$0$ paths (that is, isolated vertices), turns out to be polynomial-time solvable. We further show that another variant, where the objective function is the total number of length-$0$ and length-$1$ paths, is also polynomial-time solvable. Both variants find applications in approximating the two-machine flow-shop scheduling problem in which job proce","authors_text":"An Zhang, Guangting Chen, Guohui Lin, Longcheng Liu, Randy Goebel, Yinhui Cai, Yong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-07T20:12:47Z","title":"Approximation algorithms for two-machine flow-shop scheduling with a conflict graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02862","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:1fed49ac17c8e3268739022e3826e1b0c8c1c5e6fc66957a4a1fc566ee267d69","target":"record","created_at":"2026-05-18T00:21:45Z","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":"ad15f7628a2b6a272d0f8b64fc7a079b2282586147d6e754f512251e63ddcae1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-07T20:12:47Z","title_canon_sha256":"702ec56bdff9a4a8f293a0fb088a0d21d8394102482f381555ea0d4b004f587c"},"schema_version":"1.0","source":{"id":"1803.02862","kind":"arxiv","version":1}},"canonical_sha256":"4be1f1cc6625917e5873ef8340520a0fd2c1fbd91c9bc1df87c83340cb5ef89b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4be1f1cc6625917e5873ef8340520a0fd2c1fbd91c9bc1df87c83340cb5ef89b","first_computed_at":"2026-05-18T00:21:45.261431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:45.261431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KoP7aJnQG6RUVvFxSsymHS+E48IrYOo84tnDbGyj0AMOp0IPti4ryRCJfY/FN5TSUmuSiAQNRdHT45GmKYXRDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:45.262056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fed49ac17c8e3268739022e3826e1b0c8c1c5e6fc66957a4a1fc566ee267d69","sha256:55cf1595bc13e2a14ed0426dbdf81ce18a142f4feeb914936834d4863f8d1d35"],"state_sha256":"3102f29f96575df4ee6e50d37036151bbee4eb9e2632a71882a8084a04e540dc"}