{"as_of":"2026-08-13T05:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d397c49cb0b7d99c5568756d5bc5ac25b714d5ed019e76840459557af81f669","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-12T06:34:41.77262+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-12T16:27:11.902226Z","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-12T16:27:03.107375Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.01072","last_updated":"2024-01-02T21:52:11Z","snapshot_observed_at":"2026-08-13T04:08:18.746164Z","submitted_at":"2023-05-01T20:13:23Z","title":"Fast Path Planning Through Large Collections of Safe Boxes","version":2},"cited_work":{"arxiv_id":"2305.01072","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.01072","snapshot_observed_at":"2026-08-12T16:27:03.107375Z","title":"Fast Path Planning Through Large Collections of Safe Boxes","venue":"cs.RO","work_id":"be6babdf-2d24-45de-92c6-03734ee49b85","year":2023},"citing_paper":{"arxiv_id":"2411.13506","last_updated":"2024-11-20T17:56:56Z","snapshot_observed_at":"2026-08-12T16:17:37.459776Z","submitted_at":"2024-11-20T17:56:56Z","title":"Bezier Reachable Polytopes: Efficient Certificates for Robust Motion Planning with Layered Architectures","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:03.058848Z"},"links":{"cited_paper":"/paper/2305.01072","citing_paper":"/paper/2411.13506"},"observation_digest":"sha256:770a1745f618e8146e63d531b2d4195406ada9828bded0b616c03a023075035c","observation_id":"daf4cde0-3ac0-46e9-bf10-6038c59a6366","resolution":{"observed_at":"2026-08-12T16:27:03.114120Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.01072","last_updated":"2024-01-02T21:52:11Z","snapshot_observed_at":"2026-08-13T04:08:18.746164Z","submitted_at":"2023-05-01T20:13:23Z","title":"Fast Path Planning Through Large Collections of Safe Boxes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.01072","snapshot_observed_at":"2026-08-12T16:27:11.902226Z","title":"Fast Path Planning Through Large Collections of Safe Boxes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-12T16:17:35.829140Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.902226Z"},"links":{"cited_paper":"/paper/2305.01072","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:92d7ad4aff9ed0bbbbd1fa62962282dd39344fa97fa4af1ac9f617a11d4f7e77","observation_id":"bd31a90b-28c8-4204-8a03-be7b071f88e7","resolution":{"observed_at":"2026-08-12T16:27:11.902226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.01072/citation-record","integrity":"/paper/2305.01072/integrity","json":"/paper/2305.01072/citation-record.json","paper":"/paper/2305.01072"},"outbound":[],"paper":{"arxiv_id":"2305.01072","last_updated":"2024-01-02T21:52:11Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-13T04:08:18.746164Z","submitted_at":"2023-05-01T20:13:23Z","title":"Fast Path Planning Through Large Collections of Safe Boxes"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2305.01072."}