{"as_of":"2026-08-08T11:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f937bc5c294fb8fd3c2d0dfb03bc8eb6269ff61936e21bb8a520bd6de1f371dd","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-08T06:32:00.761636+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-06T11:56:09.076671Z","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-12T08:31:25.825030Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.03012","last_updated":"2021-03-04T13:20:06Z","snapshot_observed_at":"2026-08-03T15:45:10.389083Z","submitted_at":"2021-03-04T13:20:06Z","title":"The Transformer Network for the Traveling Salesman Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03012","snapshot_observed_at":"2026-08-06T11:56:09.076671Z","title":"InProceedings of the 26th An- nual International Conference on Machine Learning, ICML ’09, 41–48","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.22338","last_updated":"2025-07-30T02:46:45Z","snapshot_observed_at":"2026-08-07T14:09:21.903509Z","submitted_at":"2025-07-30T02:46:45Z","title":"Parametrized Multi-Agent Routing via Deep Attention Models","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-06T11:56:09.076671Z"},"links":{"cited_paper":"/paper/2103.03012","citing_paper":"/paper/2507.22338"},"observation_digest":"sha256:bc54dfa29ebbce07eb6dd31c3f402a1636bfd185e86895e8dcf170c5bbd86bda","observation_id":"7dd7d721-b344-4dcc-8e95-e1013fcc2e48","resolution":{"observed_at":"2026-08-06T11:56:09.076671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03012","last_updated":"2021-03-04T13:20:06Z","snapshot_observed_at":"2026-08-03T15:45:10.389083Z","submitted_at":"2021-03-04T13:20:06Z","title":"The Transformer Network for the Traveling Salesman Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03012","snapshot_observed_at":"2026-08-04T14:42:33.129948Z","title":"Xavier Bresson and Thomas Laurent","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.24256","last_updated":"2026-07-13T05:58:29Z","snapshot_observed_at":"2026-08-07T23:51:39.339618Z","submitted_at":"2025-09-29T04:05:48Z","title":"Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm","version":2},"reference_index":1985,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:33.129948Z"},"links":{"cited_paper":"/paper/2103.03012","citing_paper":"/paper/2509.24256"},"observation_digest":"sha256:a7c2e361c9a65bbb4031df6a7604521a72829fc3722de509ea97c891caa85a3b","observation_id":"c5f1813b-f17b-4b93-8955-0c1be04290be","resolution":{"observed_at":"2026-08-04T14:42:33.129948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03012","last_updated":"2021-03-04T13:20:06Z","snapshot_observed_at":"2026-08-03T15:45:10.389083Z","submitted_at":"2021-03-04T13:20:06Z","title":"The Transformer Network for the Traveling Salesman Problem","version":1},"cited_work":{"arxiv_id":"2103.03012","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.03012","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2103.03012 , year =","venue":null,"work_id":"557c23f6-4999-441d-bfa4-880c4979ede1","year":null},"citing_paper":{"arxiv_id":"2605.08758","last_updated":"2026-05-09T07:40:35Z","snapshot_observed_at":"2026-07-06T23:20:57.084438Z","submitted_at":"2026-05-09T07:40:35Z","title":"Omni-scale Learning-based Sequential Decision Framework for Order Fulfillment of Tote-handling Robotic Systems","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-05-12T01:00:39.290029Z"},"links":{"cited_paper":"/paper/2103.03012","citing_paper":"/paper/2605.08758"},"observation_digest":"sha256:ebe2dfdd9ea9c314708017313f342a78c316417ee5ed4197cc06076f022becc4","observation_id":"35a0445b-784a-4ee0-a444-2bc4270aef56","resolution":{"observed_at":"2026-05-12T08:31:25.828078Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03012","last_updated":"2021-03-04T13:20:06Z","snapshot_observed_at":"2026-08-03T15:45:10.389083Z","submitted_at":"2021-03-04T13:20:06Z","title":"The Transformer Network for the Traveling Salesman Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03012","snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"The transformer network for the traveling salesman problem.arXiv preprint arXiv:2103.03012, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"cited_paper":"/paper/2103.03012","citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:b76d8b42f934b38e5f443975cd28d3e81301967958499ebcd43e12ff46b3f3ad","observation_id":"42886456-e8a9-4586-b665-da76cf0bb057","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2103.03012/citation-record","integrity":"/paper/2103.03012/integrity","json":"/paper/2103.03012/citation-record.json","paper":"/paper/2103.03012"},"outbound":[],"paper":{"arxiv_id":"2103.03012","last_updated":"2021-03-04T13:20:06Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T15:45:10.389083Z","submitted_at":"2021-03-04T13:20:06Z","title":"The Transformer Network for the Traveling Salesman 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-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 4 inbound Pith citation observations for arXiv:2103.03012."}