{"as_of":"2026-08-10T08:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7e248caedb521f84f80c59b11a4bb540e642951714433fe3d4d212fdb9cae61","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.649359Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":9,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"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":"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-04T00:13:36.786702Z","title":null,"venue":null,"work_id":null,"year":2022},"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":91,"source":"pdf_text","source_observed_at":"2026-08-04T00:13:36.786702Z"},"links":{"cited_paper":"/paper/2212.02735","citing_paper":"/paper/2511.02696"},"observation_digest":"sha256:275c16b3fa0ef889d74534cbf5dd9866ff1d1bcac8c390fc99522ce0dfba908f","observation_id":"428ad41e-c5f5-4528-9c63-2a18c41e1ff5","resolution":{"observed_at":"2026-08-04T00:13:36.786702Z","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":"2212.02735","doi":"10.48550/arxiv.2212.02735","metadata_source":"arxiv_reference","pith_arxiv_id":"2212.02735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"https://doi.org/10.48550/arXiv.2212.02735","venue":"arXiv (Cornell University)","work_id":"5e83926a-05da-40c4-96b8-7746cafd70c8","year":2022},"citing_paper":{"arxiv_id":"2605.18393","last_updated":"2026-05-18T13:40:44Z","snapshot_observed_at":"2026-08-02T16:19:01.663620Z","submitted_at":"2026-05-18T13:40:44Z","title":"Quantum Model for CVRPTW","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-20T09:02:16.910923Z"},"links":{"cited_paper":"/paper/2212.02735","citing_paper":"/paper/2605.18393"},"observation_digest":"sha256:7b7286057bd3ef8a869fe43fb07934889c47480be01569021a45573c6d09b67d","observation_id":"4c2a76a5-9e3d-4546-a1c0-2298921c6650","resolution":{"observed_at":"2026-05-20T09:03:09.218377Z","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":"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":"2212.02735","doi":"10.48550/arxiv.2212.02735","metadata_source":"arxiv_reference","pith_arxiv_id":"2212.02735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"https://doi.org/10.48550/arXiv.2212.02735","venue":"arXiv (Cornell University)","work_id":"5e83926a-05da-40c4-96b8-7746cafd70c8","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":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T21:53:02.291743Z"},"links":{"cited_paper":"/paper/2212.02735","citing_paper":"/paper/2606.07322"},"observation_digest":"sha256:d0ed26a9c128ab8eec43b51d015616c4a06869a31687c97486eaa6f016990f8d","observation_id":"ee117e50-4f52-44a0-b9e7-977743abeba4","resolution":{"observed_at":"2026-07-02T17:47:17.930809Z","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":"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-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:310877e35f9edc7d8b4a2605c8a2977f9a363aeb7b4c726c370718cfd41b9201","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"}}],"links":{"evidence":"/evidence","html":"/paper/2212.02735/citation-record","integrity":"/paper/2212.02735/integrity","json":"/paper/2212.02735/citation-record.json","paper":"/paper/2212.02735"},"outbound":[],"paper":{"arxiv_id":"2212.02735","last_updated":"2022-12-06T03:54:07Z","latest_version":1,"primary_category":"quant-ph","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"},"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:2212.02735."}