{"as_of":"2026-08-23T05:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:263490dac778094a9bc0580923705a2ce7d7b219c141c092c6005a1975cf3ffd","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-22T06:32:14.747728+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-12T00:04:11.660774Z","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-05T12:44:36.154367Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.03237","last_updated":"2019-05-21T03:13:32Z","snapshot_observed_at":"2026-08-18T01:59:15.464481Z","submitted_at":"2018-03-08T18:13:06Z","title":"A Classification-based Approach for Approximate Reachability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.03237","snapshot_observed_at":"2026-08-12T00:04:11.660774Z","title":"o der, J. P. and Findeisen, R. and Nagy, Z. and Allg \\","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.02033","last_updated":"2025-04-26T06:37:19Z","snapshot_observed_at":"2026-08-19T10:55:42.668483Z","submitted_at":"2024-12-02T23:25:33Z","title":"Linear Supervision for Nonlinear, High-Dimensional Neural Control and Differential Games","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T00:04:11.660774Z"},"links":{"cited_paper":"/paper/1803.03237","citing_paper":"/paper/2412.02033"},"observation_digest":"sha256:3b66d87761327656c6126c0262f2e91b426d7ff4e44be4b0f4cc3657763a1431","observation_id":"3d94d113-291a-4bef-b058-7931c9f36b6f","resolution":{"observed_at":"2026-08-12T00:04:11.660774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03237","last_updated":"2019-05-21T03:13:32Z","snapshot_observed_at":"2026-08-18T01:59:15.464481Z","submitted_at":"2018-03-08T18:13:06Z","title":"A Classification-based Approach for Approximate Reachability","version":2},"cited_work":{"arxiv_id":"1803.03237","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.03237","snapshot_observed_at":"2026-08-05T12:44:36.154367Z","title":"A Classification-based Approach for Approximate Reachability","venue":"cs.RO","work_id":"dcce912f-24aa-4139-8d0f-ae3cb97bd90b","year":2018},"citing_paper":{"arxiv_id":"2509.01338","last_updated":"2025-09-01T10:19:00Z","snapshot_observed_at":"2026-08-21T12:55:46.764497Z","submitted_at":"2025-09-01T10:19:00Z","title":"Conformal Predictive Monitoring for Multi-Modal Scenarios","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T12:44:35.334087Z"},"links":{"cited_paper":"/paper/1803.03237","citing_paper":"/paper/2509.01338"},"observation_digest":"sha256:77a3cca1ffd48955b33820f038da0bbb66f76abbfa0552e128be2c2967d8af03","observation_id":"3bf4baff-cf99-46e3-b54f-751188504abd","resolution":{"observed_at":"2026-08-05T12:44:36.220050Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1803.03237/citation-record","integrity":"/paper/1803.03237/integrity","json":"/paper/1803.03237/citation-record.json","paper":"/paper/1803.03237"},"outbound":[],"paper":{"arxiv_id":"1803.03237","last_updated":"2019-05-21T03:13:32Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-18T01:59:15.464481Z","submitted_at":"2018-03-08T18:13:06Z","title":"A Classification-based Approach for Approximate 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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1803.03237."}