{"as_of":"2026-08-04T13:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8871e73ea2985db1e0e84813965f8915a40a29590e7051a774591bfa5cc2ce4c","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T14:53:14.813854Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.07322/citation-record","integrity":"/paper/2606.07322/integrity","json":"/paper/2606.07322/citation-record.json","paper":"/paper/2606.07322"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Fork >2, letα 1 < 1 2, thenf(α 1) is monotonically increasing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:0a5563ed334dda8b62a46bd0fe5b8e1f5f93b06af474f0d286d6024b90e27bb3","observation_id":"9a29a0a1-dd7e-4ca6-abff-15a5e22fd36e","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Finally, we calculate the optimal query complexity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:e050320435c1685f25625858f07ff6495651be5c6f9371808ff942de36cf23f6","observation_id":"2a16c997-4b2e-454e-a516-4c56e9538498","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"atα 1 =α 2 = 1 3, which is below the mini- mum value off, i.e.,f( 1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:d2c4f0075f4e24685ca873a50f687002d53fd0878e76b332e31c59429db173eb","observation_id":"970a5510-2e06-458b-8b7e-98446aa400ab","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"The corresponding query complexity isO ∗(20.918295...n) = O∗(1.889881","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:8a5de8bbb071f9ebe321359f6e825819bfb1225b7c4c0a08568d84d845ea543b","observation_id":"b0b4ebfa-910d-42b4-badc-a87da88f77f8","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"qubits” denotes the required number of qubits, “num","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:330f60899081d10bc21108689bf460689583d9b1ad957bc90d8b759b6251a0b7","observation_id":"cb07ccac-7807-4f99-9974-bdaf914c8e02","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Quantum speedups for exponential-time dynamic programming algorithms","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:09f59d77ac39e1b57ffab6754c206ed5c08bbe29e4e9f0326da33e9a93b72b7a","observation_id":"f49cfe3b-c13a-4cfc-9e5c-70604318cf50","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Weakly measured while loops: peeking at quantum states","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:c96f3944f53a6d489ab69ff3aed298bbad2dd140d7219ff2faded3e8d1ea5fed","observation_id":"9ef19d81-320e-440f-a06e-1e2eb6551db8","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"A quantum speedup algorithm for tsp based on quantum dynamic pro- gramming with very few qubits.Theoretical Computer Science, page 115423, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:15d13b8d7b305b403c60f04852b2627d6b359f94b10fe1006d4cf1629a8ec1e8","observation_id":"8466c4d3-b64a-4751-a346-30ed71126983","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Deterministic preparation of dicke states","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:d81993f9e21ecd3965614943975046a1f5bad65b96f03b97ca76b494ec0a0a48","observation_id":"4497a1c2-bd83-40e7-a59e-9482c63bc6e4","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Grover mixers for qaoa: Shifting complexity from mixer design to state preparation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:5140973247781092a07787a8054efeebb4020550f9ec0bde6a8b4ffbfca23666","observation_id":"e7e5ddc2-d908-4476-8828-6318b5b2095a","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Dynamic programming treatment of the travelling salesman problem.Journal of the ACM (JACM), 9(1):61–63, 1962","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:cc6b6e97b07fdf7c98704490f22c388b97d075ca0c4bf68a29c774eaeeeb4fda","observation_id":"2b2d1ec7-1f64-4827-9393-014aea80f0cc","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17965","last_updated":"2025-04-24T22:24:39Z","snapshot_observed_at":"2026-07-06T21:14:28.688897Z","submitted_at":"2025-04-24T22:24:39Z","title":"Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17965","snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Quantum fisher-yates shuffle: Unifying methods for gener- ating uniform superpositions of permutations.arXiv preprint arXiv:2504.17965, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"cited_paper":"/paper/2504.17965","citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:35960a559e8842f0d70f98929309b41ff20f5d6de169b4c6b984c9d21c7f04a9","observation_id":"fa4c96c5-50ff-474e-8175-9662b9e37114","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Tight bounds on quantum searching","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:e6a8f7a6f36da3a5e6c12d08776812211fcaaeefb5d5c81d2812bccf82d94a94","observation_id":"8d9a4238-d47f-480e-ac41-883c8fc05bea","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0005055","last_updated":"2000-05-15T18:19:59Z","snapshot_observed_at":"2026-07-07T07:03:25.387553Z","submitted_at":"2000-05-15T18:19:59Z","title":"Quantum Amplitude Amplification and Estimation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0005055","snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Quantum amplitude amplification and estimation.arXiv preprint quant-ph/0005055, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"cited_paper":"/paper/quant-ph/0005055","citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:3543988b9b5a95a8ca9a5f54183d9bb384a548266db1be55fed53fca9c7cd16f","observation_id":"ebcfc12e-6127-4ef0-9585-cea48635320f","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15797","last_updated":"2025-07-21T16:57:15Z","snapshot_observed_at":"2026-07-06T22:00:33.554745Z","submitted_at":"2025-07-21T16:57:15Z","title":"Deterministic Quantum Search via Recursive Oracle Expansion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.15797","snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Deterministic quantum search via recursive oracle expansion","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"cited_paper":"/paper/2507.15797","citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:7bf605869a201a95c360ab777afa85269f0e2ff3b668d6122e3f9871231686cd","observation_id":"1e62edd0-c31c-427a-8752-087f592b2531","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.28627","last_updated":"2026-03-30T16:10:08Z","snapshot_observed_at":"2026-07-06T22:51:09.377351Z","submitted_at":"2026-03-30T16:10:08Z","title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.28627","snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Shor’s algorithm is possible with as few as 10,000 reconfigurable atomic qubits.arXiv preprint arXiv:2603.28627, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"cited_paper":"/paper/2603.28627","citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:59cfee62b877e1a5244bf00289fd5dcfd89308a6c16d7e220d1f474653b669c8","observation_id":"1d91ef21-0efa-428c-bac1-73050c32d964","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Survey of methods of solving tsp along with its implementation using dynamic programming approach.International journal of computer applications, 52(4), 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:9b03907fe3b616bd3deb53a4262b837cdf97a05e5e2b1b02f640e2e13dfdd841","observation_id":"f2633826-c06f-4407-9b73-6c0e6ad7839e","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Graph comparison via nonlinear quantum search.Quantum Information Processing, 18(10):302, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:61d3609cc661605620b6e2a55a4913a7e35e40cb20c3d84837d14ae3721f6566","observation_id":"5f45f429-5e2c-400a-886a-c29e576996b4","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Coherence in spontaneous radiation processes.Physical review, 93(1):99, 1954","venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:a94bdd1a170fdf15ccc80e110c3fd2c1c36b94a5b4a78a5961c3b17b5ceaf488","observation_id":"7bb9ab91-fafc-4dda-a1d9-e13ba8ac713c","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9607014","last_updated":"1999-01-07T16:50:45Z","snapshot_observed_at":"2026-07-07T07:26:17.833366Z","submitted_at":"1996-07-18T19:12:42Z","title":"A Quantum Algorithm for Finding the Minimum","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9607014","snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"A quantum algorithm for finding the minimum.arXiv preprint quant-ph/9607014, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"cited_paper":"/paper/quant-ph/9607014","citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:bc7e66e07cab976234c2d8a99b569b13d20f24c48b14b7a0e74e8ba5f59ec9b1","observation_id":"e5dfd550-c005-4859-ae51-cf3a5db6bf8d","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Statistical tables for biological, agricultural and medical research","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:9a3981a1d39f4db54a544d7083c7c8149f4a17bafe848d67ac9170d1c50dfa87","observation_id":"514755e7-4949-450a-8bee-065879ca0f37","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Constructing large controlled nots","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:f441ee57058ac6ea330d2d58302668af4b6a7c300527c48437197e281e215bac","observation_id":"fa76e08e-d6ce-4842-98b8-f7428bcb6ec4","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Grover adaptive search for constrained polynomial binary optimization.Quantum, 5:428, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:c362064a41acba528127789473a5e261c404b14a702a8b071a5bff9f8cf96e99","observation_id":"f54aa27b-678d-4c17-b08d-fd29218818f2","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Quantum random access memory.Physical review letters, 100(16):160501, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:05112af656f336914840acffe725e535a5b76750948b13fd6f799e84b27a5739","observation_id":"3e864231-e3d6-42c0-bff2-777dfe5b469a","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"A fast quantum mechanical algorithm for database search","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:95166f54a721012df9f069762485eb1d2a568482b5d733184ca3cc2d5c994444","observation_id":"3bc0de6e-8814-4742-b48a-f7d702200d61","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Resilience of quantum random access memory to generic noise.Prx Quantum, 2(2):020311, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:bca1b63b8190ddba249f6c82641c90b4230beb494849e1e1c8b1d6ba386eea7f","observation_id":"e1dc9d39-3f2a-4911-af6a-3df3b7ecbf3a","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Hardware-efficient quantum random access memory with hybrid quantum acoustic systems.Physical review letters, 123(25):250501, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:42841fcc733fb45e5ea387e1566a0154f5bbf53f0a1ad9b321ed797061e98336","observation_id":"d1cc674d-b74c-41d3-bb94-6b5946186d6a","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"A dynamic programming approach to sequencing problems.Journal of the Society for Industrial and Applied mathematics, 10(1):196–210, 1962","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:de9c6a43d23b179a0aba4a2562d683c9ae5314eaae12985dc590faa13c08acd5","observation_id":"0b3e5a4d-cd0e-4378-a566-2882e871c876","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Dicke state quantum search for solving the vertex cover problem.Mathematics, 30 13(18):3005, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:66c007e3cc0611fdbeb9aa1ea45b177663383cfd3f1a7f7f4df10b09868f85ff","observation_id":"2edc8ee4-aecd-4523-bb72-7ebc61c9b564","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"The traveling salesman problem: An overview of exact and approximate algorithms","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:5f13e11fcde287dc5586dce6c812c555eb5327de3646c44f65aea1dd4330afbe","observation_id":"3a0e7d76-9e12-4a74-b69f-6196e38d4d71","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Generalised phase kick-back: the structure of computational algorithms from physical principles.New Journal of Physics, 18(3):033023, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:f600c424e0bd68be4a150671c2738b11280b1b80a10fe415d07b7540a1724489","observation_id":"0f0ff8be-ae5c-4350-90f8-3f79f5882e27","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Grover algorithm with zero theoretical failure rate.Physical Review A, 64(2):022307, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:f314b10e35637082f3d8e01301ed4470c071fa1cad8097525fa2218798945947","observation_id":"4de585ba-84b4-477e-b84a-f5b1270821fc","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Combinatorial optimization via highly efficient quantum walks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:50d493e240c98b16087ccf037df8bf57a376792389e8d1ebe441590a1195bacb","observation_id":"fd950778-0ef4-4afe-b621-9345ef208484","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.16564","last_updated":"2026-06-27T16:16:00Z","snapshot_observed_at":"2026-07-13T23:41:12.251431Z","submitted_at":"2026-03-17T14:23:47Z","title":"Quantum classification and search algorithms using spinorial representations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.16564","snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Quantum classification and search algorithms using spinorial representations.arXiv preprint arXiv:2603.16564, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"cited_paper":"/paper/2603.16564","citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:4b1714b9ab28fa3e323f30c1bba916245e68925bd5e05b2dd740963ae7675d72","observation_id":"94cf56a2-4902-4235-aee5-696287b47f36","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"A generalisation of the phase kick- back.Quantum Information Processing, 22(3):143, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:447b414bf2bc23d0c32ff245ce26ddd956a52a253f4eb630d16350fad7f02990","observation_id":"557af5db-3455-4ab6-bfc0-8f43b8579798","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.11777","last_updated":"2020-03-26T07:42:05Z","snapshot_observed_at":"2026-07-06T09:07:26.866731Z","submitted_at":"2020-03-26T07:42:05Z","title":"Robust quantum minimum finding with an application to hypothesis selection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.11777","snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Robust quantum minimum finding with an application to hypothesis selection.arXiv preprint arXiv:2003.11777, 2020","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"cited_paper":"/paper/2003.11777","citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:1eafcfe665a1aab9002d3476a3a61fda1563df5d91f7fd21847d3cfd9e1b1ec2","observation_id":"b2793bbf-5934-4ff7-92c6-e10cdff15ac1","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"An algorithm to generate a random cyclic permutation.Information processing letters, 22(6):315–317, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:8d41c150cc192620b43b84842f525638627b8289a864bec60bbae74eccc082e5","observation_id":"c6aa1183-2b33-4386-b199-7eb3675dbad6","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"A bucket-brigade quantum random access memory.Nature Physics, pages 1–6, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:2faf837c6f4b74b78de5bd6a1ebbbcc985a1f89519eafeb17a925f56a068c8de","observation_id":"1bfa95c8-c5bb-4271-a3d6-e68efd374c20","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Overview of sattolo’s algorithm","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:10e3027f0ad877c98eeacead889852af8f9534f9e60df854c83d7e15ae8dbaa0","observation_id":"410f5e5a-b274-4bf4-8ec5-d3fc4c59f1bd","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"Quantum state preparation with optimal circuit depth: Implementations and applications.Physical Review Letters, 129(23):230504, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:f2f020959d048fdcd5c9d2e84106ef589a94a6ef5cd2d4c23f74576abc88c913","observation_id":"32fd375b-24df-4cc6-9d4d-4afc1b2182ae","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.02735","last_updated":"2022-12-06T03:54:07Z","snapshot_observed_at":"2026-07-06T14:27:14.966862Z","submitted_at":"2022-12-06T03:54:07Z","title":"A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.02735","snapshot_observed_at":"2026-07-12T14:53:14.813854Z","title":"A realizable gas-based quantum algorithm for traveling salesman problem.arXiv preprint arXiv:2212.02735, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-12T14:53:14.813854Z"},"links":{"cited_paper":"/paper/2212.02735","citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:abba12218bea5f5ee2703e06cc99f7ba960fe502119d55fdcbc567d9c34c8a2a","observation_id":"61457928-0d45-43fe-b883-cd425b2d67ef","resolution":{"observed_at":"2026-07-12T14:53:14.813854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.07322","last_updated":"2026-07-05T03:16:49Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-02T05:47:41.978413Z","submitted_at":"2026-06-05T14:39:38Z","title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":41},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2606.07322."}