{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GN2IJOSFKHLB7NB4ODDP46MMFT","short_pith_number":"pith:GN2IJOSF","schema_version":"1.0","canonical_sha256":"337484ba4551d61fb43c70c6fe798c2cfed339cf8580b0a5551e87e5f9a33613","source":{"kind":"arxiv","id":"1601.01019","version":1},"attestation_state":"computed","paper":{"title":"Convex Computation of the Reachable Set for Hybrid Systems with Parametric Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Ram Vasudevan, Shankar Mohan, Victor Shia","submitted_at":"2016-01-05T23:51:27Z","abstract_excerpt":"To verify the correct operation of systems, engineers need to determine the set of configurations of a dynamical model that are able to safely reach a specified configuration under a control law. Unfortunately, constructing models for systems interacting in highly dynamic environments is difficult. This paper addresses this challenge by presenting a convex optimization method to efficiently compute the set of configurations of a polynomial hybrid dynamical system that are able to safely reach a user defined target set despite parametric uncertainty in the model. This class of models describes,"},"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":"1601.01019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-05T23:51:27Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"f4261aa32de746e1fe23173ffd2da48b1aeeb3373cb1ad2d99a057d9f0dec603","abstract_canon_sha256":"8eb9a7ccc6b4774efbdce1e1212678913fd3dd2abac94177eaabb67dcb0a828b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:18.218308Z","signature_b64":"9jT92Ggjb030Sj7mMIyfWhUiWHVCTYA6FwzgicLdRJ5VkaA13mWWYdXEYzqb/c7TejLEZkZSQh5fdR2KA5oSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"337484ba4551d61fb43c70c6fe798c2cfed339cf8580b0a5551e87e5f9a33613","last_reissued_at":"2026-05-18T01:23:18.217650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:18.217650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Computation of the Reachable Set for Hybrid Systems with Parametric Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Ram Vasudevan, Shankar Mohan, Victor Shia","submitted_at":"2016-01-05T23:51:27Z","abstract_excerpt":"To verify the correct operation of systems, engineers need to determine the set of configurations of a dynamical model that are able to safely reach a specified configuration under a control law. Unfortunately, constructing models for systems interacting in highly dynamic environments is difficult. This paper addresses this challenge by presenting a convex optimization method to efficiently compute the set of configurations of a polynomial hybrid dynamical system that are able to safely reach a user defined target set despite parametric uncertainty in the model. This class of models describes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01019","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1601.01019","created_at":"2026-05-18T01:23:18.217749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01019v1","created_at":"2026-05-18T01:23:18.217749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01019","created_at":"2026-05-18T01:23:18.217749+00:00"},{"alias_kind":"pith_short_12","alias_value":"GN2IJOSFKHLB","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GN2IJOSFKHLB7NB4","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GN2IJOSF","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GN2IJOSFKHLB7NB4ODDP46MMFT","json":"https://pith.science/pith/GN2IJOSFKHLB7NB4ODDP46MMFT.json","graph_json":"https://pith.science/api/pith-number/GN2IJOSFKHLB7NB4ODDP46MMFT/graph.json","events_json":"https://pith.science/api/pith-number/GN2IJOSFKHLB7NB4ODDP46MMFT/events.json","paper":"https://pith.science/paper/GN2IJOSF"},"agent_actions":{"view_html":"https://pith.science/pith/GN2IJOSFKHLB7NB4ODDP46MMFT","download_json":"https://pith.science/pith/GN2IJOSFKHLB7NB4ODDP46MMFT.json","view_paper":"https://pith.science/paper/GN2IJOSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01019&json=true","fetch_graph":"https://pith.science/api/pith-number/GN2IJOSFKHLB7NB4ODDP46MMFT/graph.json","fetch_events":"https://pith.science/api/pith-number/GN2IJOSFKHLB7NB4ODDP46MMFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GN2IJOSFKHLB7NB4ODDP46MMFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GN2IJOSFKHLB7NB4ODDP46MMFT/action/storage_attestation","attest_author":"https://pith.science/pith/GN2IJOSFKHLB7NB4ODDP46MMFT/action/author_attestation","sign_citation":"https://pith.science/pith/GN2IJOSFKHLB7NB4ODDP46MMFT/action/citation_signature","submit_replication":"https://pith.science/pith/GN2IJOSFKHLB7NB4ODDP46MMFT/action/replication_record"}},"created_at":"2026-05-18T01:23:18.217749+00:00","updated_at":"2026-05-18T01:23:18.217749+00:00"}