{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BCPOUIQ5FBIOLCOOV6ANUIURXQ","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":"dcd928320233c860d336b1fae6474400f5da78f67d5dba53131488619d7c7ddf","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-27T16:36:50Z","title_canon_sha256":"d0df27485e5529b96ef7aba71b6c113aec7389ac07806bd609706761cb03c10c"},"schema_version":"1.0","source":{"id":"1712.09619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09619","created_at":"2026-05-18T00:27:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09619v1","created_at":"2026-05-18T00:27:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09619","created_at":"2026-05-18T00:27:07Z"},{"alias_kind":"pith_short_12","alias_value":"BCPOUIQ5FBIO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BCPOUIQ5FBIOLCOO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BCPOUIQ5","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:a295e422f23efe87d27d3e69bcfab4bc072fb03e9b351f0e13d1b282f007bd36","target":"graph","created_at":"2026-05-18T00:27:07Z","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":"Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, like robot motion planning, generating polygon etc. We will present a reduction from planar Hamiltonian path to this problem, and prove that it is NP-Complete. To the best of our knowledge, no study has considered its complexity up until now. We also present a reduction from planar Hamiltonian path problem to the problem of finding a path on given points in the presence of arbitrary obstacles and prove that it is NP-C","authors_text":"Abdolah Sepahvand, Mohammadreza Razzazi","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-27T16:36:50Z","title":"Finding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09619","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:1c41cc9dcc7a336c1eb204f13787a0e588d734ea347fdd7ad796a1608ceea346","target":"record","created_at":"2026-05-18T00:27:07Z","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":"dcd928320233c860d336b1fae6474400f5da78f67d5dba53131488619d7c7ddf","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-27T16:36:50Z","title_canon_sha256":"d0df27485e5529b96ef7aba71b6c113aec7389ac07806bd609706761cb03c10c"},"schema_version":"1.0","source":{"id":"1712.09619","kind":"arxiv","version":1}},"canonical_sha256":"089eea221d2850e589ceaf80da2291bc2019639db684f3cdd9feeffa1511ab26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"089eea221d2850e589ceaf80da2291bc2019639db684f3cdd9feeffa1511ab26","first_computed_at":"2026-05-18T00:27:07.801966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:07.801966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oH6IKpwYgcRDPpwnPedQOMjb9gG+REaf++XKauOI1gjvozbv3KNIQbJOYnwslc+cnVaUjn/ekqMSckOb/xOxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:07.802409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c41cc9dcc7a336c1eb204f13787a0e588d734ea347fdd7ad796a1608ceea346","sha256:a295e422f23efe87d27d3e69bcfab4bc072fb03e9b351f0e13d1b282f007bd36"],"state_sha256":"011aa0b3f4a471b6b66017909f49b7efe7ccd22b719f43e63647adaa631d617b"}