{"as_of":"2026-08-08T03:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdd01f1990933c31e332b577090320a413a825c1cbcbc7251105eb6f3ad1fbf5","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:58:00.239450Z","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-05T05:42:53.298118Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.09100","last_updated":"2020-06-16T12:08:10Z","snapshot_observed_at":"2026-08-05T03:29:01.983924Z","submitted_at":"2020-06-16T12:08:10Z","title":"Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.09100","snapshot_observed_at":"2026-08-07T12:58:00.239450Z","title":"arXiv preprint arXiv:2006.09100","venue":null,"work_id":null,"year":2006},"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":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.239450Z"},"links":{"cited_paper":"/paper/2006.09100","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:95f394d0391159842278bf92d08408b74ff79ad644dfc45357093b3d83e5ecba","observation_id":"9b6cc037-3ddd-4e2b-9fc4-281fd7075275","resolution":{"observed_at":"2026-08-07T12:58:00.239450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09100","last_updated":"2020-06-16T12:08:10Z","snapshot_observed_at":"2026-08-05T03:29:01.983924Z","submitted_at":"2020-06-16T12:08:10Z","title":"Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention","version":1},"cited_work":{"arxiv_id":"2006.09100","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.09100","snapshot_observed_at":"2026-08-05T05:42:53.298118Z","title":"Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention","venue":"cs.LG","work_id":"04f8cad7-4f88-4ebc-9138-76e351c8a9b8","year":2020},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-05T05:42:48.928201Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.114995Z"},"links":{"cited_paper":"/paper/2006.09100","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:bcf4abd697317d79845848c5e19e0952b8f0a645288348b5d2498fd84257f772","observation_id":"1d643fd6-af5f-477c-b7ee-2292b59103ed","resolution":{"observed_at":"2026-08-05T05:42:53.303649Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09100","last_updated":"2020-06-16T12:08:10Z","snapshot_observed_at":"2026-08-05T03:29:01.983924Z","submitted_at":"2020-06-16T12:08:10Z","title":"Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.09100","snapshot_observed_at":"2026-08-01T17:18:09.121874Z","title":"Falkner and Lars Schmidt-Thieme","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:09.121874Z"},"links":{"cited_paper":"/paper/2006.09100","citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:d3e2c8d4c26b9d78aee0aaefda79fd7ea917ee5b4e6fcd983ebdd170c444ee80","observation_id":"41d0f356-214f-4d41-a161-f9fc718f41e3","resolution":{"observed_at":"2026-08-01T17:18:09.121874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2006.09100/citation-record","integrity":"/paper/2006.09100/integrity","json":"/paper/2006.09100/citation-record.json","paper":"/paper/2006.09100"},"outbound":[],"paper":{"arxiv_id":"2006.09100","last_updated":"2020-06-16T12:08:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T03:29:01.983924Z","submitted_at":"2020-06-16T12:08:10Z","title":"Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention"},"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 3 inbound Pith citation observations for arXiv:2006.09100."}