{"as_of":"2026-08-10T14:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c129159fe385c9541f2663f4452a22344f40e1ec99f87f6557f6dc2db045d041","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T17:59:33.189911Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"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/2604.06940/citation-record","integrity":"/paper/2604.06940/integrity","json":"/paper/2604.06940/citation-record.json","paper":"/paper/2604.06940"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neural large neighborhood search for the capacitated vehicle routing problem","venue":null,"work_id":"89140175-e269-4c4a-a880-60c27f84566a","year":2020},"citing_paper":{"arxiv_id":"2604.06940","last_updated":"2026-05-01T16:56:33Z","snapshot_observed_at":"2026-08-02T09:45:03.108944Z","submitted_at":"2026-04-08T11:04:45Z","title":"A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T17:59:33.189911Z"},"links":{"citing_paper":"/paper/2604.06940"},"observation_digest":"sha256:a8e7fd61b234768af3ae2d92118e4b75dc3339923b26381b9b7499ac882f8b52","observation_id":"28f22458-ff84-427c-a58c-e69ae749a38c","resolution":{"observed_at":"2026-05-17T07:49:15.791502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05126","last_updated":"2022-03-15T13:44:23Z","snapshot_observed_at":"2026-07-06T11:17:34.454271Z","submitted_at":"2021-06-09T15:08:03Z","title":"Efficient Active Search for Combinatorial Optimization Problems","version":3},"cited_work":{"arxiv_id":"2106.05126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.05126","snapshot_observed_at":"2026-07-01T20:46:13.596511Z","title":"arXiv preprint arXiv:2106.05126 , year=","venue":null,"work_id":"f87fbda8-de65-4716-941c-6f577d8842f8","year":2021},"citing_paper":{"arxiv_id":"2604.06940","last_updated":"2026-05-01T16:56:33Z","snapshot_observed_at":"2026-08-02T09:45:03.108944Z","submitted_at":"2026-04-08T11:04:45Z","title":"A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:59:33.189911Z"},"links":{"cited_paper":"/paper/2106.05126","citing_paper":"/paper/2604.06940"},"observation_digest":"sha256:6ce1e33c3b8b615e3a40375e36c1ed3b8bd74112fbd678c2643176ddf63bb693","observation_id":"e1931d87-0908-4934-9720-7de3606f31de","resolution":{"observed_at":"2026-05-11T05:41:01.255088Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.16428","last_updated":"2025-06-19T16:07:11Z","snapshot_observed_at":"2026-08-06T23:35:50.565956Z","submitted_at":"2025-06-19T16:07:11Z","title":"EFormer: An Effective Edge-based Transformer for Vehicle Routing Problems","version":1},"cited_work":{"arxiv_id":"2506.16428","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.16428","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Eformer: An effective edge-based transformer for vehicle routing problems.arXiv preprint arXiv:2506.16428","venue":null,"work_id":"ff3b2988-43f6-4085-998f-d17273151435","year":null},"citing_paper":{"arxiv_id":"2604.06940","last_updated":"2026-05-01T16:56:33Z","snapshot_observed_at":"2026-08-02T09:45:03.108944Z","submitted_at":"2026-04-08T11:04:45Z","title":"A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T17:59:33.189911Z"},"links":{"cited_paper":"/paper/2506.16428","citing_paper":"/paper/2604.06940"},"observation_digest":"sha256:4c3842fc9a0bf9c1475a2403ac868476f6aa809ab573ae8ca6e3def0ad711b82","observation_id":"65207f85-dc04-4465-86ba-007d00ea5670","resolution":{"observed_at":"2026-05-11T05:41:01.223064Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":"1707.06347","doi":"10.1016/j.artint.2010.12.005","metadata_source":"pith","pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proximal Policy Optimization Algorithms","venue":"cs.LG","work_id":"240c67fe-d14d-4520-91c1-38a4e272ca19","year":2017},"citing_paper":{"arxiv_id":"2604.06940","last_updated":"2026-05-01T16:56:33Z","snapshot_observed_at":"2026-08-02T09:45:03.108944Z","submitted_at":"2026-04-08T11:04:45Z","title":"A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:59:33.189911Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2604.06940"},"observation_digest":"sha256:1cef2f5d6d90dedd58134e2a00b7707c1da432d633fa2e2cad0e17ef2bc4ad1f","observation_id":"81689056-16b9-4e7c-91b9-9eed518c6263","resolution":{"observed_at":"2026-05-11T05:41:01.236425Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":"2402.03300","doi":"10.1016/0004-3702(73)90011-8","metadata_source":"pith","pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","venue":"cs.CL","work_id":"c5006563-f3ec-438a-9e35-b7b484f34828","year":2024},"citing_paper":{"arxiv_id":"2604.06940","last_updated":"2026-05-01T16:56:33Z","snapshot_observed_at":"2026-08-02T09:45:03.108944Z","submitted_at":"2026-04-08T11:04:45Z","title":"A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T17:59:33.189911Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2604.06940"},"observation_digest":"sha256:4f77fdf859c58f93b6f48a829378fd71613e88445c4bc618ff08c09a71ca4538","observation_id":"c5dec509-8ada-43a7-8521-ecff861cc237","resolution":{"observed_at":"2026-05-11T05:41:01.260575Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The sine terms correspond to the signed 2D cross product and therefore disambiguate left vs","venue":null,"work_id":"5410a9e1-d713-4ff6-83e4-053232441c04","year":2021},"citing_paper":{"arxiv_id":"2604.06940","last_updated":"2026-05-01T16:56:33Z","snapshot_observed_at":"2026-08-02T09:45:03.108944Z","submitted_at":"2026-04-08T11:04:45Z","title":"A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T17:59:33.189911Z"},"links":{"citing_paper":"/paper/2604.06940"},"observation_digest":"sha256:a1eed16f2f5caa5a3f4737e50e07c5cac666d4c24f15ecb6a0e087b680158a6d","observation_id":"49381f5f-2c3f-4412-a9f0-3e0d9aa2ec5c","resolution":{"observed_at":"2026-05-17T07:49:15.787989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1007.7420","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"It combines a factorized move parameterization with a recurrent dual-stream decoder, and further introduces guided exploration of both feasible and infeasible intermediate states","venue":null,"work_id":"34434541-3bd8-44e4-80cb-43891637090a","year":2020},"citing_paper":{"arxiv_id":"2604.06940","last_updated":"2026-05-01T16:56:33Z","snapshot_observed_at":"2026-08-02T09:45:03.108944Z","submitted_at":"2026-04-08T11:04:45Z","title":"A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T17:59:33.189911Z"},"links":{"citing_paper":"/paper/2604.06940"},"observation_digest":"sha256:928a94de7a19a9101104cd8cc39c993f01b8a847946e4560c6db4daa0474c196","observation_id":"69dff488-9f68-4f9d-9974-19d0f96cad48","resolution":{"observed_at":"2026-05-11T05:41:01.246235Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.06940","last_updated":"2026-05-01T16:56:33Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T09:45:03.108944Z","submitted_at":"2026-04-08T11:04:45Z","title":"A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":5,"verified_fuzzy":2},"total_outbound_references":7},"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 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:2604.06940."}