{"as_of":"2026-08-10T12:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab3eae71c36630a3d96e25718ae67ceb0f9293406f0667797739931ebe4f67aa","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:38:11.553982Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-16T17:48:11.564560Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.18530","last_updated":"2024-02-28T18:08:52Z","snapshot_observed_at":"2026-08-10T10:12:42.165054Z","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:908935309e961c915c7391fd0dfa8d49745f4ab96f521b6b9d1857a6b43651a9","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":{"arxiv_id":"2402.18530","last_updated":"2024-02-28T18:08:52Z","snapshot_observed_at":"2026-08-10T10:12:42.165054Z","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-04T00:13:33.138621Z","title":null,"venue":null,"work_id":null,"year":2024},"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":64,"source":"pdf_text","source_observed_at":"2026-08-04T00:13:33.138621Z"},"links":{"cited_paper":"/paper/2402.18530","citing_paper":"/paper/2511.02696"},"observation_digest":"sha256:c7269f6cac6ed5545d94b8375110a4608e320f0d13df53b6b2a5d8f560d0d94b","observation_id":"77ff2133-f960-46b2-9a81-515cb919913f","resolution":{"observed_at":"2026-08-04T00:13:33.138621Z","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-10T10:12:42.165054Z","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-03T18:59:10.995591Z","title":"Ramezani, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.02940","last_updated":"2026-05-23T13:30:26Z","snapshot_observed_at":"2026-08-10T00:49:36.581242Z","submitted_at":"2025-12-02T17:04:57Z","title":"Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:10.995591Z"},"links":{"cited_paper":"/paper/2402.18530","citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:10c1e8ca6ba52a707d3afc6911a16e4fd1188e307235d897b5a12adffaf91dd4","observation_id":"481e80f2-329c-48db-a126-284f44a6ee5a","resolution":{"observed_at":"2026-08-03T18:59:10.995591Z","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-10T10:12:42.165054Z","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":"2402.18530","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.18530","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ramezani, S","venue":null,"work_id":"fed598de-0f4a-4463-b2e4-7ae037fc6212","year":2024},"citing_paper":{"arxiv_id":"2601.01516","last_updated":"2026-01-04T12:58:04Z","snapshot_observed_at":"2026-07-06T22:40:41.626783Z","submitted_at":"2026-01-04T12:58:04Z","title":"Constraint-Aware Quantum Optimization via Hamming Weight Operators","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-16T17:46:09.462808Z"},"links":{"cited_paper":"/paper/2402.18530","citing_paper":"/paper/2601.01516"},"observation_digest":"sha256:14a0d3bd78dcb5d23ddd75c39ac082440e68d50cba0c4bc7ef1655e110faa8c5","observation_id":"2060e0f0-eac7-4feb-8601-e3fd5afc0c19","resolution":{"observed_at":"2026-05-16T17:48:11.566186Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18530","last_updated":"2024-02-28T18:08:52Z","snapshot_observed_at":"2026-08-10T10:12:42.165054Z","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":"2402.18530","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.18530","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ramezani, S","venue":null,"work_id":"fed598de-0f4a-4463-b2e4-7ae037fc6212","year":2024},"citing_paper":{"arxiv_id":"2605.00739","last_updated":"2026-05-01T15:40:06Z","snapshot_observed_at":"2026-07-06T23:14:06.327027Z","submitted_at":"2026-05-01T15:40:06Z","title":"A Resource-Efficient Variational Quantum Framework for the Traveling Salesman Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-09T19:48:25.457703Z"},"links":{"cited_paper":"/paper/2402.18530","citing_paper":"/paper/2605.00739"},"observation_digest":"sha256:a87b7754ef2670de2addb13ad3a62c40d86433ad0a277a434835d92d3c2e1ae3","observation_id":"f2976a68-75e4-4596-b8cd-e4c5a84e6e95","resolution":{"observed_at":"2026-05-11T15:31:10.585264Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.18530/citation-record","integrity":"/paper/2402.18530/integrity","json":"/paper/2402.18530/citation-record.json","paper":"/paper/2402.18530"},"outbound":[],"paper":{"arxiv_id":"2402.18530","last_updated":"2024-02-28T18:08:52Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T10:12:42.165054Z","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2402.18530."}