{"as_of":"2026-08-17T19:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b485b1313f9a3d4d04c87ccb1d11ce69a17565e7ccf2bfa9d2f729ff962f7f7a","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-17T06:30:58.91139+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-05-22T16:28:55.302999Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T16:31:47.435505Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.06769","last_updated":"2023-11-12T08:11:28Z","snapshot_observed_at":"2026-08-16T14:44:03.605867Z","submitted_at":"2023-11-12T08:11:28Z","title":"Learning Predictive Safety Filter via Decomposition of Robust Invariant Set","version":1},"cited_work":{"arxiv_id":"2311.06769","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.06769","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning predictive safety filter via decomposition of robust invariant set","venue":null,"work_id":"097dd41d-c74a-47a3-a1bb-0f4a1a46fea4","year":2023},"citing_paper":{"arxiv_id":"2505.09067","last_updated":"2026-05-18T23:03:30Z","snapshot_observed_at":"2026-08-14T15:23:26.362404Z","submitted_at":"2025-05-14T02:04:57Z","title":"Solving Reach- and Stabilize-Avoid Problems Using Discounted Reachability","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T16:28:55.302999Z"},"links":{"cited_paper":"/paper/2311.06769","citing_paper":"/paper/2505.09067"},"observation_digest":"sha256:25e1820c44cb5997d0becd41088e1e99b40f31d6c99000aea2e81dd6a1d9c5a1","observation_id":"320ecd1e-ff4e-447f-b289-22c5de168c6f","resolution":{"observed_at":"2026-05-22T16:31:47.438659Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.06769/citation-record","integrity":"/paper/2311.06769/integrity","json":"/paper/2311.06769/citation-record.json","paper":"/paper/2311.06769"},"outbound":[],"paper":{"arxiv_id":"2311.06769","last_updated":"2023-11-12T08:11:28Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-16T14:44:03.605867Z","submitted_at":"2023-11-12T08:11:28Z","title":"Learning Predictive Safety Filter via Decomposition of Robust Invariant Set"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2311.06769."}