{"as_of":"2026-08-10T03:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:384095754b244b94014da60fe62c0554d5b08788cfb01ba539cb26f50f7054fc","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:38:11.700215Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:13:34.880808Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08853","snapshot_observed_at":"2026-08-04T00:13:34.880808Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02696","last_updated":"2026-05-26T09:03:06Z","snapshot_observed_at":"2026-08-05T10:17:00.429895Z","submitted_at":"2025-11-04T16:18:48Z","title":"Resource-efficient variational quantum solver for the travelling salesman problem and its silicon photonics implementation","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-04T00:13:34.880808Z"},"links":{"cited_paper":"/paper/2502.08853","citing_paper":"/paper/2511.02696"},"observation_digest":"sha256:4ccaed61a26695dfa59b3f75f4263a8e26fb8996ab9c0aec58ae1dd0f8941036","observation_id":"8f7694b6-49a4-4dd4-a36a-ec8e17740fb1","resolution":{"observed_at":"2026-08-04T00:13:34.880808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.08853/citation-record","integrity":"/paper/2502.08853/integrity","json":"/paper/2502.08853/citation-record.json","paper":"/paper/2502.08853"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.939386Z","title":"It is clear that a quantum state encoding a feasible solution should rep- resent a N -cycle as an element of N -order permutation group","venue":null,"work_id":"a8eeaad8-a7d6-4e1d-beaf-631d86e407be","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.415284Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:a9ae95a5346e8908f6f49102548e81e8f8184089bd64a6e43658478f86b1cf64","observation_id":"6e962f92-c1dd-487b-b268-643755f73077","resolution":{"observed_at":"2026-08-07T23:38:12.944859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.922248Z","title":null,"venue":null,"work_id":"a19067b5-7991-4064-82a9-5fa179c6963d","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.420710Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:4efc8b1a47eab2bc1f846ed7e920cfc48a7ccced9e6a118e89f1f688e8cf5b31","observation_id":"802ce70d-16a5-44eb-af0d-1dc706b525bf","resolution":{"observed_at":"2026-08-07T23:38:12.927826Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.896938Z","title":"Label the states whose total weights are less than threshold CT","venue":null,"work_id":"11bbdf69-65bf-4ded-934b-e536c12da874","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.426185Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:eeff6498f1dcfeb776c402748e65502f608a2adc0e74278631efce9b31320153","observation_id":"f93e06a0-e9a4-4ab1-acdd-921d465b539a","resolution":{"observed_at":"2026-08-07T23:38:12.903377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.880823Z","title":"indexing unitary","venue":null,"work_id":"b0a8f95c-e77f-41bb-b7ac-a063d528d38e","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.431212Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:ebb69a204ce89ee4bbc7b5722f8bc3fbef282eb44120e4979c2e77b717607061","observation_id":"dc67ae4a-c841-4cce-a4ff-c9d3a96616ef","resolution":{"observed_at":"2026-08-07T23:38:12.886420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.864292Z","title":"The above enumeration process has a terrible time complexity of O((N − 1)!), which makes it a NP-hard problem to find all valid HCs [38]","venue":null,"work_id":"c81eea1a-20e8-495f-9133-4c4af301bfea","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.436699Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:b5e07fb0afe152188b482b623d670ced87b21a72f5173ff3c46011fd93313b1d","observation_id":"f459b776-2132-4a9d-baea-dc54aa516019","resolution":{"observed_at":"2026-08-07T23:38:12.869434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.846408Z","title":", N− 1} and a new permutation eσ = (k − 1, σ)","venue":null,"work_id":"37766e6f-3e67-4401-b03e-50f54e8bc767","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.441451Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:542db61c2f637eb4e98b07ea3ccd978c3fceb8dd75d70344e11b5a64c6e38e0e","observation_id":"85dfa6a7-9d44-49ac-af88-85b520b3fba9","resolution":{"observed_at":"2026-08-07T23:38:12.851844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.831011Z","title":"By performing the above steps for each HC of length N − k, we obtain (N − k − 1)! × (N − k) = (N − k)! new HCs, that is, all ( N − k + 1)-length HCs","venue":null,"work_id":"c463665d-acca-4a40-a588-186f6c7a29df","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.447090Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:c52e45b701caa47bc26bc688a50b7d28fbf1eabababe08e83eca6d4c0d537d36","observation_id":"a9532159-07e0-460e-a111-67eb7c805f96","resolution":{"observed_at":"2026-08-07T23:38:12.836102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.815386Z","title":"The function is to match the second and third sets of registers","venue":null,"work_id":"6a56c567-9bf7-45d3-ad12-c04336a4baeb","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.452297Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:a7dcacca64cba3c5095a7126e027b164bbe206ce39eb77d3361d0f2ca2aa470d","observation_id":"56a98171-3977-41b0-adb1-28670399aa7b","resolution":{"observed_at":"2026-08-07T23:38:12.820792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.798491Z","title":"The function is to set the third set of registers to |0⟩ by performing XOR operation on the second and third sets of registers when the first set of registers is in state |111⟩","venue":null,"work_id":"09927f5e-78c9-4e68-affb-3054c9d9c682","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.457399Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:72863a3deb51a203cac80272aba8a19c5d70260e4c56b3a0cf07f32d28aeaa89","observation_id":"4236f5d4-77cc-402d-87bb-be1ed3db3f95","resolution":{"observed_at":"2026-08-07T23:38:12.803760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.783360Z","title":"The function is to free up the first set of registers","venue":null,"work_id":"f4ed778e-fb52-4208-8df1-639e36b52700","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.462979Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:b072756776d9e3c0199afd2238be88e4f3e470803524ed046ed04c6c63eda88d","observation_id":"c540e35e-595a-4a59-af70-41a94560b40c","resolution":{"observed_at":"2026-08-07T23:38:12.788531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.766267Z","title":"Discussion","venue":null,"work_id":"94cdadad-981d-4017-bb24-20a038bdb78a","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.467588Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:cf4364bb426e273b20d13df7f11bd87679c7ae2b70adb57df5273406dee90bd9","observation_id":"53dc8987-b10c-4b16-9a6d-3b0ba6d733db","resolution":{"observed_at":"2026-08-07T23:38:12.772020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:11.549233Z","title":"Ising formulations of many np problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.549233Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:2403394c30eb3adb8bd8cc8f5a17ad246da5d049b87e62de79f682d25b40d0fc","observation_id":"faa2398e-6f13-4c9b-a596-93c0db316ec6","resolution":{"observed_at":"2026-08-07T23:38:11.549233Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.733342Z","title":"frame- work","venue":null,"work_id":"c7135230-1798-43e6-8e3f-5b7f5d33a4a9","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.478549Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:28ae8149dc915a59374da446caeff81bc641e99cb5928e9d352a72271c38873c","observation_id":"2382fa72-b228-4bec-9967-301783222cfe","resolution":{"observed_at":"2026-08-07T23:38:12.738594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.716842Z","title":"Initialize l = 1 and set λ = 6 /5","venue":null,"work_id":"f4db6686-388f-49af-906d-5d0dc599017c","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.483346Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:d85b7045835450fb780c83e6e6f716b7690d9e821d3ea574ac726608d1e18df8","observation_id":"b62efc1f-f29a-46a9-aa37-de77dc812d69","resolution":{"observed_at":"2026-08-07T23:38:12.722086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.701023Z","title":"(Grover’s searching module can be seen in Fig.2","venue":null,"work_id":"bc281af1-f549-4baf-a311-f3c8c94e6ba1","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.487944Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:2d3468f82a4b6412f659b9bf86f678e4db3e9faf5a4bb265db7aae97539e218e","observation_id":"a36ec7e3-fe78-438e-b56f-d124415eb06c","resolution":{"observed_at":"2026-08-07T23:38:12.706371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.684516Z","title":"The probability finding the optimal solution for the above quantum algorithm is at least 1 /2 by computing the expected running time to find the minimum value, given by [33, 34]","venue":null,"work_id":"87af4a27-4c45-42c0-952d-ad2bcbc57b22","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.492362Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:85704a7934f0b36ae195e3fa806d09f05fc8875ba6d66e3f4b0b9a142af2ddc0","observation_id":"a7899c8c-91d2-4727-a812-7b388b0b2a03","resolution":{"observed_at":"2026-08-07T23:38:12.690681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.667440Z","title":"Quantum algorithms: an overview","venue":null,"work_id":"ab97110e-43ae-4185-8cb2-e95e93dcdd48","year":2016},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.497510Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:d7317466ce7727bc231241d3f54fbb64fbb3469c19f2db93785dbdfb1be7f1bf","observation_id":"060685f0-f93f-4d6a-9787-b317f709b7b4","resolution":{"observed_at":"2026-08-07T23:38:12.672850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:11.502229Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.502229Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:42c6a69a7baff167673ba1305863e082d51d80a409bba97bbc37ef49d4bf6960","observation_id":"dfa208a3-138d-4e9c-af9c-b1ee90e3c2f9","resolution":{"observed_at":"2026-08-07T23:38:11.502229Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.640272Z","title":null,"venue":null,"work_id":"d04b8e52-4727-4d25-bcc0-29051514e7f1","year":1994},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.506577Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:0cec3639fac87b8fa5593a55ea3056a6c808772a3cf688015033a7683fb7f822","observation_id":"b2154225-d7a6-432c-a889-c16b90e7f3ed","resolution":{"observed_at":"2026-08-07T23:38:12.645033Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.624676Z","title":null,"venue":null,"work_id":"36aedc99-ca3f-4ccf-8b82-b4edfab1f312","year":1996},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.511196Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:5f530c45defcd932b833ae3698eacfede55bdcc5e7c23534c7bb9ab4745f2e0f","observation_id":"a4886102-dbd2-4fb1-854e-0a615578ed2f","resolution":{"observed_at":"2026-08-07T23:38:12.629724Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.604763Z","title":"& Tapp, A","venue":null,"work_id":"977fb434-6e8e-4a26-8de9-86797b080f8a","year":1998},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.515599Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:9ec94484bedd38370dc703e2db773f5171d9fc4638ca356ca4ba46b4d205e1ae","observation_id":"5dd8ff9c-1c02-4e28-9234-e8ea9b8ed169","resolution":{"observed_at":"2026-08-07T23:38:12.608887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:11.520568Z","title":"W., Hassidim, A","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.520568Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:9908afb03be1db825692498f359ec770e597e95e1275b8752bb657856c9fb49e","observation_id":"55a8ed2b-7a4a-4265-b4f7-c2793bb6c29a","resolution":{"observed_at":"2026-08-07T23:38:11.520568Z","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-08-07T23:38:11.526052Z","title":"& Sipser, M","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.526052Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:8e86d6ce3b24c544c7c4b6811783c6d446b3c2d084d9464ac85d39bf193d7e2b","observation_id":"28119032-16d4-4c8c-bd92-69544dac8830","resolution":{"observed_at":"2026-08-07T23:38:11.526052Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.590908Z","title":null,"venue":null,"work_id":"fe396769-8c92-4e0a-a636-2158b783fe7f","year":2002},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.530664Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:874a6bb3890ea95eaf82ee38ce0354b446a25fac46bfcb4755efdce43ca1fb00","observation_id":"9fc8458c-0f03-43b2-ad4c-fa31d013847f","resolution":{"observed_at":"2026-08-07T23:38:12.594961Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.577133Z","title":"& Gutmann, S","venue":null,"work_id":"f0b68a11-ba79-413d-879e-fcbc64ecc025","year":2014},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.535448Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:bb3ee62c3474eb042f752872d240ad97f5125f8bfab2bba2db49a2b6c9f556e2","observation_id":"1bd2ac59-76b9-40a3-a10b-5ba1d1a352d0","resolution":{"observed_at":"2026-08-07T23:38:12.581773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:11.540058Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.540058Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:b0637fe86361cad97fac4cefbc1fc82a231da1965db14010d1961cf70a3420da","observation_id":"4bd73933-205b-4f4d-8864-77fb3260be29","resolution":{"observed_at":"2026-08-07T23:38:11.540058Z","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-08-07T23:38:11.544755Z","title":"& Chakrabarti, B","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.544755Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:77a963071ca36cf874a0313bb8ae7179845c0098cd5e4a0a16d6e4b0be7652f1","observation_id":"753fe980-8b25-4b15-8847-30460d6f4bac","resolution":{"observed_at":"2026-08-07T23:38:11.544755Z","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-08-07T23:38:11.644620Z","title":"A., Schmelcher, P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.644620Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:00dc91071a5d9b0ca42baee305a0e0e89760ea7a7868ed1db709f0d328cb2e56","observation_id":"e4996638-71dd-4dd2-ad55-c23b5c856ed6","resolution":{"observed_at":"2026-08-07T23:38:11.644620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18530","last_updated":"2024-02-28T18:08:52Z","snapshot_observed_at":"2026-08-10T00:49:00.335509Z","submitted_at":"2024-02-28T18:08:52Z","title":"Reducing the Number of Qubits from $n^2$ to $n\\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18530","snapshot_observed_at":"2026-08-07T23:38:11.553982Z","title":"& Bahrampour, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.553982Z"},"links":{"cited_paper":"/paper/2402.18530","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:6c530e5cd31b13e6477a5c4a7fd7c07bd92b9f2493d87c043f2bc0c06e176572","observation_id":"a5342aac-5c1a-44f8-8eb1-849cdd047fc7","resolution":{"observed_at":"2026-08-07T23:38:11.553982Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.557071Z","title":"The traveling salesman problem: An overview of exact and approximate algorithms","venue":null,"work_id":"d55baa63-77f5-4b30-88dc-3c6025485879","year":1992},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.558905Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:cfda104ab012bc3d5d0ce7e0ee318da75d927b1265e5cba621d0015e8c022d02","observation_id":"338ee0d0-3afb-494e-a8c1-7503989d4149","resolution":{"observed_at":"2026-08-07T23:38:12.563785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.750384Z","title":"This idea can be ex- tended to our problem","venue":null,"work_id":"d08b8e78-dab8-4647-84f5-e78bafc898bd","year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.473173Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:29c2ed8fd5913b1fab4320b9fad8f29c6610278b2362bf14f8b95661bbb18fed","observation_id":"bb1f9cd0-f6e1-44f4-9269-7287d4f738a5","resolution":{"observed_at":"2026-08-07T23:38:12.755400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.539634Z","title":"& Pathak, K","venue":null,"work_id":"23d89fdd-0969-4c08-9062-2e6698b4ffb9","year":2012},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.563637Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:60c794076d956790cf9d66a77eea24257a68186b848c47076535785f1eaf433a","observation_id":"b4bc9236-7053-4b9b-8809-2c2d01517f25","resolution":{"observed_at":"2026-08-07T23:38:12.545085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.523587Z","title":"Worst-case analysis of a new heuristic for the travelling salesman problem","venue":null,"work_id":"83d70acf-9c36-4399-a5fe-4172987fedd1","year":1976},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.568418Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:7a41c491f4f9d13c94d00722e8d6dd27e0a706a0ed12841963ad26c29b04e0e1","observation_id":"dd2fa735-be53-40be-873b-4c0a1da82381","resolution":{"observed_at":"2026-08-07T23:38:12.528605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.507131Z","title":"An effective implementation of the Lin– Kernighan traveling salesman heuristic","venue":null,"work_id":"769c452c-0cb1-46bd-8477-85f985e2ae5a","year":2000},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.573499Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:3bf42a197a294a2b9e6c2f02cdbe667618aee027e573bab749b1dd875131ee72","observation_id":"f98cea0c-c777-4ec7-8783-991e3ec5d570","resolution":{"observed_at":"2026-08-07T23:38:12.512438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.490891Z","title":null,"venue":null,"work_id":"9e6afe95-ce8c-4e89-8f17-f005c72223cc","year":1990},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.579075Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:d3f02b0f2f07b1267475ff7106bb2093d3036d84df43d6df46f79a8974660d1e","observation_id":"74503cf4-cbd5-4f3f-bbd2-60a188a827f5","resolution":{"observed_at":"2026-08-07T23:38:12.495615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.474005Z","title":"& Prouvost, A","venue":null,"work_id":"fa6e8e96-0553-445a-9aaf-1cc33fef7041","year":2021},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.597637Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:616e2f406911396adc6b0902873e0c5908ef6f5ecfc8b31337701eb7bd5daa20","observation_id":"a8171aca-acd6-4940-b820-d796a46abb44","resolution":{"observed_at":"2026-08-07T23:38:12.479546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.05517","last_updated":"2018-07-15T09:12:08Z","snapshot_observed_at":"2026-08-10T00:49:29.339278Z","submitted_at":"2018-07-15T09:12:08Z","title":"Boosting Combinatorial Problem Modeling with Machine Learning","version":1},"cited_work":{"arxiv_id":"1807.05517","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.05517","snapshot_observed_at":"2026-08-07T23:38:12.211497Z","title":"Boosting Combinatorial Problem Modeling with Machine Learning","venue":"cs.AI","work_id":"a51d516c-e6c6-4914-a276-7e77f8237ffe","year":2018},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.604435Z"},"links":{"cited_paper":"/paper/1807.05517","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:0a74c03fae6c67fed792c28c415fc68d36078107f27491429e5c9fe9fb39ba3f","observation_id":"95d9f4ec-4db7-451f-aae5-6de4c322e0a8","resolution":{"observed_at":"2026-08-07T23:38:12.216643Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:11.609333Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.609333Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:5885e28ba03d1a2ba5545b6393758944b2d41bfdb5124cc8c7ef58e974491753","observation_id":"dd8288a2-3479-4826-8686-90161883e0c5","resolution":{"observed_at":"2026-08-07T23:38:11.609333Z","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-08-07T23:38:11.614050Z","title":"& Gonz´ alez, F","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.614050Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:a7c4ab31e902e33037ce7d495f46a963d19c97e40fc53ff1aa067436643fa7ac","observation_id":"d3c31dbd-b271-4df5-9cbe-32a7f515ee51","resolution":{"observed_at":"2026-08-07T23:38:11.614050Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.456332Z","title":"Quantum Annealing and GNN for Solv- ing TSP with QUBO, 134–145 (Springer Nature Sin- gapore, 2024)","venue":null,"work_id":"e1a7e485-1b4b-4256-932f-97d052f9a9d8","year":2024},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.619908Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:8213b4be946167042d8bec3ce3396d3d3494eeac50e694f8778dfa00d770da93","observation_id":"054ec5a6-f701-4b7b-99b1-5e0f05f8a4e7","resolution":{"observed_at":"2026-08-07T23:38:12.461581Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:11.624866Z","title":"A., Willsch, D., Maldonado-Romo, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.624866Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:9b6d1c62915690af0350d7524d8b4d2933bd8045179e13d13e8554bf756f06b4","observation_id":"2c2c6a7f-9474-4f45-b6f6-c1ed46617ee7","resolution":{"observed_at":"2026-08-07T23:38:11.624866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14252","last_updated":"2024-06-20T12:25:00Z","snapshot_observed_at":"2026-08-10T00:49:00.229887Z","submitted_at":"2024-06-20T12:25:00Z","title":"Beyond QUBO and HOBO formulations, solving the Travelling Salesman Problem on a quantum boson sampler","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14252","snapshot_observed_at":"2026-08-07T23:38:11.629515Z","title":"& Day-Evans, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.629515Z"},"links":{"cited_paper":"/paper/2406.14252","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:f87e96ff95cd3915ff475bfaf21798d49c7e3c4c0421784837e700405a6e5cf8","observation_id":"a40372b0-b284-463e-a779-8b4827fb332e","resolution":{"observed_at":"2026-08-07T23:38:11.629515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-07-06T16:51:48.364103Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"cited_work":{"arxiv_id":"2311.14344","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.14344","snapshot_observed_at":"2026-08-07T23:38:12.173888Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","venue":"quant-ph","work_id":"7a182467-bef5-41cd-ba41-a14cc3d6d6ba","year":2023},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.634884Z"},"links":{"cited_paper":"/paper/2311.14344","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:807abf75f0469767c6d47572fa6c221aa36ceab17a9b6cefa2ac4df3aebd8438","observation_id":"a0efa410-dd75-4760-892c-3aa74895e30b","resolution":{"observed_at":"2026-08-07T23:38:12.179145Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.13616","last_updated":"2024-07-18T15:55:01Z","snapshot_observed_at":"2026-08-10T00:49:00.870539Z","submitted_at":"2024-07-18T15:55:01Z","title":"Quantum Local Search for Traveling Salesman Problem with Path-Slicing Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.13616","snapshot_observed_at":"2026-08-07T23:38:11.639995Z","title":"& Ya- mashiro, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.639995Z"},"links":{"cited_paper":"/paper/2407.13616","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:57ea42fade4abd5acb95d893536008ea02c1055619de81e807f3e4e6c42b4b0c","observation_id":"7dcd2bee-d8dd-448d-8214-58858279fed7","resolution":{"observed_at":"2026-08-07T23:38:11.639995Z","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-08-10T00:47:53.748856Z","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-08-07T23:38:11.649359Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.649359Z"},"links":{"cited_paper":"/paper/2212.02735","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:6ae2d68c9f00fce7b7073ff02233d0a35c5a99c9a43342e14da18b251b2d19a5","observation_id":"830852d5-116a-4638-9ed6-cd0c6a346a25","resolution":{"observed_at":"2026-08-07T23:38:11.649359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07129","last_updated":"2025-03-12T03:38:33Z","snapshot_observed_at":"2026-08-10T00:49:35.004179Z","submitted_at":"2024-05-12T01:44:19Z","title":"Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems","version":3},"cited_work":{"arxiv_id":"2405.07129","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.07129","snapshot_observed_at":"2026-08-07T23:38:12.019159Z","title":"Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems","venue":"quant-ph","work_id":"17d2e55a-0493-4c31-9658-4200ff277548","year":2024},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.654060Z"},"links":{"cited_paper":"/paper/2405.07129","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:efabc074960818ab107d5d2fa5ff5551251aebbc185b5e397bdc87bae4a21e87","observation_id":"e469cc10-f2ad-4119-8713-ece07c7cc0d0","resolution":{"observed_at":"2026-08-07T23:38:12.025196Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:11.659139Z","title":"& Gonciulea, C","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.659139Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:3b607694ad74ca29af8d35ac9e3abcea999deccb69dbd9ca5c19ac7cbce338a0","observation_id":"a2e3cde8-64aa-431f-84e2-9aa12f1c6483","resolution":{"observed_at":"2026-08-07T23:38:11.659139Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.440873Z","title":null,"venue":null,"work_id":"3b218181-1307-4205-8823-34f98752cd38","year":2020},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.663504Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:05df609d1f27a69b3e1860397cfd9f942cf7ae1e7b15f0ddd61d8b492961620c","observation_id":"6eacb007-de3c-4c11-ae83-e0c6a4f12fc8","resolution":{"observed_at":"2026-08-07T23:38:12.445759Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-08-07T23:38:11.667732Z","title":"& Hoyer, P","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.667732Z"},"links":{"cited_paper":"/paper/quant-ph/9607014","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:0624802663fe469a91fcdcd2b035cb3d8be4dfee9cc2f76ffe48c8f27128c0dd","observation_id":"8caedc47-16b4-4d9c-a6ee-43c38f2403c7","resolution":{"observed_at":"2026-08-07T23:38:11.667732Z","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-08-07T23:38:11.672121Z","title":"& Tapp, A","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.672121Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:fba430b5813e1ac4c836a4e50a1bbba71e678c2d0a094eb427cba501b62dbcb9","observation_id":"21d11c33-678d-4014-80fb-dd60e0ba9282","resolution":{"observed_at":"2026-08-07T23:38:11.672121Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.425366Z","title":"& Ruskey, F","venue":null,"work_id":"19981d47-419f-4c81-8937-2e80c395d892","year":2001},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.677217Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:5185556fde0aabacd53c00ec52320763291cae537dcc744644f49b2972d44a8f","observation_id":"63290a0f-ef8a-4a9e-9295-f3e9dda4e00e","resolution":{"observed_at":"2026-08-07T23:38:12.430622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.410066Z","title":"& Wang, J","venue":null,"work_id":"f0c61cf6-9b08-4371-91cb-a6c2af8217bd","year":2020},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.681723Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:641d293685a01c962c1a6efdac55c096c74c677661e48db560ba4834ac3af09b","observation_id":"1e005d77-b567-4983-addf-c3fe4eea43fd","resolution":{"observed_at":"2026-08-07T23:38:12.415045Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.01647","last_updated":"2018-10-03T09:14:29Z","snapshot_observed_at":"2026-08-10T00:49:37.137644Z","submitted_at":"2018-10-03T09:14:29Z","title":"Graph comparison via nonlinear quantum search","version":1},"cited_work":{"arxiv_id":"1810.01647","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.01647","snapshot_observed_at":"2026-08-07T23:38:11.977438Z","title":"Graph comparison via nonlinear quantum search","venue":"quant-ph","work_id":"816c6096-fab9-44bb-8a3b-d91d4f0584ff","year":2018},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.686044Z"},"links":{"cited_paper":"/paper/1810.01647","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:5d6265e7fcd07afc6120c016d5780059e76d4b62533240ab829e9925e63c60a9","observation_id":"fb736e81-6913-4810-8ba6-d77dd9ff65ae","resolution":{"observed_at":"2026-08-07T23:38:11.984423Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:12.395063Z","title":"& Saito, N","venue":null,"work_id":"5fc15950-da5b-4f49-8832-db8774c3ffc6","year":1980},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.690785Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:f3b2e279766f0f16a78ab7ef5cca9580fbb9ef3c368d5daf8040f42ac739bdf8","observation_id":"4cabdf1b-f91d-4485-9dc5-f78d0a7825ff","resolution":{"observed_at":"2026-08-07T23:38:12.399052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T23:38:11.695699Z","title":"& Tapp, A","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.695699Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:a0ba398c5ff16515cc1617f274bccd61933a08f7a2c72f06a3e3b990eac35099","observation_id":"a5a31dd6-c7e3-45e5-bd9b-f6eb62c6b82d","resolution":{"observed_at":"2026-08-07T23:38:11.695699Z","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-08-07T23:38:11.700215Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.700215Z"},"links":{"citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:5f5e2fe53f951acedb9024ea9f666bf3449309dad56b400c12f2d97308e01165","observation_id":"b9e6c253-8bd2-42c9-b8cd-433b92087251","resolution":{"observed_at":"2026-08-07T23:38:11.700215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","latest_version":4,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":4,"verified_fuzzy":25},"total_outbound_references":56},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 1 inbound Pith citation observation for arXiv:2502.08853."}