{"as_of":"2026-08-10T18:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:83a70d1e8743d1aeda8ff98269256a37dfea9017f3bcff37b02785496cf8ca0d","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:38:11.639995Z","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-06-30T06:24:19.246959Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.13616","last_updated":"2024-07-18T15:55:01Z","snapshot_observed_at":"2026-08-10T17:53:39.065278Z","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:031558eb5c4c22ab2442bbeee15508c088a858cb80122b68018701043c894e6b","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":"2407.13616","last_updated":"2024-07-18T15:55:01Z","snapshot_observed_at":"2026-08-10T17:53:39.065278Z","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":"2407.13616","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.13616","snapshot_observed_at":"2026-06-30T06:24:19.246959Z","title":"://arxiv.org/abs/2407.13616","venue":null,"work_id":"d1133086-46c9-40e3-96c0-c5beb3623240","year":2024},"citing_paper":{"arxiv_id":"2606.30415","last_updated":"2026-06-29T15:01:18Z","snapshot_observed_at":"2026-08-01T15:56:02.188610Z","submitted_at":"2026-06-29T15:01:18Z","title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-06-30T06:20:32.505136Z"},"links":{"cited_paper":"/paper/2407.13616","citing_paper":"/paper/2606.30415"},"observation_digest":"sha256:68ba99b154e78e8ececb9524533f881fee915c9193a9eeb7cae0817e88e7c1b6","observation_id":"7b3831b1-c1ac-49ff-94e0-4b4f71cb3a1f","resolution":{"observed_at":"2026-06-30T06:24:19.248245Z","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/2407.13616/citation-record","integrity":"/paper/2407.13616/integrity","json":"/paper/2407.13616/citation-record.json","paper":"/paper/2407.13616"},"outbound":[],"paper":{"arxiv_id":"2407.13616","last_updated":"2024-07-18T15:55:01Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T17:53:39.065278Z","submitted_at":"2024-07-18T15:55:01Z","title":"Quantum Local Search for Traveling Salesman Problem with Path-Slicing Strategy"},"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 2 inbound Pith citation observations for arXiv:2407.13616."}