{"as_of":"2026-08-08T07:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4399b48ec7272b1e288d8405739b1a5e2902b3bf66ffb50bd0345fc8954fcce5","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-08T06:32:00.761636+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-07T14:37:14.589364Z","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-11T21:46:48.677661Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.14352","last_updated":"2022-05-28T06:35:40Z","snapshot_observed_at":"2026-07-06T13:14:55.899731Z","submitted_at":"2022-05-28T06:35:40Z","title":"Travelling Salesman Problem: Parallel Implementations & Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14352","snapshot_observed_at":"2026-08-07T14:37:14.589364Z","title":"Gohil, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.589364Z"},"links":{"cited_paper":"/paper/2205.14352","citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:4a593347359dd1704619418cc95bb8c248c3d97cb992a60f76359ce295a6e7f9","observation_id":"5ee4aa49-19b3-42f4-a642-c9e927e600d9","resolution":{"observed_at":"2026-08-07T14:37:14.589364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14352","last_updated":"2022-05-28T06:35:40Z","snapshot_observed_at":"2026-07-06T13:14:55.899731Z","submitted_at":"2022-05-28T06:35:40Z","title":"Travelling Salesman Problem: Parallel Implementations & Analysis","version":1},"cited_work":{"arxiv_id":"2205.14352","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.14352","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"& Sawalpurkar, V","venue":null,"work_id":"6f58bfde-9fcd-4434-9cc5-806b9efc564e","year":2022},"citing_paper":{"arxiv_id":"2605.06037","last_updated":"2026-05-07T11:26:07Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T11:26:07Z","title":"A virtually connected probabilistic computer as a solver for higher-order, densely connected, or reconfigurable combinatorial optimisation problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-08T04:18:29.464200Z"},"links":{"cited_paper":"/paper/2205.14352","citing_paper":"/paper/2605.06037"},"observation_digest":"sha256:b7159fb10a5bfabe21f1f33ad454dd2686f17125542c2abdb0973123f7e427cd","observation_id":"5939afa8-9120-4c7f-9aec-c77e05d361b3","resolution":{"observed_at":"2026-05-11T21:46:48.699794Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.14352/citation-record","integrity":"/paper/2205.14352/integrity","json":"/paper/2205.14352/citation-record.json","paper":"/paper/2205.14352"},"outbound":[],"paper":{"arxiv_id":"2205.14352","last_updated":"2022-05-28T06:35:40Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T13:14:55.899731Z","submitted_at":"2022-05-28T06:35:40Z","title":"Travelling Salesman Problem: Parallel Implementations & Analysis"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2205.14352."}