{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YH3FGYQMT2N4QZJI2GGUKJXMYY","short_pith_number":"pith:YH3FGYQM","schema_version":"1.0","canonical_sha256":"c1f653620c9e9bc86528d18d4526ecc60ff4ca2032bb9e8d2f9a2b243212b39c","source":{"kind":"arxiv","id":"2608.06255","version":1},"attestation_state":"computed","paper":{"title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jack Snoeyink, Randal Tuggle","submitted_at":"2026-08-06T16:44:37Z","abstract_excerpt":"We seek to disentangle the hardness of finding a Hamiltonian path or cycle from the hardness of finding a non-crossing path or cycle by giving a direct reduction from 3-SAT to the non-crossing Hamiltonian path and cycle problems on non-planar graphs. Prior hardness proofs proceed by reduction to planar graphs, where every path is automatically non-crossing; this conflates the two sources of difficulty and leaves unclear why forbidding crossings on the path alone makes the problem hard. Our reduction places the difficulty squarely in the non-crossing constraint, avoids planar gadget constructio"},"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":"2608.06255","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-06T16:44:37Z","cross_cats_sorted":[],"title_canon_sha256":"1297133904770e8c4cc62fcbc5b384d36ffa41e5b3fdb976eec4c0949ee35157","abstract_canon_sha256":"a28cb7783d0c0fc756f6bfc5a3524b86094921166f48a1895576fd46c710d6ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T01:41:04.043876Z","signature_b64":"UVRYnd5qKJ6j3eZbSLtrVgWmkE06h0AHhpPw7suywaBALv/8cVnaENsxHiZ9llaaMO2S6rabdeG/T2nSRgKjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1f653620c9e9bc86528d18d4526ecc60ff4ca2032bb9e8d2f9a2b243212b39c","last_reissued_at":"2026-08-07T01:41:04.042053Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T01:41:04.042053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jack Snoeyink, Randal Tuggle","submitted_at":"2026-08-06T16:44:37Z","abstract_excerpt":"We seek to disentangle the hardness of finding a Hamiltonian path or cycle from the hardness of finding a non-crossing path or cycle by giving a direct reduction from 3-SAT to the non-crossing Hamiltonian path and cycle problems on non-planar graphs. Prior hardness proofs proceed by reduction to planar graphs, where every path is automatically non-crossing; this conflates the two sources of difficulty and leaves unclear why forbidding crossings on the path alone makes the problem hard. Our reduction places the difficulty squarely in the non-crossing constraint, avoids planar gadget constructio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06255","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/2608.06255/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":"2608.06255","created_at":"2026-08-07T01:41:04.044892+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.06255v1","created_at":"2026-08-07T01:41:04.044892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06255","created_at":"2026-08-07T01:41:04.044892+00:00"},{"alias_kind":"pith_short_12","alias_value":"YH3FGYQMT2N4","created_at":"2026-08-07T01:41:04.044892+00:00"},{"alias_kind":"pith_short_16","alias_value":"YH3FGYQMT2N4QZJI","created_at":"2026-08-07T01:41:04.044892+00:00"},{"alias_kind":"pith_short_8","alias_value":"YH3FGYQM","created_at":"2026-08-07T01:41:04.044892+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/YH3FGYQMT2N4QZJI2GGUKJXMYY","json":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY.json","graph_json":"https://pith.science/api/pith-number/YH3FGYQMT2N4QZJI2GGUKJXMYY/graph.json","events_json":"https://pith.science/api/pith-number/YH3FGYQMT2N4QZJI2GGUKJXMYY/events.json","paper":"https://pith.science/paper/YH3FGYQM"},"agent_actions":{"view_html":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY","download_json":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY.json","view_paper":"https://pith.science/paper/YH3FGYQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.06255&json=true","fetch_graph":"https://pith.science/api/pith-number/YH3FGYQMT2N4QZJI2GGUKJXMYY/graph.json","fetch_events":"https://pith.science/api/pith-number/YH3FGYQMT2N4QZJI2GGUKJXMYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/action/storage_attestation","attest_author":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/action/author_attestation","sign_citation":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/action/citation_signature","submit_replication":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/action/replication_record"}},"created_at":"2026-08-07T01:41:04.044892+00:00","updated_at":"2026-08-07T01:41:04.044892+00:00"}