{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:N67B67B3XSAH54O6K3Z7CLA3HU","short_pith_number":"pith:N67B67B3","schema_version":"1.0","canonical_sha256":"6fbe1f7c3bbc807ef1de56f3f12c1b3d0b7fa391ed8e2334f84995645e5cf2cb","source":{"kind":"arxiv","id":"2209.11827","version":2},"attestation_state":"computed","paper":{"title":"One-Shot Reachability Analysis of Neural Network Dynamical Systems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Mahyar Fazlyab, Shaoru Chen, Victor M. Preciado","submitted_at":"2022-09-23T19:40:11Z","abstract_excerpt":"The arising application of neural networks (NN) in robotic systems has driven the development of safety verification methods for neural network dynamical systems (NNDS). Recursive techniques for reachability analysis of dynamical systems in closed-loop with a NN controller, planner, or perception can over-approximate the reachable sets of the NNDS by bounding the outputs of the NN and propagating these NN output bounds forward. However, this recursive reachability analysis may suffer from compounding errors, rapidly becoming overly conservative over a longer horizon. In this work, we prove tha"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2209.11827","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2022-09-23T19:40:11Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4e43a668b116a5053e90d3351f3548f296caa82d98d5502ee9a9ee9d7202e4b4","abstract_canon_sha256":"a36dbd3baeeb89403554f11ed7e41b1fde7eb02fb7c2c14e37ae9918d0e1047c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:22.126128Z","signature_b64":"hfS74AnaI5Lb3+3WgDbCEtWrGF+8u3PvqXgTBY+0tYy8S0bdje/tOt/8neA0c4U4mPuMvAE+1BSOPUxRqNcSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fbe1f7c3bbc807ef1de56f3f12c1b3d0b7fa391ed8e2334f84995645e5cf2cb","last_reissued_at":"2026-07-05T05:09:22.125561Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:22.125561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-Shot Reachability Analysis of Neural Network Dynamical Systems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Mahyar Fazlyab, Shaoru Chen, Victor M. Preciado","submitted_at":"2022-09-23T19:40:11Z","abstract_excerpt":"The arising application of neural networks (NN) in robotic systems has driven the development of safety verification methods for neural network dynamical systems (NNDS). Recursive techniques for reachability analysis of dynamical systems in closed-loop with a NN controller, planner, or perception can over-approximate the reachable sets of the NNDS by bounding the outputs of the NN and propagating these NN output bounds forward. However, this recursive reachability analysis may suffer from compounding errors, rapidly becoming overly conservative over a longer horizon. In this work, we prove tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.11827","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.11827/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2209.11827","created_at":"2026-07-05T05:09:22.125638+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.11827v2","created_at":"2026-07-05T05:09:22.125638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.11827","created_at":"2026-07-05T05:09:22.125638+00:00"},{"alias_kind":"pith_short_12","alias_value":"N67B67B3XSAH","created_at":"2026-07-05T05:09:22.125638+00:00"},{"alias_kind":"pith_short_16","alias_value":"N67B67B3XSAH54O6","created_at":"2026-07-05T05:09:22.125638+00:00"},{"alias_kind":"pith_short_8","alias_value":"N67B67B3","created_at":"2026-07-05T05:09:22.125638+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04523","citing_title":"Verification of Visual Controllers via Compositional Geometric Transformations","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N67B67B3XSAH54O6K3Z7CLA3HU","json":"https://pith.science/pith/N67B67B3XSAH54O6K3Z7CLA3HU.json","graph_json":"https://pith.science/api/pith-number/N67B67B3XSAH54O6K3Z7CLA3HU/graph.json","events_json":"https://pith.science/api/pith-number/N67B67B3XSAH54O6K3Z7CLA3HU/events.json","paper":"https://pith.science/paper/N67B67B3"},"agent_actions":{"view_html":"https://pith.science/pith/N67B67B3XSAH54O6K3Z7CLA3HU","download_json":"https://pith.science/pith/N67B67B3XSAH54O6K3Z7CLA3HU.json","view_paper":"https://pith.science/paper/N67B67B3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.11827&json=true","fetch_graph":"https://pith.science/api/pith-number/N67B67B3XSAH54O6K3Z7CLA3HU/graph.json","fetch_events":"https://pith.science/api/pith-number/N67B67B3XSAH54O6K3Z7CLA3HU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N67B67B3XSAH54O6K3Z7CLA3HU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N67B67B3XSAH54O6K3Z7CLA3HU/action/storage_attestation","attest_author":"https://pith.science/pith/N67B67B3XSAH54O6K3Z7CLA3HU/action/author_attestation","sign_citation":"https://pith.science/pith/N67B67B3XSAH54O6K3Z7CLA3HU/action/citation_signature","submit_replication":"https://pith.science/pith/N67B67B3XSAH54O6K3Z7CLA3HU/action/replication_record"}},"created_at":"2026-07-05T05:09:22.125638+00:00","updated_at":"2026-07-05T05:09:22.125638+00:00"}