{"as_of":"2026-08-13T06:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77d583ac74f1034d4262928a98d75fbeeb1364b29370970ae57dc53247aac7ce","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-13T06:32:02.005865+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-12T16:36:50.347624Z","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:36:50.434652Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.14605","last_updated":"2024-03-21T17:54:56Z","snapshot_observed_at":"2026-08-13T00:48:27.378366Z","submitted_at":"2024-03-21T17:54:56Z","title":"SDP Synthesis of Maximum Coverage Trees for Probabilistic Planning under Control Constraints","version":1},"cited_work":{"arxiv_id":"2403.14605","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.14605","snapshot_observed_at":"2026-08-12T16:36:50.434652Z","title":"SDP Synthesis of Maximum Coverage Trees for Probabilistic Planning under Control Constraints","venue":"cs.RO","work_id":"21298d72-b600-4f5f-9551-297589dbd909","year":2024},"citing_paper":{"arxiv_id":"2411.13369","last_updated":"2024-11-20T14:51:19Z","snapshot_observed_at":"2026-08-12T16:27:30.139414Z","submitted_at":"2024-11-20T14:51:19Z","title":"REVISE: Robust Probabilistic Motion Planning in a Gaussian Random Field","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T16:36:50.347624Z"},"links":{"cited_paper":"/paper/2403.14605","citing_paper":"/paper/2411.13369"},"observation_digest":"sha256:a81fc1f56409a075631f24c18dda84601aa455878b4306c4fd5810840eb679ae","observation_id":"02e383ec-9175-49e0-a290-c21bbc952a43","resolution":{"observed_at":"2026-08-12T16:36:50.441432Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.14605/citation-record","integrity":"/paper/2403.14605/integrity","json":"/paper/2403.14605/citation-record.json","paper":"/paper/2403.14605"},"outbound":[],"paper":{"arxiv_id":"2403.14605","last_updated":"2024-03-21T17:54:56Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-13T00:48:27.378366Z","submitted_at":"2024-03-21T17:54:56Z","title":"SDP Synthesis of Maximum Coverage Trees for Probabilistic Planning under Control Constraints"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.14605."}