{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YH3FGYQMT2N4QZJI2GGUKJXMYY","short_pith_number":"pith:YH3FGYQM","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"},"canonical_sha256":"c1f653620c9e9bc86528d18d4526ecc60ff4ca2032bb9e8d2f9a2b243212b39c","source":{"kind":"arxiv","id":"2608.06255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06255","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06255v1","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06255","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"YH3FGYQMT2N4","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"pith_short_16","alias_value":"YH3FGYQMT2N4QZJI","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"pith_short_8","alias_value":"YH3FGYQM","created_at":"2026-08-07T01:41:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YH3FGYQMT2N4QZJI2GGUKJXMYY","target":"record","payload":{"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"},"canonical_sha256":"c1f653620c9e9bc86528d18d4526ecc60ff4ca2032bb9e8d2f9a2b243212b39c","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"},"source_kind":"arxiv","source_id":"2608.06255","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-07T01:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3vRIDRJS6SKHZ/ekLsMzVvm7vBpZjwlWK16+udG7I55l+9YmSoFKf7GWtAjGLq1DSapX/q/MDqfZeB0n8rwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T15:24:10.357258Z"},"content_sha256":"67d0ca3434b329b5b6fedb53c4fb15d1233f9716c6934aead07200830e5b6236","schema_version":"1.0","event_id":"sha256:67d0ca3434b329b5b6fedb53c4fb15d1233f9716c6934aead07200830e5b6236"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YH3FGYQMT2N4QZJI2GGUKJXMYY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-07T01:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNKFN/hsjGk22DOOivmzhOmYHB+4kyGrGwgZp5nIlSM4K2HHMiQFG80Sn4VGO/xCRXQSEJ5z44/RKnQAllOyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T15:24:10.357771Z"},"content_sha256":"605d7ecfeb89a9647de616c283e3a5ae79306c1e3ec02edf89cd3b1d8f6ccdab","schema_version":"1.0","event_id":"sha256:605d7ecfeb89a9647de616c283e3a5ae79306c1e3ec02edf89cd3b1d8f6ccdab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/bundle.json","state_url":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T15:24:10Z","links":{"resolver":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY","bundle":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/bundle.json","state":"https://pith.science/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YH3FGYQMT2N4QZJI2GGUKJXMYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YH3FGYQMT2N4QZJI2GGUKJXMYY","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":"a28cb7783d0c0fc756f6bfc5a3524b86094921166f48a1895576fd46c710d6ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-06T16:44:37Z","title_canon_sha256":"1297133904770e8c4cc62fcbc5b384d36ffa41e5b3fdb976eec4c0949ee35157"},"schema_version":"1.0","source":{"id":"2608.06255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06255","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06255v1","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06255","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"YH3FGYQMT2N4","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"pith_short_16","alias_value":"YH3FGYQMT2N4QZJI","created_at":"2026-08-07T01:41:04Z"},{"alias_kind":"pith_short_8","alias_value":"YH3FGYQM","created_at":"2026-08-07T01:41:04Z"}],"graph_snapshots":[{"event_id":"sha256:605d7ecfeb89a9647de616c283e3a5ae79306c1e3ec02edf89cd3b1d8f6ccdab","target":"graph","created_at":"2026-08-07T01:41:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.06255/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jack Snoeyink, Randal Tuggle","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06255","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:67d0ca3434b329b5b6fedb53c4fb15d1233f9716c6934aead07200830e5b6236","target":"record","created_at":"2026-08-07T01:41:04Z","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":"a28cb7783d0c0fc756f6bfc5a3524b86094921166f48a1895576fd46c710d6ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-06T16:44:37Z","title_canon_sha256":"1297133904770e8c4cc62fcbc5b384d36ffa41e5b3fdb976eec4c0949ee35157"},"schema_version":"1.0","source":{"id":"2608.06255","kind":"arxiv","version":1}},"canonical_sha256":"c1f653620c9e9bc86528d18d4526ecc60ff4ca2032bb9e8d2f9a2b243212b39c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1f653620c9e9bc86528d18d4526ecc60ff4ca2032bb9e8d2f9a2b243212b39c","first_computed_at":"2026-08-07T01:41:04.042053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-07T01:41:04.042053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UVRYnd5qKJ6j3eZbSLtrVgWmkE06h0AHhpPw7suywaBALv/8cVnaENsxHiZ9llaaMO2S6rabdeG/T2nSRgKjDQ==","signature_status":"signed_v1","signed_at":"2026-08-07T01:41:04.043876Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.06255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67d0ca3434b329b5b6fedb53c4fb15d1233f9716c6934aead07200830e5b6236","sha256:605d7ecfeb89a9647de616c283e3a5ae79306c1e3ec02edf89cd3b1d8f6ccdab"],"state_sha256":"4f3af3ee533f713956c00b737de519ad64a898c4fa5a54b21c7c7565da832680"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0xhmz5yXjjQ4atC26kNhp4B3PI27rQxXAc0UcociToxXmhDMHqMja1E2EoZ+XvK8goR/KFi4/+ijeEBx4EmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T15:24:10.363824Z","bundle_sha256":"c811802a6674576c53b73e0abd2f70f51ef83688e4b75b2d9335cf3512172cdc"}}