{"as_of":"2026-08-16T18:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f0749452d5a56383ef8ef9e00a9371bebda9b46166a48952702456f3478a1e5","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-16T06:30:59.297886+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-15T16:08:19.189657Z","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-15T16:08:19.392506Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.08334","last_updated":"2024-04-12T08:56:16Z","snapshot_observed_at":"2026-08-16T14:01:29.510434Z","submitted_at":"2024-04-12T08:56:16Z","title":"Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability","version":1},"cited_work":{"arxiv_id":"2404.08334","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.08334","snapshot_observed_at":"2026-08-15T16:08:19.392506Z","title":"Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability","venue":"eess.SY","work_id":"f32ce356-85fa-4b98-904c-38b7786dcf25","year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-16T18:10:14.715418Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.189657Z"},"links":{"cited_paper":"/paper/2404.08334","citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:73f7726f97476604612bf9c43573bec08df6beca8b4986bb0e9ffa504ead8cfc","observation_id":"e8ce173e-da2e-4ef2-b6fa-c923ae18607f","resolution":{"observed_at":"2026-08-15T16:08:19.399853Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.08334/citation-record","integrity":"/paper/2404.08334/integrity","json":"/paper/2404.08334/citation-record.json","paper":"/paper/2404.08334"},"outbound":[],"paper":{"arxiv_id":"2404.08334","last_updated":"2024-04-12T08:56:16Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-16T14:01:29.510434Z","submitted_at":"2024-04-12T08:56:16Z","title":"Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2404.08334."}