{"as_of":"2026-08-08T03:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f3042c7b1e0f66b1aa1a3507583d6c4df4120280218a756deb0e4257d4d675e","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-07T06:34:17.273281+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-07T12:58:00.387265Z","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-06T20:20:48.233889Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.08539","last_updated":"2020-02-20T02:39:02Z","snapshot_observed_at":"2026-07-06T08:58:39.542748Z","submitted_at":"2020-02-20T02:39:02Z","title":"Learn to Design the Heuristics for Vehicle Routing Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08539","snapshot_observed_at":"2026-08-07T12:58:00.387265Z","title":"arXiv preprint arXiv:2002.08539","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.387265Z"},"links":{"cited_paper":"/paper/2002.08539","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:5f1b2d71fc92cae4c6ea3dc1fdf1387ca0c415f6be4a4039218f4a6c06c3c655","observation_id":"fbae45de-61c1-4d54-b924-afec817a0659","resolution":{"observed_at":"2026-08-07T12:58:00.387265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08539","last_updated":"2020-02-20T02:39:02Z","snapshot_observed_at":"2026-07-06T08:58:39.542748Z","submitted_at":"2020-02-20T02:39:02Z","title":"Learn to Design the Heuristics for Vehicle Routing Problem","version":1},"cited_work":{"arxiv_id":"2002.08539","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.08539","snapshot_observed_at":"2026-08-06T20:20:48.233889Z","title":"Learn to Design the Heuristics for Vehicle Routing Problem","venue":"cs.NE","work_id":"df5e0872-5e44-41d3-8105-28f6735584c9","year":2020},"citing_paper":{"arxiv_id":"2507.03300","last_updated":"2025-07-04T05:10:20Z","snapshot_observed_at":"2026-08-07T12:31:10.910713Z","submitted_at":"2025-07-04T05:10:20Z","title":"LRM-1B: Towards Large Routing Model","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:20:42.568961Z"},"links":{"cited_paper":"/paper/2002.08539","citing_paper":"/paper/2507.03300"},"observation_digest":"sha256:9a937eda54b789f1e863821a4267dd6fb50a22c9dbe2bf29702a4d2c5fd04bee","observation_id":"baed7630-f33b-4232-8c02-c391425b8961","resolution":{"observed_at":"2026-08-06T20:20:48.277923Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2002.08539/citation-record","integrity":"/paper/2002.08539/integrity","json":"/paper/2002.08539/citation-record.json","paper":"/paper/2002.08539"},"outbound":[],"paper":{"arxiv_id":"2002.08539","last_updated":"2020-02-20T02:39:02Z","latest_version":1,"primary_category":"cs.NE","snapshot_observed_at":"2026-07-06T08:58:39.542748Z","submitted_at":"2020-02-20T02:39:02Z","title":"Learn to Design the Heuristics for Vehicle Routing 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2002.08539."}