{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ECQOXIHUOH24EVIRU4QQ6VYV2U","short_pith_number":"pith:ECQOXIHU","schema_version":"1.0","canonical_sha256":"20a0eba0f471f5c25511a7210f5715d506f56b1bc2c9d7d71d5df57aed591c59","source":{"kind":"arxiv","id":"2212.02735","version":1},"attestation_state":"computed","paper":{"title":"A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Hansen Wang, Hao Wu, Jieao Zhu, Tiefu Li, Yihuai Gao","submitted_at":"2022-12-06T03:54:07Z","abstract_excerpt":"The paper proposes a quantum algorithm for the traveling salesman problem (TSP) based on the Grover Adaptive Search (GAS), which can be successfully executed on IBM's Qiskit library. Under the GAS framework, there are at least two fundamental difficulties that limit the application of quantum algorithms for combinatorial optimization problems. One difficulty is that the solutions given by the quantum algorithms may not be feasible. The other difficulty is that the number of qubits of current quantum computers is still very limited, and it cannot meet the minimum requirements for the number of "},"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":"2212.02735","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T03:54:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7239c4e610484de791604518c787651636ee622d11cd2b601f33565b07a0ec9c","abstract_canon_sha256":"51ee7bf46a0a4b7b93924e8549aed76ff25cf88d4c3f9cd56e0010af6d681578"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:33.659500Z","signature_b64":"Xk+toNIO8/5zCFJbhtMoSACd6ktyElTo7UgWxM3L+WQ/FSt6VpY1wOXHdcAJYarJvpM5xftPGh9kwJ8odijoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20a0eba0f471f5c25511a7210f5715d506f56b1bc2c9d7d71d5df57aed591c59","last_reissued_at":"2026-07-05T05:22:33.659053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:33.659053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Hansen Wang, Hao Wu, Jieao Zhu, Tiefu Li, Yihuai Gao","submitted_at":"2022-12-06T03:54:07Z","abstract_excerpt":"The paper proposes a quantum algorithm for the traveling salesman problem (TSP) based on the Grover Adaptive Search (GAS), which can be successfully executed on IBM's Qiskit library. Under the GAS framework, there are at least two fundamental difficulties that limit the application of quantum algorithms for combinatorial optimization problems. One difficulty is that the solutions given by the quantum algorithms may not be feasible. The other difficulty is that the number of qubits of current quantum computers is still very limited, and it cannot meet the minimum requirements for the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02735","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/2212.02735/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":"2212.02735","created_at":"2026-07-05T05:22:33.659129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.02735v1","created_at":"2026-07-05T05:22:33.659129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02735","created_at":"2026-07-05T05:22:33.659129+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECQOXIHUOH24","created_at":"2026-07-05T05:22:33.659129+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECQOXIHUOH24EVIR","created_at":"2026-07-05T05:22:33.659129+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECQOXIHU","created_at":"2026-07-05T05:22:33.659129+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07322","citing_title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18393","citing_title":"Quantum Model for CVRPTW","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECQOXIHUOH24EVIRU4QQ6VYV2U","json":"https://pith.science/pith/ECQOXIHUOH24EVIRU4QQ6VYV2U.json","graph_json":"https://pith.science/api/pith-number/ECQOXIHUOH24EVIRU4QQ6VYV2U/graph.json","events_json":"https://pith.science/api/pith-number/ECQOXIHUOH24EVIRU4QQ6VYV2U/events.json","paper":"https://pith.science/paper/ECQOXIHU"},"agent_actions":{"view_html":"https://pith.science/pith/ECQOXIHUOH24EVIRU4QQ6VYV2U","download_json":"https://pith.science/pith/ECQOXIHUOH24EVIRU4QQ6VYV2U.json","view_paper":"https://pith.science/paper/ECQOXIHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.02735&json=true","fetch_graph":"https://pith.science/api/pith-number/ECQOXIHUOH24EVIRU4QQ6VYV2U/graph.json","fetch_events":"https://pith.science/api/pith-number/ECQOXIHUOH24EVIRU4QQ6VYV2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECQOXIHUOH24EVIRU4QQ6VYV2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECQOXIHUOH24EVIRU4QQ6VYV2U/action/storage_attestation","attest_author":"https://pith.science/pith/ECQOXIHUOH24EVIRU4QQ6VYV2U/action/author_attestation","sign_citation":"https://pith.science/pith/ECQOXIHUOH24EVIRU4QQ6VYV2U/action/citation_signature","submit_replication":"https://pith.science/pith/ECQOXIHUOH24EVIRU4QQ6VYV2U/action/replication_record"}},"created_at":"2026-07-05T05:22:33.659129+00:00","updated_at":"2026-07-05T05:22:33.659129+00:00"}