{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:W4G7EI3GBDCCSA4KRMLOCXLFYS","short_pith_number":"pith:W4G7EI3G","canonical_record":{"source":{"id":"1004.4124","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-23T13:07:35Z","cross_cats_sorted":[],"title_canon_sha256":"2fc0fe6d4be82300d0f4315e6761de232d0a073e3a7294a70f5e33064ba90b5d","abstract_canon_sha256":"3295345d9014cfadfe1ddd36d1cc99b32263bb3a380edc141bf6498000ffad87"},"schema_version":"1.0"},"canonical_sha256":"b70df2236608c429038a8b16e15d65c4aa4103921a7510bfa56514c1f88054ef","source":{"kind":"arxiv","id":"1004.4124","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.4124","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"1004.4124v3","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4124","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"W4G7EI3GBDCC","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"W4G7EI3GBDCCSA4K","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"W4G7EI3G","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:W4G7EI3GBDCCSA4KRMLOCXLFYS","target":"record","payload":{"canonical_record":{"source":{"id":"1004.4124","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-23T13:07:35Z","cross_cats_sorted":[],"title_canon_sha256":"2fc0fe6d4be82300d0f4315e6761de232d0a073e3a7294a70f5e33064ba90b5d","abstract_canon_sha256":"3295345d9014cfadfe1ddd36d1cc99b32263bb3a380edc141bf6498000ffad87"},"schema_version":"1.0"},"canonical_sha256":"b70df2236608c429038a8b16e15d65c4aa4103921a7510bfa56514c1f88054ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:09.436487Z","signature_b64":"nGscxvXpGqCLFp4WOd1TeYniYKBZYRsuH8UX67mDHEj2iLm/f9TpztvbhHHI3JaSvyZfPr3tEVRl7Hyla6zgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b70df2236608c429038a8b16e15d65c4aa4103921a7510bfa56514c1f88054ef","last_reissued_at":"2026-05-18T03:37:09.435486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:09.435486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.4124","source_version":3,"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-18T03:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ev3BcTb+5Fi5zemIrESFdDkz8z9zt5/hTewg43zbEAFDYW91J8KhyvQrj7O3raSpbbvq7KuWQ7ZlX4fGhoxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:02:46.261665Z"},"content_sha256":"89c27597bbffe6fa611023ce19184068ceeb961963432c5da6cc16757efad8ad","schema_version":"1.0","event_id":"sha256:89c27597bbffe6fa611023ce19184068ceeb961963432c5da6cc16757efad8ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:W4G7EI3GBDCCSA4KRMLOCXLFYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum heuristic algorithm for traveling salesman problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Changhyoup Lee, James Lim, Jeongho Bang, Jinhyoung Lee, Junghee Ryu, Seokwon Yoo","submitted_at":"2010-04-23T13:07:35Z","abstract_excerpt":"We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they are shown characterized by statistical properties of tour costs. In particular for a Gaussian distribution of the tours along the cost we show that the quantum algorithm exhibits the quadratic speedup of its classical counterpart, similarly to Grover search."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4124","kind":"arxiv","version":3},"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-18T03:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hybhRHiEvU6tlhaj7MXPxMtUJmUND0HXOQDBFDOfHkM13TpPyaApIZ3/Fga8SUnEywmBOQnYPqJFSWOcvSgoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:02:46.262075Z"},"content_sha256":"0ee4bf215a65fa8e12111fd4caf45a8e1096beb0431e40933bc803dea0cf4e5c","schema_version":"1.0","event_id":"sha256:0ee4bf215a65fa8e12111fd4caf45a8e1096beb0431e40933bc803dea0cf4e5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4G7EI3GBDCCSA4KRMLOCXLFYS/bundle.json","state_url":"https://pith.science/pith/W4G7EI3GBDCCSA4KRMLOCXLFYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4G7EI3GBDCCSA4KRMLOCXLFYS/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-26T21:02:46Z","links":{"resolver":"https://pith.science/pith/W4G7EI3GBDCCSA4KRMLOCXLFYS","bundle":"https://pith.science/pith/W4G7EI3GBDCCSA4KRMLOCXLFYS/bundle.json","state":"https://pith.science/pith/W4G7EI3GBDCCSA4KRMLOCXLFYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4G7EI3GBDCCSA4KRMLOCXLFYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:W4G7EI3GBDCCSA4KRMLOCXLFYS","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":"3295345d9014cfadfe1ddd36d1cc99b32263bb3a380edc141bf6498000ffad87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-23T13:07:35Z","title_canon_sha256":"2fc0fe6d4be82300d0f4315e6761de232d0a073e3a7294a70f5e33064ba90b5d"},"schema_version":"1.0","source":{"id":"1004.4124","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.4124","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"1004.4124v3","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4124","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"W4G7EI3GBDCC","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"W4G7EI3GBDCCSA4K","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"W4G7EI3G","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:0ee4bf215a65fa8e12111fd4caf45a8e1096beb0431e40933bc803dea0cf4e5c","target":"graph","created_at":"2026-05-18T03:37:09Z","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":"We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they are shown characterized by statistical properties of tour costs. In particular for a Gaussian distribution of the tours along the cost we show that the quantum algorithm exhibits the quadratic speedup of its classical counterpart, similarly to Grover search.","authors_text":"Changhyoup Lee, James Lim, Jeongho Bang, Jinhyoung Lee, Junghee Ryu, Seokwon Yoo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-23T13:07:35Z","title":"Quantum heuristic algorithm for traveling salesman problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4124","kind":"arxiv","version":3},"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:89c27597bbffe6fa611023ce19184068ceeb961963432c5da6cc16757efad8ad","target":"record","created_at":"2026-05-18T03:37:09Z","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":"3295345d9014cfadfe1ddd36d1cc99b32263bb3a380edc141bf6498000ffad87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-23T13:07:35Z","title_canon_sha256":"2fc0fe6d4be82300d0f4315e6761de232d0a073e3a7294a70f5e33064ba90b5d"},"schema_version":"1.0","source":{"id":"1004.4124","kind":"arxiv","version":3}},"canonical_sha256":"b70df2236608c429038a8b16e15d65c4aa4103921a7510bfa56514c1f88054ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b70df2236608c429038a8b16e15d65c4aa4103921a7510bfa56514c1f88054ef","first_computed_at":"2026-05-18T03:37:09.435486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:09.435486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nGscxvXpGqCLFp4WOd1TeYniYKBZYRsuH8UX67mDHEj2iLm/f9TpztvbhHHI3JaSvyZfPr3tEVRl7Hyla6zgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:09.436487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.4124","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89c27597bbffe6fa611023ce19184068ceeb961963432c5da6cc16757efad8ad","sha256:0ee4bf215a65fa8e12111fd4caf45a8e1096beb0431e40933bc803dea0cf4e5c"],"state_sha256":"fe6edb00f3bc4390f28fdb5aeef8839e915530f7f56fadc75c79622c9a0c56b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QYan4iSp5TUGdIxdGDngzg79oLPcQkhgGvmRDECOdli+qIdjMRauUWz8c5kZej2wce8eBAcvXQ1NOdj8YAVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:02:46.265179Z","bundle_sha256":"f08ba6459e2a552c1ef4b47f92b8175b7bac9ead133b46d5f13d4d480907a7e5"}}