{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LELZCKAIME3CCSWF2ZMANRW4C6","short_pith_number":"pith:LELZCKAI","canonical_record":{"source":{"id":"1801.07859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-24T04:56:37Z","cross_cats_sorted":[],"title_canon_sha256":"f14d4964f884fdc30a200ecac077a21bf00beea98c6f8b8ce899c8eedef90a56","abstract_canon_sha256":"3fe86f36ff6e3a23f7a09fb17c2e037d0183f79a3e4b56909e2f4a95b0f1bf38"},"schema_version":"1.0"},"canonical_sha256":"59179128086136214ac5d65806c6dc1784642b613823fd90feaa22018b4ccbee","source":{"kind":"arxiv","id":"1801.07859","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07859","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07859v2","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07859","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"LELZCKAIME3C","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LELZCKAIME3CCSWF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LELZCKAI","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LELZCKAIME3CCSWF2ZMANRW4C6","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-24T04:56:37Z","cross_cats_sorted":[],"title_canon_sha256":"f14d4964f884fdc30a200ecac077a21bf00beea98c6f8b8ce899c8eedef90a56","abstract_canon_sha256":"3fe86f36ff6e3a23f7a09fb17c2e037d0183f79a3e4b56909e2f4a95b0f1bf38"},"schema_version":"1.0"},"canonical_sha256":"59179128086136214ac5d65806c6dc1784642b613823fd90feaa22018b4ccbee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:29.308307Z","signature_b64":"E+S2fveOBkWsW7qvB2cXf3MjR9a9c8TgDkaxUuM4d7D+BXQb/o4D6GSdj8tGzv9bci0zoaEfx6y+xYjclFR1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59179128086136214ac5d65806c6dc1784642b613823fd90feaa22018b4ccbee","last_reissued_at":"2026-05-17T23:52:29.307681Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:29.307681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07859","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-17T23:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gdwGsZkgC2P2k+4nTFSpwpYQz7gYWTw9TIDBp+pu8a9NQcJH1e84rcgYOiQ+roSC0tkV7mWFE5qmtRT8bv1iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:17:11.538666Z"},"content_sha256":"8f7308d9ab76804f76585a8d53fbf62d5c1914a20eb57feb2995e3c45ff2c706","schema_version":"1.0","event_id":"sha256:8f7308d9ab76804f76585a8d53fbf62d5c1914a20eb57feb2995e3c45ff2c706"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LELZCKAIME3CCSWF2ZMANRW4C6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Travelling Salesman Problem and Adiabatic Quantum Computation: An Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Tien D. Kieu","submitted_at":"2018-01-24T04:56:37Z","abstract_excerpt":"An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the target Hamiltonian has the shortest tour as the desirable ground state. Some estimates/bounds are also given for the computational complexity of the algorithm with particular emphasis on the required energy resources, besides the space and time complexity, for the physical process of (quantum) computation in general."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07859","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-17T23:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5axAtk8r6XrM9X2ef2Q53f2wPhGm/8hCY2Sr9FkvzxKWYC8BVhXYImVO9thJu3J8YCGAcMqtbMcNKVjLYyq9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:17:11.539015Z"},"content_sha256":"e178bf2abd8da368a3c2ace888077727544ee5ce66bd55ca947943830a964a4f","schema_version":"1.0","event_id":"sha256:e178bf2abd8da368a3c2ace888077727544ee5ce66bd55ca947943830a964a4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LELZCKAIME3CCSWF2ZMANRW4C6/bundle.json","state_url":"https://pith.science/pith/LELZCKAIME3CCSWF2ZMANRW4C6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LELZCKAIME3CCSWF2ZMANRW4C6/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-07-02T23:17:11Z","links":{"resolver":"https://pith.science/pith/LELZCKAIME3CCSWF2ZMANRW4C6","bundle":"https://pith.science/pith/LELZCKAIME3CCSWF2ZMANRW4C6/bundle.json","state":"https://pith.science/pith/LELZCKAIME3CCSWF2ZMANRW4C6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LELZCKAIME3CCSWF2ZMANRW4C6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LELZCKAIME3CCSWF2ZMANRW4C6","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":"3fe86f36ff6e3a23f7a09fb17c2e037d0183f79a3e4b56909e2f4a95b0f1bf38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-24T04:56:37Z","title_canon_sha256":"f14d4964f884fdc30a200ecac077a21bf00beea98c6f8b8ce899c8eedef90a56"},"schema_version":"1.0","source":{"id":"1801.07859","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07859","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07859v2","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07859","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"LELZCKAIME3C","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LELZCKAIME3CCSWF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LELZCKAI","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:e178bf2abd8da368a3c2ace888077727544ee5ce66bd55ca947943830a964a4f","target":"graph","created_at":"2026-05-17T23:52:29Z","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":"An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the target Hamiltonian has the shortest tour as the desirable ground state. Some estimates/bounds are also given for the computational complexity of the algorithm with particular emphasis on the required energy resources, besides the space and time complexity, for the physical process of (quantum) computation in general.","authors_text":"Tien D. Kieu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-24T04:56:37Z","title":"The Travelling Salesman Problem and Adiabatic Quantum Computation: An Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07859","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:8f7308d9ab76804f76585a8d53fbf62d5c1914a20eb57feb2995e3c45ff2c706","target":"record","created_at":"2026-05-17T23:52:29Z","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":"3fe86f36ff6e3a23f7a09fb17c2e037d0183f79a3e4b56909e2f4a95b0f1bf38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-24T04:56:37Z","title_canon_sha256":"f14d4964f884fdc30a200ecac077a21bf00beea98c6f8b8ce899c8eedef90a56"},"schema_version":"1.0","source":{"id":"1801.07859","kind":"arxiv","version":2}},"canonical_sha256":"59179128086136214ac5d65806c6dc1784642b613823fd90feaa22018b4ccbee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59179128086136214ac5d65806c6dc1784642b613823fd90feaa22018b4ccbee","first_computed_at":"2026-05-17T23:52:29.307681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:29.307681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E+S2fveOBkWsW7qvB2cXf3MjR9a9c8TgDkaxUuM4d7D+BXQb/o4D6GSdj8tGzv9bci0zoaEfx6y+xYjclFR1Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:29.308307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07859","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f7308d9ab76804f76585a8d53fbf62d5c1914a20eb57feb2995e3c45ff2c706","sha256:e178bf2abd8da368a3c2ace888077727544ee5ce66bd55ca947943830a964a4f"],"state_sha256":"b4d3f3fe7550bef2ec830cd56edf006dcdf62cf06deb1f814ea21258e7c42d62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRkjZ/dHOL0mxl7pZZ6pmzx31QclfQeWgxPb9iIKJo9flQQlgNuhbYec3vt87Xyl8T10CPngjKNzoAZXcEflAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:17:11.541024Z","bundle_sha256":"7abeeb4228083ba9188820e9aae3b65c530d66c31deb915402b65a2b69739f1c"}}