{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RRGPBD7UDI7Z5CKLAD7RAKSZ3R","short_pith_number":"pith:RRGPBD7U","schema_version":"1.0","canonical_sha256":"8c4cf08ff41a3f9e894b00ff102a59dc6e60f429d4fb294e2d0648cd3f322bef","source":{"kind":"arxiv","id":"2209.00081","version":3},"attestation_state":"computed","paper":{"title":"A Semi-Algebraic Framework for Verification and Synthesis of Control Barrier Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andrew Clark","submitted_at":"2022-08-31T19:31:31Z","abstract_excerpt":"Safety is a critical property for control systems in medicine, transportation, manufacturing, and other applications, and can be defined as ensuring positive invariance of a predefined safe set. This paper investigates the problems of verifying positive invariance of a semi-algebraic set as well as synthesizing sets that can be made positive invariant through Control Barrier Function (CBF)-based control. The key to our approach consists of mapping conditions for positive invariance to sum-of-squares constraints via the Positivstellensatz from real algebraic geometry. Based on these conditions,"},"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.00081","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2022-08-31T19:31:31Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"5246e77d0e8f6d7168e3d43d76908de2bdbe34a9787345ea17906a45f70eebc4","abstract_canon_sha256":"2d30e68b8657e98d834c33f046ac44f3d9ab46f96ed62cf14a29e6f5f2b89b44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:23.320521Z","signature_b64":"sIH6YqpL8te7RaFdzHTdQ6NsgSo2L0/YLfcWUyy7LnPJjwVrOJMsJsKblQguI2Chs4FTPUj29cJSFVufxIpuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c4cf08ff41a3f9e894b00ff102a59dc6e60f429d4fb294e2d0648cd3f322bef","last_reissued_at":"2026-07-05T09:33:23.319943Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:23.319943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Semi-Algebraic Framework for Verification and Synthesis of Control Barrier Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andrew Clark","submitted_at":"2022-08-31T19:31:31Z","abstract_excerpt":"Safety is a critical property for control systems in medicine, transportation, manufacturing, and other applications, and can be defined as ensuring positive invariance of a predefined safe set. This paper investigates the problems of verifying positive invariance of a semi-algebraic set as well as synthesizing sets that can be made positive invariant through Control Barrier Function (CBF)-based control. The key to our approach consists of mapping conditions for positive invariance to sum-of-squares constraints via the Positivstellensatz from real algebraic geometry. Based on these conditions,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.00081","kind":"arxiv","version":3},"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.00081/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.00081","created_at":"2026-07-05T09:33:23.320012+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.00081v3","created_at":"2026-07-05T09:33:23.320012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.00081","created_at":"2026-07-05T09:33:23.320012+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRGPBD7UDI7Z","created_at":"2026-07-05T09:33:23.320012+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRGPBD7UDI7Z5CKL","created_at":"2026-07-05T09:33:23.320012+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRGPBD7U","created_at":"2026-07-05T09:33:23.320012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06679","citing_title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RRGPBD7UDI7Z5CKLAD7RAKSZ3R","json":"https://pith.science/pith/RRGPBD7UDI7Z5CKLAD7RAKSZ3R.json","graph_json":"https://pith.science/api/pith-number/RRGPBD7UDI7Z5CKLAD7RAKSZ3R/graph.json","events_json":"https://pith.science/api/pith-number/RRGPBD7UDI7Z5CKLAD7RAKSZ3R/events.json","paper":"https://pith.science/paper/RRGPBD7U"},"agent_actions":{"view_html":"https://pith.science/pith/RRGPBD7UDI7Z5CKLAD7RAKSZ3R","download_json":"https://pith.science/pith/RRGPBD7UDI7Z5CKLAD7RAKSZ3R.json","view_paper":"https://pith.science/paper/RRGPBD7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.00081&json=true","fetch_graph":"https://pith.science/api/pith-number/RRGPBD7UDI7Z5CKLAD7RAKSZ3R/graph.json","fetch_events":"https://pith.science/api/pith-number/RRGPBD7UDI7Z5CKLAD7RAKSZ3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRGPBD7UDI7Z5CKLAD7RAKSZ3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRGPBD7UDI7Z5CKLAD7RAKSZ3R/action/storage_attestation","attest_author":"https://pith.science/pith/RRGPBD7UDI7Z5CKLAD7RAKSZ3R/action/author_attestation","sign_citation":"https://pith.science/pith/RRGPBD7UDI7Z5CKLAD7RAKSZ3R/action/citation_signature","submit_replication":"https://pith.science/pith/RRGPBD7UDI7Z5CKLAD7RAKSZ3R/action/replication_record"}},"created_at":"2026-07-05T09:33:23.320012+00:00","updated_at":"2026-07-05T09:33:23.320012+00:00"}