{"as_of":"2026-08-23T13:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ccefed0f4693a287afe0aaf15620385b23eed87dc2866f39a40fcf80f3d04e51","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-23T06:30:58.430688+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-05-10T01:12:53.472283Z","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":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15862","last_updated":"2025-06-05T06:16:06Z","snapshot_observed_at":"2026-08-07T21:42:31.420424Z","submitted_at":"2025-05-21T06:11:00Z","title":"Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems","version":2},"cited_work":{"arxiv_id":"2505.15862","doi":"10.48550/arxiv.2505.15862","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.15862","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ArXiv.org","work_id":"55800427-90c6-4ad6-8701-70995dba8ba1","year":2025},"citing_paper":{"arxiv_id":"2604.20236","last_updated":"2026-06-11T14:50:16Z","snapshot_observed_at":"2026-08-15T21:09:54.166710Z","submitted_at":"2026-04-22T06:40:05Z","title":"Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T01:12:53.472283Z"},"links":{"cited_paper":"/paper/2505.15862","citing_paper":"/paper/2604.20236"},"observation_digest":"sha256:8842053ac97534bc41b55770a67f90b38856d6b3f30179bb29b57f086ed55124","observation_id":"080f4ef1-c2f8-4cbc-baf0-3bc58c9d7258","resolution":{"observed_at":"2026-05-10T01:30:54.815935Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15862/citation-record","integrity":"/paper/2505.15862/integrity","json":"/paper/2505.15862/citation-record.json","paper":"/paper/2505.15862"},"outbound":[],"paper":{"arxiv_id":"2505.15862","last_updated":"2025-06-05T06:16:06Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T21:42:31.420424Z","submitted_at":"2025-05-21T06:11:00Z","title":"Bandit based Dynamic Candidate Edge Selection in 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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2505.15862."}