{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SFQOVN5XWE23IZ3OSWE7O4LENR","short_pith_number":"pith:SFQOVN5X","schema_version":"1.0","canonical_sha256":"9160eab7b7b135b4676e9589f771646c5a65bc3a1dc504ce4a4e10714e3b946e","source":{"kind":"arxiv","id":"2107.04094","version":4},"attestation_state":"computed","paper":{"title":"Robust Control Barrier Functions under High Relative Degree and Input Constraints for Satellite Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Dimitra Panagou, Joseph Breeden","submitted_at":"2021-07-08T20:24:16Z","abstract_excerpt":"This paper presents methodologies for constructing Control Barrier Functions (CBFs) for nonlinear, control-affine systems, in the presence of input constraints and bounded disturbances. More specifically, given a constraint function with high-relative-degree with respect to the system dynamics, the paper considers three methodologies, two for relative-degree 2 and one for higher relative-degrees, for creating CBFs whose zero sublevel sets are subsets of the constraint function's zero sublevel set. Three special forms of Robust CBFs (RCBFs) are developed as functions of the input constraints, s"},"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":"2107.04094","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2021-07-08T20:24:16Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"c35f9a1a9fde2230679bb8305659c9e8f86ce124c8709ba829fb28c73ffd52c5","abstract_canon_sha256":"27a5e6989952e19f543ca37a96e6bdabf38d17f0ae484db21a2e152e292f3075"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:58.094685Z","signature_b64":"p5XMhBo0yC3odhOWrSzyLuwo7ZpqUVKdU5PXgfTnmvMctYaAgs1E56atO3LqK6rKij25uRPT4aT2r9DAMR+RDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9160eab7b7b135b4676e9589f771646c5a65bc3a1dc504ce4a4e10714e3b946e","last_reissued_at":"2026-07-05T06:18:58.094279Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:58.094279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Control Barrier Functions under High Relative Degree and Input Constraints for Satellite Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Dimitra Panagou, Joseph Breeden","submitted_at":"2021-07-08T20:24:16Z","abstract_excerpt":"This paper presents methodologies for constructing Control Barrier Functions (CBFs) for nonlinear, control-affine systems, in the presence of input constraints and bounded disturbances. More specifically, given a constraint function with high-relative-degree with respect to the system dynamics, the paper considers three methodologies, two for relative-degree 2 and one for higher relative-degrees, for creating CBFs whose zero sublevel sets are subsets of the constraint function's zero sublevel set. Three special forms of Robust CBFs (RCBFs) are developed as functions of the input constraints, s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04094","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/2107.04094/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":"2107.04094","created_at":"2026-07-05T06:18:58.094339+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.04094v4","created_at":"2026-07-05T06:18:58.094339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04094","created_at":"2026-07-05T06:18:58.094339+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFQOVN5XWE23","created_at":"2026-07-05T06:18:58.094339+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFQOVN5XWE23IZ3O","created_at":"2026-07-05T06:18:58.094339+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFQOVN5X","created_at":"2026-07-05T06:18:58.094339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.03694","citing_title":"Demonstrating ViSafe: Vision-enabled Safety for High-speed Detect and Avoid","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SFQOVN5XWE23IZ3OSWE7O4LENR","json":"https://pith.science/pith/SFQOVN5XWE23IZ3OSWE7O4LENR.json","graph_json":"https://pith.science/api/pith-number/SFQOVN5XWE23IZ3OSWE7O4LENR/graph.json","events_json":"https://pith.science/api/pith-number/SFQOVN5XWE23IZ3OSWE7O4LENR/events.json","paper":"https://pith.science/paper/SFQOVN5X"},"agent_actions":{"view_html":"https://pith.science/pith/SFQOVN5XWE23IZ3OSWE7O4LENR","download_json":"https://pith.science/pith/SFQOVN5XWE23IZ3OSWE7O4LENR.json","view_paper":"https://pith.science/paper/SFQOVN5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.04094&json=true","fetch_graph":"https://pith.science/api/pith-number/SFQOVN5XWE23IZ3OSWE7O4LENR/graph.json","fetch_events":"https://pith.science/api/pith-number/SFQOVN5XWE23IZ3OSWE7O4LENR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFQOVN5XWE23IZ3OSWE7O4LENR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFQOVN5XWE23IZ3OSWE7O4LENR/action/storage_attestation","attest_author":"https://pith.science/pith/SFQOVN5XWE23IZ3OSWE7O4LENR/action/author_attestation","sign_citation":"https://pith.science/pith/SFQOVN5XWE23IZ3OSWE7O4LENR/action/citation_signature","submit_replication":"https://pith.science/pith/SFQOVN5XWE23IZ3OSWE7O4LENR/action/replication_record"}},"created_at":"2026-07-05T06:18:58.094339+00:00","updated_at":"2026-07-05T06:18:58.094339+00:00"}