{"as_of":"2026-08-09T20:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce033566761097d1b97f9b20ac7497850b1b815b485593b601e6d1892db6f019","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-09T06:31:02.800959+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-06T17:30:48.397173Z","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-06T17:30:50.184455Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.04917","last_updated":"2025-01-13T20:28:04Z","snapshot_observed_at":"2026-07-06T17:41:19.171822Z","submitted_at":"2024-03-07T22:03:36Z","title":"A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets","version":3},"cited_work":{"arxiv_id":"2403.04917","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.04917","snapshot_observed_at":"2026-08-06T17:30:50.184455Z","title":"A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets","venue":"cs.RO","work_id":"015e6031-3e45-419f-8d96-09eb321bea68","year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:48.397173Z"},"links":{"cited_paper":"/paper/2403.04917","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:9fdd669f82cce9cdf962303cae17bab4ea481d9b7d48776bafa718277a53b473","observation_id":"0bceb8b5-d3e6-4053-b911-f302c00e9b27","resolution":{"observed_at":"2026-08-06T17:30:50.264462Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.04917/citation-record","integrity":"/paper/2403.04917/integrity","json":"/paper/2403.04917/citation-record.json","paper":"/paper/2403.04917"},"outbound":[],"paper":{"arxiv_id":"2403.04917","last_updated":"2025-01-13T20:28:04Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-07-06T17:41:19.171822Z","submitted_at":"2024-03-07T22:03:36Z","title":"A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.04917."}