{"as_of":"2026-08-17T18:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d288d43a3db812e45b2d4b8f657a90188a3e6ef481bdf9308fd16ed864428bc4","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-17T06:30:58.91139+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-10T22:08:03.525443Z","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-10T15:42:05.502718Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.00560","last_updated":"2024-10-16T06:24:13Z","snapshot_observed_at":"2026-08-16T15:11:36.833052Z","submitted_at":"2023-08-01T14:00:31Z","title":"Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.00560","snapshot_observed_at":"2026-08-10T22:08:03.525443Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.02977","last_updated":"2025-02-04T09:21:37Z","snapshot_observed_at":"2026-08-16T10:08:48.783685Z","submitted_at":"2025-01-06T12:37:56Z","title":"CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T22:08:03.525443Z"},"links":{"cited_paper":"/paper/2308.00560","citing_paper":"/paper/2501.02977"},"observation_digest":"sha256:5529e78c8ac6b9016a97837618e520ba29c75e5300421f3f7e661491ba637451","observation_id":"6b3afdf5-1153-47d7-8dd1-c05e923e5c7f","resolution":{"observed_at":"2026-08-10T22:08:03.525443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.00560","last_updated":"2024-10-16T06:24:13Z","snapshot_observed_at":"2026-08-16T15:11:36.833052Z","submitted_at":"2023-08-01T14:00:31Z","title":"Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems","version":3},"cited_work":{"arxiv_id":"2308.00560","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.00560","snapshot_observed_at":"2026-08-10T15:42:05.502718Z","title":"Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems","venue":"cs.AI","work_id":"e79cca1a-191f-4f40-82ab-13cd1d818fd6","year":2023},"citing_paper":{"arxiv_id":"2501.13767","last_updated":"2025-01-23T15:47:04Z","snapshot_observed_at":"2026-08-13T12:12:13.049072Z","submitted_at":"2025-01-23T15:47:04Z","title":"An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T15:42:05.386981Z"},"links":{"cited_paper":"/paper/2308.00560","citing_paper":"/paper/2501.13767"},"observation_digest":"sha256:bb36dcc182b184422d73c560ebafa08033fa4ae2ab7b53b3e58513ef9b2d760a","observation_id":"15a0107f-dd9f-4283-96df-b500bff36371","resolution":{"observed_at":"2026-08-10T15:42:05.507947Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2308.00560/citation-record","integrity":"/paper/2308.00560/integrity","json":"/paper/2308.00560/citation-record.json","paper":"/paper/2308.00560"},"outbound":[],"paper":{"arxiv_id":"2308.00560","last_updated":"2024-10-16T06:24:13Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T15:11:36.833052Z","submitted_at":"2023-08-01T14:00:31Z","title":"Reinforcement Learning-based Non-Autoregressive Solver for 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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2308.00560."}