{"as_of":"2026-08-18T00:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:11e96b6a65143cf2d475cda343fa72205dae305551f2cb5fabde96f303e6de78","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:56:55.331377Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"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-07-01T01:19:12.424654Z","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-07-01T13:05:44.258247Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"cited_work":{"arxiv_id":"2504.16879","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16879","snapshot_observed_at":"2026-07-01T13:05:44.258247Z","title":"Learning verifi- able control policies using relaxed verification,","venue":null,"work_id":"f955d61d-6885-4ebe-b88a-f207fce2242b","year":2025},"citing_paper":{"arxiv_id":"2606.30935","last_updated":"2026-06-29T21:38:44Z","snapshot_observed_at":"2026-08-07T16:47:28.559653Z","submitted_at":"2026-06-29T21:38:44Z","title":"ShardNet: Training Neural Controllers with Hard, Non-Convex Constraints","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-01T01:19:12.424654Z"},"links":{"cited_paper":"/paper/2504.16879","citing_paper":"/paper/2606.30935"},"observation_digest":"sha256:a07d6b8c06fe6a502567ed63f4b263d7c68ed93ffcde1d9cce308ff0ed08c115","observation_id":"a6b35591-5d90-498d-9fde-672e66b23ae5","resolution":{"observed_at":"2026-07-01T13:05:44.260291Z","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/2504.16879/citation-record","integrity":"/paper/2504.16879/integrity","json":"/paper/2504.16879/citation-record.json","paper":"/paper/2504.16879"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.154138Z","title":"Efficient neural network robustness certification with general activa- tion functions,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.154138Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:1eb3b2956c4100725ba9bb260d0bafede7f0e2b75a085b7ea39601477f6221b2","observation_id":"4e66936f-fc09-405f-b7c3-818c0cbdebe8","resolution":{"observed_at":"2026-08-16T10:56:55.154138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.159690Z","title":"Towards fast computation of certified robustness for relu networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.159690Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:e50122c094f839e46b31321aa7faf9ce070d6665ff9321c05f17b2642290a9f8","observation_id":"d6934551-e938-40da-a8a7-d876595624bd","resolution":{"observed_at":"2026-08-16T10:56:55.159690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.164441Z","title":"Automatic perturbation analy- sis for scalable certified robustness and beyond,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.164441Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:b3b8c02a6fc831e5d665c97b3cee8a0bb5228a1f008c959921dbbab056b549da","observation_id":"4d52664e-2a18-4e71-b316-a06f4aeca57b","resolution":{"observed_at":"2026-08-16T10:56:55.164441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.169216Z","title":"Semidefinite relax- ations for certifying robustness to adversarial examples,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.169216Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:652f404a7b814e12fda63ac4c267b22781f2e3c332d1576b0d18583f5876b016","observation_id":"b6a339f3-12d7-4a6d-bea7-3a5e3bc7c8db","resolution":{"observed_at":"2026-08-16T10:56:55.169216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.173915Z","title":"Evaluating robustness of neural networks with mixed integer programming,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.173915Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:cd2e0ab8c4daf317c1d4b2fc993f9e355b7bccf002459cc08af3c52aa7dc2a60","observation_id":"1aaaaccf-dbdd-41b2-a525-afac9778c85a","resolution":{"observed_at":"2026-08-16T10:56:55.173915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.178296Z","title":"The marabou framework for verification and analysis of deep neural networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.178296Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:0fb7ee481230096cf2fc6e9cfa667caa277a6cafc0d3ade0b817312d755f1dde","observation_id":"ae6b8c06-3838-467d-aa5b-8e77f6644628","resolution":{"observed_at":"2026-08-16T10:56:55.178296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.183462Z","title":"Re- luplex: An efficient SMT solver for verifying deep neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.183462Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:855c39e717e13900b6a0b5201533f595cc509841742985d5ea32f0f19c4d7f7c","observation_id":"64e14d09-9422-45e4-af73-c8e79892721a","resolution":{"observed_at":"2026-08-16T10:56:55.183462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.187391Z","title":"Verifying low-dimensional input neural networks via input quantization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.187391Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:d23833b3be8a4b8a5578faf5a5c15396d3bf64895160de973beb63e3b1be0b20","observation_id":"87ea7f61-aa1e-4711-a291-a0f5c31bb621","resolution":{"observed_at":"2026-08-16T10:56:55.187391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.192864Z","title":"Reachable polyhedral marching (RPM): A safety verification algorithm for robotic systems with deep neural network components,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.192864Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:ba31426ec86b18cd951fbec8df554bf95325d58c25d331a09b5345830ec1bcec","observation_id":"e80d351d-bb99-4226-b7ba-0494692040b8","resolution":{"observed_at":"2026-08-16T10:56:55.192864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.197024Z","title":"Overt: An algorithm for safety verification of neural network control policies for nonlinear systems,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.197024Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:07204cfdf0a05bac234a0fd9ae45cebf4595cbba4a14cabe9bf27d23297aa913","observation_id":"34117b47-623a-437f-a4c2-057985b81129","resolution":{"observed_at":"2026-08-16T10:56:55.197024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.201498Z","title":"One-shot reachability anal- ysis of neural network dynamical systems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.201498Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:8844aa5027553baa9ba673bd21ba237617a4e0b2341b69db8ed0c55d93dc7080","observation_id":"0954a8ca-f579-4721-8b1e-6c25a0af09ea","resolution":{"observed_at":"2026-08-16T10:56:55.201498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.205839Z","title":"Reachability analysis of neural feedback loops,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.205839Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:945421c9a830dea422ab54d9050b5db0afff0ef98740d8abaab060ffcdd92a1f","observation_id":"5cc77f7a-611e-4a6f-b41d-e6f0711d8183","resolution":{"observed_at":"2026-08-16T10:56:55.205839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.00520","last_updated":"2019-06-04T00:21:05Z","snapshot_observed_at":"2026-08-17T04:08:50.419515Z","submitted_at":"2019-03-01T20:14:11Z","title":"A Reachability Method for Verifying Dynamical Systems with Deep Neural Network Controllers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.00520","snapshot_observed_at":"2026-08-16T10:56:55.210280Z","title":"A reachability method for verifying dynamical systems with deep neural network controllers,","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.210280Z"},"links":{"cited_paper":"/paper/1903.00520","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:1f395ef0eff51562479d81e8bc223e22660346d3a1e0557db2a825977a3110e6","observation_id":"302e5ac0-11ae-498a-a602-62eb616af3f1","resolution":{"observed_at":"2026-08-16T10:56:55.210280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.214562Z","title":"Reach-SDP: Reachability analysis of closed-loop systems with neural network controllers via semidefinite programming,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.214562Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:2f4a91eda0aee726055605d8a5a2c81331a3d937aecd82d7d15653b8d9a2a69d","observation_id":"9cd86313-e0f9-4b32-9f63-749bf62579c7","resolution":{"observed_at":"2026-08-16T10:56:55.214562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.218478Z","title":"Polar-express: Efficient and precise formal reachability analysis of neural-network controlled systems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.218478Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:eb555444a0e70e12e794454ff98cd6b869db8620717ceba1d1a5a0628c5936ed","observation_id":"6566ac86-5fa0-4889-b297-9d45a3b6908e","resolution":{"observed_at":"2026-08-16T10:56:55.218478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.223079Z","title":"Verisig: verifying safety properties of hybrid systems with neural network con- trollers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.223079Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:79785d980b35f21c744c75a5807bd0659a9dadff7cf48d6a1218cea3c44e0695","observation_id":"2cd69ac1-b26b-40cf-9304-e0e914c64686","resolution":{"observed_at":"2026-08-16T10:56:55.223079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.227788Z","title":"Reachability analysis for neural feedback systems using regressive polynomial rule inference,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.227788Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:d5210376e76827ad22d37f3810a1e8e6b8052ee24233e8841b7ee3c20701e3e3","observation_id":"fcb10bab-b597-4509-924c-84bc28b2307c","resolution":{"observed_at":"2026-08-16T10:56:55.227788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.231549Z","title":"Reachnn: Reachability analysis of neural-network controlled systems,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.231549Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:fbf55be92bda597718ae61c4a7c79a5df4f7b7396d29aa1de81fa8af4644e314","observation_id":"f88e1383-fc20-46fd-a29e-20cbd5437e9b","resolution":{"observed_at":"2026-08-16T10:56:55.231549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.235730Z","title":"Reachnn*: A tool for reachability analysis of neural-network controlled systems,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.235730Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:6cd73affa7d59c2357326e2fbd6819152d5179db83b3d81c5cd1392d73fd0c24","observation_id":"f25dbd88-c34e-4350-aa16-efd679fb88dc","resolution":{"observed_at":"2026-08-16T10:56:55.235730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.239916Z","title":"Reachable set estimation for neural network control systems: A simulation-guided approach,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.239916Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:a98ae110a75aa5ce1345b36c347ac61c39d49563036f9848bc7bd55f59c4fdaa","observation_id":"9732f711-3905-4d82-8c3f-de4326731fea","resolution":{"observed_at":"2026-08-16T10:56:55.239916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.244320Z","title":"Neural network compression of ACAS Xu early prototype is unsafe: Closed-loop verification through quantized state backreachability,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.244320Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:c5c85a9b2cc92b3ac2abdd7d584a3f37c26d20402d8ab2ba019ec954f2ab6671","observation_id":"29ee255f-2512-425f-b807-080c01cf9852","resolution":{"observed_at":"2026-08-16T10:56:55.244320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.06624","last_updated":"2021-10-31T22:51:18Z","snapshot_observed_at":"2026-08-16T18:39:38.974852Z","submitted_at":"2021-03-11T11:56:54Z","title":"Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.06624","snapshot_observed_at":"2026-08-16T10:56:55.247943Z","title":"Beta-crown: Efficient bound propagation with per-neuron split constraints for complete and incomplete neural network verification,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.247943Z"},"links":{"cited_paper":"/paper/2103.06624","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:5e1cab36437dd5e50ca2ba6c0724a5870ec363213e1c2dc04fd2e14a01c8292b","observation_id":"667111ae-6a76-4ac9-a209-a2213bbe1062","resolution":{"observed_at":"2026-08-16T10:56:55.247943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.592698Z","title":"Safety verification of neural feedback systems based on constrained zonotopes,","venue":null,"work_id":"29e42e43-6060-407a-a4e0-8520da3d05ff","year":2022},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.252906Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:28e0b7c962c5308370c7bdfa1af984f58cfdbff49e06f17525db4abdbb0c31ab","observation_id":"87a8bdba-aa65-42b3-b53e-6915cc574af8","resolution":{"observed_at":"2026-08-16T10:56:55.596879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.580271Z","title":"Scalable verified training for provably robust image classification,","venue":null,"work_id":"89063449-8e98-40bc-b3a5-04d2431b5ba3","year":2019},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.257268Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:a3c04b85942030cacb83027558b473563340fe98052e54ded18ebc1bb09a91fd","observation_id":"d128a478-046b-45f0-8dfa-c5ad80c8550a","resolution":{"observed_at":"2026-08-16T10:56:55.584734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.569116Z","title":"Neural Lyapunov control,","venue":null,"work_id":"9152958a-14c2-4dd4-a4d2-7cde173e8db2","year":2019},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.261248Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:02344d62f1e20a9c49d6cb363fb5708c055cf470cc2471ef3f54c5c60108441a","observation_id":"031736f8-1bd2-4d46-b302-92c185f91b43","resolution":{"observed_at":"2026-08-16T10:56:55.572664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.557517Z","title":"Learning certified control using contrac- tion metric,","venue":null,"work_id":"887842c4-f57a-4957-8bb0-3ab6cb06cbe2","year":2021},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.264968Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:a7443e902c282ad3fbfa1ef20d3da0e0834b171ec61f10e5ba2cf261f0389755","observation_id":"53893ec8-ce80-41aa-8e25-2a6bc90b493f","resolution":{"observed_at":"2026-08-16T10:56:55.561246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.545932Z","title":"Actor-critic reinforcement learning for control with stability guarantee,","venue":null,"work_id":"6a401f67-4d04-472d-865c-9848f00fa130","year":2020},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.269329Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:7bf269bec98e3290c63e67cffb8befdb43c4ea3df5c70a6ba8751a30664ae76c","observation_id":"9cb79664-a7fe-4a65-9cc8-f968f1a256e6","resolution":{"observed_at":"2026-08-16T10:56:55.549646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.534819Z","title":"Learning safe multi-agent control with decentralized neural barrier certificates,","venue":null,"work_id":"fc820600-9b42-458e-b52e-b21a607f9c26","year":2020},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.273588Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:c8d5281c5be7952813649245e0a53c37bc97963861dad74a873a91447cbf530f","observation_id":"adb914b0-ec73-4157-a88d-070daaef7d73","resolution":{"observed_at":"2026-08-16T10:56:55.538898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.524311Z","title":"Lyapunov- stable neural-network control,","venue":null,"work_id":"753f2c19-6156-4ec0-b163-6ae96f371f3e","year":2021},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.277517Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:8d1f6c0be6d4ff05dc750bd485d3b3914206af7710349224a6470d74df38a9ba","observation_id":"2e3d2c15-af09-46c7-b686-0c9016da7bb0","resolution":{"observed_at":"2026-08-16T10:56:55.527860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2202.11762","last_updated":"2022-12-20T18:52:49Z","snapshot_observed_at":"2026-08-16T17:19:06.698796Z","submitted_at":"2022-02-23T20:11:13Z","title":"Safe Control with Learned Certificates: A Survey of Neural Lyapunov, Barrier, and Contraction methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.11762","snapshot_observed_at":"2026-08-16T10:56:55.281070Z","title":"Safe control with learned certificates: A survey of neural Lyapunov, barrier, and contraction methods,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.281070Z"},"links":{"cited_paper":"/paper/2202.11762","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:fe3b620acb391ec7cd1405e2875044c78ab0b2f1991531a7574d74ab4fe80b7c","observation_id":"e7e0319f-bfa9-49fe-a532-a03d552956bf","resolution":{"observed_at":"2026-08-16T10:56:55.281070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00826","last_updated":"2025-07-18T07:33:46Z","snapshot_observed_at":"2026-08-16T13:46:58.387096Z","submitted_at":"2024-06-02T18:19:19Z","title":"Policy Verification in Stochastic Dynamical Systems Using Logarithmic Neural Certificates","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.00826","snapshot_observed_at":"2026-08-16T10:56:55.285434Z","title":"Learning-based verification of stochastic dynamical systems with neural network policies,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.285434Z"},"links":{"cited_paper":"/paper/2406.00826","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:a6265d13f6f745bbc9e4816edecb97c83dfac3936d8c27bffdcd4d7b2534ae20","observation_id":"dfd87b98-ead3-4e4e-a9b8-fe873eac12d9","resolution":{"observed_at":"2026-08-16T10:56:55.285434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07956","last_updated":"2024-06-05T00:30:57Z","snapshot_observed_at":"2026-08-16T14:01:39.030092Z","submitted_at":"2024-04-11T17:49:15Z","title":"Lyapunov-stable Neural Control for State and Output Feedback: A Novel Formulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07956","snapshot_observed_at":"2026-08-16T10:56:55.289933Z","title":"Lyapunov-stable neural control for state and output feedback: A novel formulation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.289933Z"},"links":{"cited_paper":"/paper/2404.07956","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:f9c6fe5efb6705907572086d8ed0cbfd8cbff26643cc607d52c8fe7fa42e4bc0","observation_id":"a49b5774-e6e4-43e9-8444-bfff67260fb8","resolution":{"observed_at":"2026-08-16T10:56:55.289933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03245","last_updated":"2021-06-06T20:56:06Z","snapshot_observed_at":"2026-08-16T18:19:16.406765Z","submitted_at":"2021-06-06T20:56:06Z","title":"Verification in the Loop: Correct-by-Construction Control Learning with Reach-avoid Guarantees","version":1},"cited_work":{"arxiv_id":"2106.03245","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.03245","snapshot_observed_at":"2026-08-16T10:56:55.414607Z","title":"Verification in the Loop: Correct-by-Construction Control Learning with Reach-avoid Guarantees","venue":"eess.SY","work_id":"d459663e-24ef-4992-a248-ab723bf228b0","year":2021},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.294258Z"},"links":{"cited_paper":"/paper/2106.03245","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:ad2cd6d2e2be8d20b6ed0b022303566d6d8a48141e568cf9f3c4ce93d8a170f9","observation_id":"37e0827f-5c8b-4a0c-9711-0d91cea567dc","resolution":{"observed_at":"2026-08-16T10:56:55.419225Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"2201.12243","last_updated":"2023-03-21T04:41:42Z","snapshot_observed_at":"2026-08-16T17:25:11.617163Z","submitted_at":"2022-01-28T16:53:56Z","title":"Joint Differentiable Optimization and Verification for Certified Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2201.12243","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.12243","snapshot_observed_at":"2026-08-16T10:56:55.397031Z","title":"Joint Differentiable Optimization and Verification for Certified Reinforcement Learning","venue":"cs.LG","work_id":"c3a5bdd0-85a7-4448-8cb9-9b17062a1882","year":2022},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.299020Z"},"links":{"cited_paper":"/paper/2201.12243","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:97944f516fb804a303fd351591ac64f1f7f1fbe3632de98a935f2ca2ffd8729f","observation_id":"3aa10be5-37dd-4501-98c0-2a67d8eafabe","resolution":{"observed_at":"2026-08-16T10:56:55.403135Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15994","last_updated":"2024-11-16T04:21:50Z","snapshot_observed_at":"2026-08-17T12:01:36.327270Z","submitted_at":"2024-05-25T00:35:39Z","title":"Verified Safe Reinforcement Learning for Neural Network Dynamic Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15994","snapshot_observed_at":"2026-08-16T10:56:55.303280Z","title":"Verified safe reinforce- ment learning for neural network dynamic models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.303280Z"},"links":{"cited_paper":"/paper/2405.15994","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:92b7c117533e92c76a2e6e22a421fe80dcdb8d84b3f732bd8386a702286ee2ce","observation_id":"84f0bdaf-976c-4a8c-82f8-619f873a5b3f","resolution":{"observed_at":"2026-08-16T10:56:55.303280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.307175Z","title":"Bunel, J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.307175Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:da86b1279f6047468bf2d66a7f3fb9209cee4bccc31070336da32d5d71531561","observation_id":"2ca42e93-17d0-4011-a377-07532932203d","resolution":{"observed_at":"2026-08-16T10:56:55.307175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.311204Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.311204Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:7dd923b532f158499b95bb394185434e0bb327e21b3cd1be6acf766256703f22","observation_id":"20c4dc66-01a0-49e0-a0b4-a5ae17a77dbb","resolution":{"observed_at":"2026-08-16T10:56:55.311204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.14394","last_updated":"2025-05-06T16:18:38Z","snapshot_observed_at":"2026-08-16T13:32:40.682684Z","submitted_at":"2024-07-19T15:16:25Z","title":"TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.14394","snapshot_observed_at":"2026-08-16T10:56:55.315620Z","title":"Ttt: A temporal refinement heuristic for tenuously tractable discrete time reachability problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.315620Z"},"links":{"cited_paper":"/paper/2407.14394","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:5b6bb59c9ecb320ef719944f4c38a2fb130b3d01df1669367a7fa9c8239e97bb","observation_id":"94a41263-a517-4b61-af3f-8ed5e5fb0f30","resolution":{"observed_at":"2026-08-16T10:56:55.315620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.499034Z","title":"Constraint-aware refinement for safety verification of neural feedback loops,","venue":null,"work_id":"e6fda84f-020f-4490-b62b-5e9e14110a80","year":2024},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.319758Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:2520780da14403595af034a3ed47fff25bd5f59c9071bb43137174eda74ff6b9","observation_id":"87b18fc8-7a1f-4e25-abb6-41d86a3ed8ee","resolution":{"observed_at":"2026-08-16T10:56:55.503595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-16T10:56:55.323643Z","title":"Adam: A method for stochastic optimiza- tion,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.323643Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:b6ccd167043a9a058d76838de0fea7247f4679345644551d59446760e0e06ac4","observation_id":"91b9b515-6995-4a19-a0a6-b0ab44f0f2c1","resolution":{"observed_at":"2026-08-16T10:56:55.323643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.327858Z","title":"Safety verification and robustness analysis of neural networks via quadratic constraints and semidefinite programming,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.327858Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:0e317f20c85323503906817372d153ff49eaef183dfd08847ba3ce68fcfc1783","observation_id":"1a6907db-19fe-4e53-9b26-1f4bbe0117af","resolution":{"observed_at":"2026-08-16T10:56:55.327858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:56:55.331377Z","title":"Backward reachability analysis of neural feedback loops: Techniques for linear and nonlinear systems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T10:56:55.331377Z"},"links":{"citing_paper":"/paper/2504.16879"},"observation_digest":"sha256:26ab6d7db2df9b6f3eff3134c7ca3b9916cbe1a8e17bc2a96763e22b557e985c","observation_id":"76587b71-b3e5-439c-ab3a-a86f3a0e81e6","resolution":{"observed_at":"2026-08-16T10:56:55.331377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.16879","last_updated":"2025-04-23T16:54:35Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-17T07:20:35.759547Z","submitted_at":"2025-04-23T16:54:35Z","title":"Learning Verifiable Control Policies Using Relaxed Verification"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":2,"verified_fuzzy":8},"total_outbound_references":42},"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 18 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 1 inbound Pith citation observation for arXiv:2504.16879."}