{"as_of":"2026-08-10T09:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5d81d1f542977ab5551ec540a547f7835a591c32ff662c786131b9cd032b591","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T09:36:04.063711Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2601.13465/citation-record","integrity":"/paper/2601.13465/integrity","json":"/paper/2601.13465/citation-record.json","paper":"/paper/2601.13465"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.08475","last_updated":"2019-02-07T09:10:08Z","snapshot_observed_at":"2026-07-06T06:29:42.428021Z","submitted_at":"2018-03-22T17:22:24Z","title":"Attention, Learn to Solve Routing Problems!","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.08475","snapshot_observed_at":"2026-08-03T09:36:03.751355Z","title":"Attention, learn to solve routing problems!arXiv preprint arXiv:1803.08475,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.13465","last_updated":"2026-07-03T21:44:01Z","snapshot_observed_at":"2026-08-07T00:53:06.276907Z","submitted_at":"2026-01-19T23:40:08Z","title":"Graph Neural Networks are Heuristics","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T09:36:03.751355Z"},"links":{"cited_paper":"/paper/1803.08475","citing_paper":"/paper/2601.13465"},"observation_digest":"sha256:e7a2065141535ba387b4ccc78157078b721b7cc60bb43cc0dc8b9bace9f734b9","observation_id":"df6ebab7-dbb9-452e-bc27-ac281c5328ae","resolution":{"observed_at":"2026-08-03T09:36:03.751355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.08665","last_updated":"2018-02-23T18:15:13Z","snapshot_observed_at":"2026-07-06T06:25:04.506480Z","submitted_at":"2018-02-23T18:15:13Z","title":"Learning Latent Permutations with Gumbel-Sinkhorn Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.08665","snapshot_observed_at":"2026-08-03T09:36:03.849990Z","title":"Learning latent permutations with gumbel-sinkhorn networks.arXiv preprint arXiv:1802.08665,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.13465","last_updated":"2026-07-03T21:44:01Z","snapshot_observed_at":"2026-08-07T00:53:06.276907Z","submitted_at":"2026-01-19T23:40:08Z","title":"Graph Neural Networks are Heuristics","version":4},"reference_index":1973,"source":"pdf_text","source_observed_at":"2026-08-03T09:36:03.849990Z"},"links":{"cited_paper":"/paper/1802.08665","citing_paper":"/paper/2601.13465"},"observation_digest":"sha256:b8307dfb038dc6bd8c9c6137f694b44adb4785f9c304a0c9243a48dca178101e","observation_id":"58e322ff-bd14-4cb7-8c56-0ee1e221b7da","resolution":{"observed_at":"2026-08-03T09:36:03.849990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:36:03.520758Z","title":"Learning heuristics for the tsp by policy gradient","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.13465","last_updated":"2026-07-03T21:44:01Z","snapshot_observed_at":"2026-08-07T00:53:06.276907Z","submitted_at":"2026-01-19T23:40:08Z","title":"Graph Neural Networks are Heuristics","version":4},"reference_index":1976,"source":"pdf_text","source_observed_at":"2026-08-03T09:36:03.520758Z"},"links":{"citing_paper":"/paper/2601.13465"},"observation_digest":"sha256:b4cf5629f8d1042896ee196d5e9a0dcc1e32bcea48cfbe00c529715e72de79a4","observation_id":"37d99fab-e851-42d4-b212-28d250b4a7e6","resolution":{"observed_at":"2026-08-03T09:36:03.520758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01227","last_updated":"2019-10-14T11:31:45Z","snapshot_observed_at":"2026-08-06T10:54:26.264740Z","submitted_at":"2019-06-04T06:51:45Z","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-03T09:36:03.629370Z","title":"An efficient graph convolutional network technique for the travelling salesman problem.arXiv preprint arXiv:1906.01227,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2601.13465","last_updated":"2026-07-03T21:44:01Z","snapshot_observed_at":"2026-08-07T00:53:06.276907Z","submitted_at":"2026-01-19T23:40:08Z","title":"Graph Neural Networks are Heuristics","version":4},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-03T09:36:03.629370Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2601.13465"},"observation_digest":"sha256:efb685ef0bb3e7d2d066b87468fdb29493fdd697666bbba9d48773f20adb45fe","observation_id":"29c2dc76-11e2-4ff7-9232-373776a2df18","resolution":{"observed_at":"2026-08-03T09:36:03.629370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:36:03.940578Z","title":"Unsupervised learning permutations for tsp using gumbel-sinkhorn operator","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.13465","last_updated":"2026-07-03T21:44:01Z","snapshot_observed_at":"2026-08-07T00:53:06.276907Z","submitted_at":"2026-01-19T23:40:08Z","title":"Graph Neural Networks are Heuristics","version":4},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-03T09:36:03.940578Z"},"links":{"citing_paper":"/paper/2601.13465"},"observation_digest":"sha256:41fadb2bf653f73515a0b7ddb38d7bd45804ef68ce851f4d0e9b52b573e3263c","observation_id":"b2d5b508-5c71-47cf-82e1-b4e430be2d7a","resolution":{"observed_at":"2026-08-03T09:36:03.940578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:36:04.063711Z","title":"Structure as search: Unsupervised permutation learning for com- binatorial optimization.arXiv preprint arXiv:2507.04164,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.13465","last_updated":"2026-07-03T21:44:01Z","snapshot_observed_at":"2026-08-07T00:53:06.276907Z","submitted_at":"2026-01-19T23:40:08Z","title":"Graph Neural Networks are Heuristics","version":4},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T09:36:04.063711Z"},"links":{"citing_paper":"/paper/2601.13465"},"observation_digest":"sha256:66c9e3eb353bcc8f3890a8a0ba71578aae492e0d6ca26cbab85c98e9002d6da1","observation_id":"8c2f9d5e-5ad5-4ae8-80e3-ff0cad306fc3","resolution":{"observed_at":"2026-08-03T09:36:04.063711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.13465","last_updated":"2026-07-03T21:44:01Z","latest_version":4,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T00:53:06.276907Z","submitted_at":"2026-01-19T23:40:08Z","title":"Graph Neural Networks are Heuristics"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":6},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2601.13465."}