{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:T7NCWWQ6BH36FQBELR6R5DX72W","short_pith_number":"pith:T7NCWWQ6","canonical_record":{"source":{"id":"1701.03136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-11T19:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"323e16c38ceec3a8fa5ec2b8478b59c948efdb9d72ac94072bf4f9ac1873905e","abstract_canon_sha256":"7bb3c09652ede6ad127061b5aa3e07375457a945b2b792a0dd77ec64bd7697b0"},"schema_version":"1.0"},"canonical_sha256":"9fda2b5a1e09f7e2c0245c7d1e8effd58b4044977ce595cdf8801c57ff3f4cc0","source":{"kind":"arxiv","id":"1701.03136","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03136","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03136v2","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03136","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"T7NCWWQ6BH36","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T7NCWWQ6BH36FQBE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T7NCWWQ6","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:T7NCWWQ6BH36FQBELR6R5DX72W","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-11T19:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"323e16c38ceec3a8fa5ec2b8478b59c948efdb9d72ac94072bf4f9ac1873905e","abstract_canon_sha256":"7bb3c09652ede6ad127061b5aa3e07375457a945b2b792a0dd77ec64bd7697b0"},"schema_version":"1.0"},"canonical_sha256":"9fda2b5a1e09f7e2c0245c7d1e8effd58b4044977ce595cdf8801c57ff3f4cc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:22.221463Z","signature_b64":"B4nRnZyinc6mGqu0Qy7fE0UD1PT/HETVKv4CTH6E4r+PnTMhmd8lB9kzXYbzF4vzmphOM/pwBjw8Ax3sXIuxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fda2b5a1e09f7e2c0245c7d1e8effd58b4044977ce595cdf8801c57ff3f4cc0","last_reissued_at":"2026-05-18T00:52:22.220827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:22.220827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03136","source_version":2,"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-05-18T00:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xCChCN8Ojf3oMTsF5hTtaMS9kJjEqirTDiI2Con1E1Z7d6gXJqv8WArfLHIo9XdSzndBxnnANQZIkxuekw/lBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:51:36.577980Z"},"content_sha256":"3b0a029cb5c7171b6459bdf3937cd40d5202c6171d690cd76ac9c406f660dc7f","schema_version":"1.0","event_id":"sha256:3b0a029cb5c7171b6459bdf3937cd40d5202c6171d690cd76ac9c406f660dc7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:T7NCWWQ6BH36FQBELR6R5DX72W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A practical efficient and effective method for the Hamiltonian cycle problem that runs on a standard computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Lewin Altschuler, Timothy J. Williams","submitted_at":"2017-01-11T19:38:20Z","abstract_excerpt":"Given $N$ cities and $R < N^2 - N$ directed (unidirectional/one way) roads does there exist a tour of all $N$ cities stopping at each city exactly once using the given roads (a Hamiltonian cycle)? This Hamiltonian cycle problem (HCP) is an NP-complete problem, for which there is no known polynomial time solution algorithm. The HCP has important practical applications, for example, to logistical problems. It was claimed that an adiabatic quantum computer could solve an NP-complete problem faster than classical algorithms, but claim appears to have been debunked. Here we demonstrate an algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03136","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mc7xHL1R4h0PMd6wKmz+5cpfn3qxvYAfQ41HRt8FPZp84Z8eIPNeYKWUrPfUgLmISBlFB7WB9donJMXxmpTDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:51:36.578397Z"},"content_sha256":"a9481a37a2958d11063eca2afbc7c7133cebcd7974795e8652bb4af1455b6ec6","schema_version":"1.0","event_id":"sha256:a9481a37a2958d11063eca2afbc7c7133cebcd7974795e8652bb4af1455b6ec6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7NCWWQ6BH36FQBELR6R5DX72W/bundle.json","state_url":"https://pith.science/pith/T7NCWWQ6BH36FQBELR6R5DX72W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7NCWWQ6BH36FQBELR6R5DX72W/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-05-21T23:51:36Z","links":{"resolver":"https://pith.science/pith/T7NCWWQ6BH36FQBELR6R5DX72W","bundle":"https://pith.science/pith/T7NCWWQ6BH36FQBELR6R5DX72W/bundle.json","state":"https://pith.science/pith/T7NCWWQ6BH36FQBELR6R5DX72W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7NCWWQ6BH36FQBELR6R5DX72W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T7NCWWQ6BH36FQBELR6R5DX72W","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":"7bb3c09652ede6ad127061b5aa3e07375457a945b2b792a0dd77ec64bd7697b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-11T19:38:20Z","title_canon_sha256":"323e16c38ceec3a8fa5ec2b8478b59c948efdb9d72ac94072bf4f9ac1873905e"},"schema_version":"1.0","source":{"id":"1701.03136","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03136","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03136v2","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03136","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"T7NCWWQ6BH36","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T7NCWWQ6BH36FQBE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T7NCWWQ6","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:a9481a37a2958d11063eca2afbc7c7133cebcd7974795e8652bb4af1455b6ec6","target":"graph","created_at":"2026-05-18T00:52:22Z","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":"Given $N$ cities and $R < N^2 - N$ directed (unidirectional/one way) roads does there exist a tour of all $N$ cities stopping at each city exactly once using the given roads (a Hamiltonian cycle)? This Hamiltonian cycle problem (HCP) is an NP-complete problem, for which there is no known polynomial time solution algorithm. The HCP has important practical applications, for example, to logistical problems. It was claimed that an adiabatic quantum computer could solve an NP-complete problem faster than classical algorithms, but claim appears to have been debunked. Here we demonstrate an algorithm","authors_text":"Eric Lewin Altschuler, Timothy J. Williams","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-11T19:38:20Z","title":"A practical efficient and effective method for the Hamiltonian cycle problem that runs on a standard computer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03136","kind":"arxiv","version":2},"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:3b0a029cb5c7171b6459bdf3937cd40d5202c6171d690cd76ac9c406f660dc7f","target":"record","created_at":"2026-05-18T00:52:22Z","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":"7bb3c09652ede6ad127061b5aa3e07375457a945b2b792a0dd77ec64bd7697b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-11T19:38:20Z","title_canon_sha256":"323e16c38ceec3a8fa5ec2b8478b59c948efdb9d72ac94072bf4f9ac1873905e"},"schema_version":"1.0","source":{"id":"1701.03136","kind":"arxiv","version":2}},"canonical_sha256":"9fda2b5a1e09f7e2c0245c7d1e8effd58b4044977ce595cdf8801c57ff3f4cc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fda2b5a1e09f7e2c0245c7d1e8effd58b4044977ce595cdf8801c57ff3f4cc0","first_computed_at":"2026-05-18T00:52:22.220827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:22.220827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B4nRnZyinc6mGqu0Qy7fE0UD1PT/HETVKv4CTH6E4r+PnTMhmd8lB9kzXYbzF4vzmphOM/pwBjw8Ax3sXIuxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:22.221463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03136","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b0a029cb5c7171b6459bdf3937cd40d5202c6171d690cd76ac9c406f660dc7f","sha256:a9481a37a2958d11063eca2afbc7c7133cebcd7974795e8652bb4af1455b6ec6"],"state_sha256":"8a3215e2ad280fbccdd75a792e1eb022befdb451ea14e1661e7a54a6c2bb1d7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rF0xQBSERM0SuWSSh0qsZE79B/HYIBhlxb2BijSWEqbyTTZrReMOEOBB9H6In0RTXzPOh2+bSdEMSUbyikpkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:51:36.581011Z","bundle_sha256":"2f0df51216f89408aeacb9783ac611aa366e16f4b245a0974f3cb009e97a61dd"}}