{"as_of":"2026-08-10T23:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:543fdc4781830fe6a3a2a6dde36f015f8edbffbaf1fb7e099542482ab8ebccc5","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:26:29.547583Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T11:15:06.940534Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.17272","last_updated":"2024-06-06T10:30:24Z","snapshot_observed_at":"2026-07-06T18:20:39.922334Z","submitted_at":"2024-05-27T15:33:16Z","title":"DPN: Decoupling Partition and Navigation for Neural Solvers of Min-max Vehicle Routing Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17272","snapshot_observed_at":"2026-08-10T20:26:29.547583Z","title":"Dpn: Decoupling partition and navigation for neural solvers of min-max vehicle routing problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-08-10T20:19:44.669457Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"reference_index":113,"source":"arxiv_source","source_observed_at":"2026-08-10T20:26:29.547583Z"},"links":{"cited_paper":"/paper/2405.17272","citing_paper":"/paper/2501.08603"},"observation_digest":"sha256:2d3bf23e90dd3eada738b41f3b92c627eed628e8733949656c7c389a81d633e9","observation_id":"fc2522d4-4e01-4304-b455-68ade435bfa0","resolution":{"observed_at":"2026-08-10T20:26:29.547583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17272","last_updated":"2024-06-06T10:30:24Z","snapshot_observed_at":"2026-07-06T18:20:39.922334Z","submitted_at":"2024-05-27T15:33:16Z","title":"DPN: Decoupling Partition and Navigation for Neural Solvers of Min-max Vehicle Routing Problems","version":2},"cited_work":{"arxiv_id":"2405.17272","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.17272","snapshot_observed_at":"2026-08-08T11:15:06.940534Z","title":"DPN: Decoupling Partition and Navigation for Neural Solvers of Min-max Vehicle Routing Problems","venue":"cs.LG","work_id":"1c20f837-de53-4733-8a15-34efadf70023","year":2024},"citing_paper":{"arxiv_id":"2608.05541","last_updated":"2026-08-06T02:39:10Z","snapshot_observed_at":"2026-08-10T14:10:02.620076Z","submitted_at":"2026-08-06T02:39:10Z","title":"Hyper-ES: Effective Evolution Strategies for LLM Reasoning via Descent Direction Merging","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T11:15:06.858653Z"},"links":{"cited_paper":"/paper/2405.17272","citing_paper":"/paper/2608.05541"},"observation_digest":"sha256:d5034cc843379ebd79fb40885aee7f0b119a6038257ad8b66bf3661b427fc68a","observation_id":"fe489ade-0ad4-4ec1-a618-a66a52ac2885","resolution":{"observed_at":"2026-08-08T11:15:06.948129Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2405.17272/citation-record","integrity":"/paper/2405.17272/integrity","json":"/paper/2405.17272/citation-record.json","paper":"/paper/2405.17272"},"outbound":[],"paper":{"arxiv_id":"2405.17272","last_updated":"2024-06-06T10:30:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:20:39.922334Z","submitted_at":"2024-05-27T15:33:16Z","title":"DPN: Decoupling Partition and Navigation for Neural Solvers of Min-max Vehicle Routing 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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2405.17272."}