{"as_of":"2026-08-10T19:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:506a7a7849f9a8f211b473027f82fff61966e673a2d5d5053f4ba51b2af2c364","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-07T23:38:11.654060Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T23:38:12.019159Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.07129","last_updated":"2025-03-12T03:38:33Z","snapshot_observed_at":"2026-08-10T13:48:21.824752Z","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:86b2248121736ded7601234e4ca68718294b23d25877ab0d76e96c5039ee0e33","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-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/2405.07129/citation-record","integrity":"/paper/2405.07129/integrity","json":"/paper/2405.07129/citation-record.json","paper":"/paper/2405.07129"},"outbound":[],"paper":{"arxiv_id":"2405.07129","last_updated":"2025-03-12T03:38:33Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T13:48:21.824752Z","submitted_at":"2024-05-12T01:44:19Z","title":"Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems"},"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 1 inbound Pith citation observation for arXiv:2405.07129."}