{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2HPCT2T76NLEDTEE4YQ4Z4LKJB","short_pith_number":"pith:2HPCT2T7","schema_version":"1.0","canonical_sha256":"d1de29ea7ff35641cc84e621ccf16a4868031f9743cbb5ba2e56e643fe35eb97","source":{"kind":"arxiv","id":"2606.07322","version":1},"attestation_state":"computed","paper":{"title":"Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Honghong Lin, Xujun Bai, Yun Shang","submitted_at":"2026-06-05T14:39:38Z","abstract_excerpt":"The traveling salesman problem (TSP) is a significant classical NP-hard combinatorial optimization problem. In this work, we demonstrate that combining classical dynamic programming with quantum search can yield an achievable quantum advantage for TSP on the basis of excellent work by the authors of~\\cite{ambainis2019quantum}. We design the quantum divide and conquer strategy to provide a parameterized spectrum for this combination. The hybrid algorithm proposed in~\\cite{ambainis2019quantum} corresponds to a specific case in this spectrum, while the two extremes of the spectrum represent the p"},"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":"2606.07322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-05T14:39:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"01823d5a485c80b7df7ce2476dd9eb90a05d4408ba8ab942a350956637eaed96","abstract_canon_sha256":"c2dbc29f0bc52ecf61522e6aeaf509ead5577d67f330f50ae15544d325861a27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:19.473490Z","signature_b64":"e1THoESxNQTM/g9/sBbOiOQBnF+nhghV+7vUyhHDOGwHyalr4902M7HV3jn3uOCCrzcpuVkDuCAxkuBqiyiuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1de29ea7ff35641cc84e621ccf16a4868031f9743cbb5ba2e56e643fe35eb97","last_reissued_at":"2026-06-08T01:05:19.472497Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:19.472497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Honghong Lin, Xujun Bai, Yun Shang","submitted_at":"2026-06-05T14:39:38Z","abstract_excerpt":"The traveling salesman problem (TSP) is a significant classical NP-hard combinatorial optimization problem. In this work, we demonstrate that combining classical dynamic programming with quantum search can yield an achievable quantum advantage for TSP on the basis of excellent work by the authors of~\\cite{ambainis2019quantum}. We design the quantum divide and conquer strategy to provide a parameterized spectrum for this combination. The hybrid algorithm proposed in~\\cite{ambainis2019quantum} corresponds to a specific case in this spectrum, while the two extremes of the spectrum represent the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07322","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/2606.07322/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":"2606.07322","created_at":"2026-06-08T01:05:19.472688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07322v1","created_at":"2026-06-08T01:05:19.472688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07322","created_at":"2026-06-08T01:05:19.472688+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HPCT2T76NLE","created_at":"2026-06-08T01:05:19.472688+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HPCT2T76NLEDTEE","created_at":"2026-06-08T01:05:19.472688+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HPCT2T7","created_at":"2026-06-08T01:05:19.472688+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/2HPCT2T76NLEDTEE4YQ4Z4LKJB","json":"https://pith.science/pith/2HPCT2T76NLEDTEE4YQ4Z4LKJB.json","graph_json":"https://pith.science/api/pith-number/2HPCT2T76NLEDTEE4YQ4Z4LKJB/graph.json","events_json":"https://pith.science/api/pith-number/2HPCT2T76NLEDTEE4YQ4Z4LKJB/events.json","paper":"https://pith.science/paper/2HPCT2T7"},"agent_actions":{"view_html":"https://pith.science/pith/2HPCT2T76NLEDTEE4YQ4Z4LKJB","download_json":"https://pith.science/pith/2HPCT2T76NLEDTEE4YQ4Z4LKJB.json","view_paper":"https://pith.science/paper/2HPCT2T7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07322&json=true","fetch_graph":"https://pith.science/api/pith-number/2HPCT2T76NLEDTEE4YQ4Z4LKJB/graph.json","fetch_events":"https://pith.science/api/pith-number/2HPCT2T76NLEDTEE4YQ4Z4LKJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HPCT2T76NLEDTEE4YQ4Z4LKJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HPCT2T76NLEDTEE4YQ4Z4LKJB/action/storage_attestation","attest_author":"https://pith.science/pith/2HPCT2T76NLEDTEE4YQ4Z4LKJB/action/author_attestation","sign_citation":"https://pith.science/pith/2HPCT2T76NLEDTEE4YQ4Z4LKJB/action/citation_signature","submit_replication":"https://pith.science/pith/2HPCT2T76NLEDTEE4YQ4Z4LKJB/action/replication_record"}},"created_at":"2026-06-08T01:05:19.472688+00:00","updated_at":"2026-06-08T01:05:19.472688+00:00"}