{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6BLHTRBJYX6LNFJORXJ7QC5XFN","short_pith_number":"pith:6BLHTRBJ","schema_version":"1.0","canonical_sha256":"f05679c429c5fcb6952e8dd3f80bb72b40c06f8127564594a53e0b34571d8749","source":{"kind":"arxiv","id":"2411.07640","version":4},"attestation_state":"computed","paper":{"title":"Minimally Conservative Controlled-Invariant Set Synthesis Using Control Barrier Certificates","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Naeim Ebrahimi Toulkani, Reza Ghabcheloo","submitted_at":"2024-11-12T08:44:01Z","abstract_excerpt":"Finding a controlled-invariant set for a system with state and control constraints is crucial for safety-critical applications. However, existing methods often produce overly conservative solutions. This paper presents a method for generating controlled-invariant (safe) sets for nonlinear polynomial control-affine systems using Control Barrier Certificates (CBCs). We formulate CBC conditions as Sum-of-Squares (SOS) constraints and solve them via an SOS Program (SOSP). First, we generalize existing SOSPs for CBC synthesis to handle environments with complex unsafe state representations. Then, w"},"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":"2411.07640","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.SY","submitted_at":"2024-11-12T08:44:01Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"f3c3a4d261c8f1b0bfda04644a1dca41a7c6ee52ae4b4a79774cb0a7df973c6d","abstract_canon_sha256":"840dfa6b2b9823483400632d77bbf953c7c29b0f54518e0af13ab5d0310df824"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:18.970627Z","signature_b64":"024wQXIpwC9jcc2QQtNelLKAe9Lp0dRHBiEcO9EKyxLQs2ZngSgiNVMKxpBEU10HkBGRP7RpMK2T3fFYXKk/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f05679c429c5fcb6952e8dd3f80bb72b40c06f8127564594a53e0b34571d8749","last_reissued_at":"2026-07-05T11:51:18.970166Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:18.970166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimally Conservative Controlled-Invariant Set Synthesis Using Control Barrier Certificates","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Naeim Ebrahimi Toulkani, Reza Ghabcheloo","submitted_at":"2024-11-12T08:44:01Z","abstract_excerpt":"Finding a controlled-invariant set for a system with state and control constraints is crucial for safety-critical applications. However, existing methods often produce overly conservative solutions. This paper presents a method for generating controlled-invariant (safe) sets for nonlinear polynomial control-affine systems using Control Barrier Certificates (CBCs). We formulate CBC conditions as Sum-of-Squares (SOS) constraints and solve them via an SOS Program (SOSP). First, we generalize existing SOSPs for CBC synthesis to handle environments with complex unsafe state representations. Then, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.07640","kind":"arxiv","version":4},"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/2411.07640/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":"2411.07640","created_at":"2026-07-05T11:51:18.970221+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.07640v4","created_at":"2026-07-05T11:51:18.970221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.07640","created_at":"2026-07-05T11:51:18.970221+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BLHTRBJYX6L","created_at":"2026-07-05T11:51:18.970221+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BLHTRBJYX6LNFJO","created_at":"2026-07-05T11:51:18.970221+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BLHTRBJ","created_at":"2026-07-05T11:51:18.970221+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":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BLHTRBJYX6LNFJORXJ7QC5XFN","json":"https://pith.science/pith/6BLHTRBJYX6LNFJORXJ7QC5XFN.json","graph_json":"https://pith.science/api/pith-number/6BLHTRBJYX6LNFJORXJ7QC5XFN/graph.json","events_json":"https://pith.science/api/pith-number/6BLHTRBJYX6LNFJORXJ7QC5XFN/events.json","paper":"https://pith.science/paper/6BLHTRBJ"},"agent_actions":{"view_html":"https://pith.science/pith/6BLHTRBJYX6LNFJORXJ7QC5XFN","download_json":"https://pith.science/pith/6BLHTRBJYX6LNFJORXJ7QC5XFN.json","view_paper":"https://pith.science/paper/6BLHTRBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.07640&json=true","fetch_graph":"https://pith.science/api/pith-number/6BLHTRBJYX6LNFJORXJ7QC5XFN/graph.json","fetch_events":"https://pith.science/api/pith-number/6BLHTRBJYX6LNFJORXJ7QC5XFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BLHTRBJYX6LNFJORXJ7QC5XFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BLHTRBJYX6LNFJORXJ7QC5XFN/action/storage_attestation","attest_author":"https://pith.science/pith/6BLHTRBJYX6LNFJORXJ7QC5XFN/action/author_attestation","sign_citation":"https://pith.science/pith/6BLHTRBJYX6LNFJORXJ7QC5XFN/action/citation_signature","submit_replication":"https://pith.science/pith/6BLHTRBJYX6LNFJORXJ7QC5XFN/action/replication_record"}},"created_at":"2026-07-05T11:51:18.970221+00:00","updated_at":"2026-07-05T11:51:18.970221+00:00"}