{"as_of":"2026-08-08T17:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5502841a6a43e2b7079447fcfba0f98e6ab62b0bf7b52e3df1d625f85076155f","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:58:00.090790Z","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-07T12:58:02.896442Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.05318","last_updated":"2024-03-08T13:49:21Z","snapshot_observed_at":"2026-07-06T17:41:34.856417Z","submitted_at":"2024-03-08T13:49:21Z","title":"Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem","version":1},"cited_work":{"arxiv_id":"2403.05318","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.05318","snapshot_observed_at":"2026-08-07T12:58:02.896442Z","title":"Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem","venue":"cs.AI","work_id":"21804ffa-ee04-4c8e-84e0-e75432e58849","year":2024},"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":2024,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.090790Z"},"links":{"cited_paper":"/paper/2403.05318","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:aea28a2fe50c4897109a8dc6d58fb5ad5f0d3d714b69759ed35bd0121c18d5f3","observation_id":"9adffc31-f96f-4f76-82df-dc186eb2c9bc","resolution":{"observed_at":"2026-08-07T12:58:02.964731Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.05318/citation-record","integrity":"/paper/2403.05318/integrity","json":"/paper/2403.05318/citation-record.json","paper":"/paper/2403.05318"},"outbound":[],"paper":{"arxiv_id":"2403.05318","last_updated":"2024-03-08T13:49:21Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T17:41:34.856417Z","submitted_at":"2024-03-08T13:49:21Z","title":"Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.05318."}