{"as_of":"2026-08-09T16:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2fd40901528bd6fca23e3578cd46cc72ff3cf8e9684600e19a63c4857b8bf1e6","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T10:38:06.308028Z","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-11T13:41:09.241745Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.05291","last_updated":"2022-04-04T23:11:00Z","snapshot_observed_at":"2026-07-06T11:56:34.288687Z","submitted_at":"2021-10-11T14:06:08Z","title":"Graph Neural Network Guided Local Search for the Traveling Salesperson Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.05291","snapshot_observed_at":"2026-08-09T10:38:06.308028Z","title":"Graph neural network guided local search for the traveling salesperson problem,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02941","last_updated":"2025-02-05T07:13:43Z","snapshot_observed_at":"2026-08-09T10:29:09.464837Z","submitted_at":"2025-02-05T07:13:43Z","title":"Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T10:38:06.308028Z"},"links":{"cited_paper":"/paper/2110.05291","citing_paper":"/paper/2502.02941"},"observation_digest":"sha256:8b690ccd95673db3ea9b2605eeb96507e2f6de3689c86ffc48edbb3e4c97ee45","observation_id":"afb11de6-2103-4554-9da6-4e0959008b48","resolution":{"observed_at":"2026-08-09T10:38:06.308028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.05291","last_updated":"2022-04-04T23:11:00Z","snapshot_observed_at":"2026-07-06T11:56:34.288687Z","submitted_at":"2021-10-11T14:06:08Z","title":"Graph Neural Network Guided Local Search for the Traveling Salesperson Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.05291","snapshot_observed_at":"2026-08-04T23:25:53.510824Z","title":"arXiv preprint arXiv:2110.05291 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.06640","last_updated":"2025-09-08T12:56:42Z","snapshot_observed_at":"2026-08-08T10:02:18.876467Z","submitted_at":"2025-09-08T12:56:42Z","title":"Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:53.510824Z"},"links":{"cited_paper":"/paper/2110.05291","citing_paper":"/paper/2509.06640"},"observation_digest":"sha256:8de5ecb692dc20d5d04764672b3a70bd6eb457d45688402faf0b6e84fdea4677","observation_id":"c50aa980-7938-4016-ad6f-68882535f5f2","resolution":{"observed_at":"2026-08-04T23:25:53.510824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.05291","last_updated":"2022-04-04T23:11:00Z","snapshot_observed_at":"2026-07-06T11:56:34.288687Z","submitted_at":"2021-10-11T14:06:08Z","title":"Graph Neural Network Guided Local Search for the Traveling Salesperson Problem","version":3},"cited_work":{"arxiv_id":"2110.05291","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.05291","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"59307887-e79d-46ba-ad8f-3678f55d948e","year":2022},"citing_paper":{"arxiv_id":"2604.20236","last_updated":"2026-06-11T14:50:16Z","snapshot_observed_at":"2026-08-03T02:41:15.764656Z","submitted_at":"2026-04-22T06:40:05Z","title":"Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T01:12:53.472283Z"},"links":{"cited_paper":"/paper/2110.05291","citing_paper":"/paper/2604.20236"},"observation_digest":"sha256:ff5d735bc8a9e59d257c7d41e9b44ef5355eec75548ec02c475541b37ba69f67","observation_id":"a5444d23-8ae6-4cee-bb6b-79d4fee15c9d","resolution":{"observed_at":"2026-05-11T13:41:09.246975Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.05291","last_updated":"2022-04-04T23:11:00Z","snapshot_observed_at":"2026-07-06T11:56:34.288687Z","submitted_at":"2021-10-11T14:06:08Z","title":"Graph Neural Network Guided Local Search for the Traveling Salesperson Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.05291","snapshot_observed_at":"2026-08-01T14:53:45.283790Z","title":"arXiv preprint arXiv:2110.05291 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.283790Z"},"links":{"cited_paper":"/paper/2110.05291","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:c61f18714fe1a2873f722a19cb7e7dad66631274b2e7432593a7af83e4f199b4","observation_id":"d3beaf76-73ab-4c1e-838d-c732b674f6fb","resolution":{"observed_at":"2026-08-01T14:53:45.283790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2110.05291/citation-record","integrity":"/paper/2110.05291/integrity","json":"/paper/2110.05291/citation-record.json","paper":"/paper/2110.05291"},"outbound":[],"paper":{"arxiv_id":"2110.05291","last_updated":"2022-04-04T23:11:00Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:56:34.288687Z","submitted_at":"2021-10-11T14:06:08Z","title":"Graph Neural Network Guided Local Search for the Traveling Salesperson Problem"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2110.05291."}