{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TN5NSIGANW7S55ZQ5X6BAQF6HT","short_pith_number":"pith:TN5NSIGA","schema_version":"1.0","canonical_sha256":"9b7ad920c06dbf2ef730edfc1040be3cc21771b4fdcce283d58a88ca49051ab0","source":{"kind":"arxiv","id":"2006.08465","version":1},"attestation_state":"computed","paper":{"title":"Neural Certificates for Safe Control Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"eess.SY","authors_text":"Shaoshuai Mou, Wanxin Jin, Zhaoran Wang, Zhuoran Yang","submitted_at":"2020-06-15T15:14:18Z","abstract_excerpt":"This paper develops an approach to learn a policy of a dynamical system that is guaranteed to be both provably safe and goal-reaching. Here, the safety means that a policy must not drive the state of the system to any unsafe region, while the goal-reaching requires the trajectory of the controlled system asymptotically converges to a goal region (a generalization of stability). We obtain the safe and goal-reaching policy by jointly learning two additional certificate functions: a barrier function that guarantees the safety and a developed Lyapunov-like function to fulfill the goal-reaching req"},"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":"2006.08465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-06-15T15:14:18Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"c88a73f94764f175a47a88139d165b80235cd4a5dca2ae83875825bffb249b63","abstract_canon_sha256":"4ba3e932a7c3e36cbd12071245af52cbb6da982bf474ce7c69f9d1af5b563f16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:21.847832Z","signature_b64":"1Jko417QOif0bSypbq7Dtj6qZm2QhPHpKQ2C49hiII5ZcbdS4/tOvDWntOw8dk5Qu+BdSGtfJ3gzkjwFwL+jDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b7ad920c06dbf2ef730edfc1040be3cc21771b4fdcce283d58a88ca49051ab0","last_reissued_at":"2026-07-05T01:10:21.847363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:21.847363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Certificates for Safe Control Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"eess.SY","authors_text":"Shaoshuai Mou, Wanxin Jin, Zhaoran Wang, Zhuoran Yang","submitted_at":"2020-06-15T15:14:18Z","abstract_excerpt":"This paper develops an approach to learn a policy of a dynamical system that is guaranteed to be both provably safe and goal-reaching. Here, the safety means that a policy must not drive the state of the system to any unsafe region, while the goal-reaching requires the trajectory of the controlled system asymptotically converges to a goal region (a generalization of stability). We obtain the safe and goal-reaching policy by jointly learning two additional certificate functions: a barrier function that guarantees the safety and a developed Lyapunov-like function to fulfill the goal-reaching req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08465","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.08465/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":"2006.08465","created_at":"2026-07-05T01:10:21.847421+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.08465v1","created_at":"2026-07-05T01:10:21.847421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08465","created_at":"2026-07-05T01:10:21.847421+00:00"},{"alias_kind":"pith_short_12","alias_value":"TN5NSIGANW7S","created_at":"2026-07-05T01:10:21.847421+00:00"},{"alias_kind":"pith_short_16","alias_value":"TN5NSIGANW7S55ZQ","created_at":"2026-07-05T01:10:21.847421+00:00"},{"alias_kind":"pith_short_8","alias_value":"TN5NSIGA","created_at":"2026-07-05T01:10:21.847421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07892","citing_title":"Verification Framework for the Union of Control Barrier Functions","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2411.18235","citing_title":"Certified Training with Branch-and-Bound for Lyapunov-stable Neural Control","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TN5NSIGANW7S55ZQ5X6BAQF6HT","json":"https://pith.science/pith/TN5NSIGANW7S55ZQ5X6BAQF6HT.json","graph_json":"https://pith.science/api/pith-number/TN5NSIGANW7S55ZQ5X6BAQF6HT/graph.json","events_json":"https://pith.science/api/pith-number/TN5NSIGANW7S55ZQ5X6BAQF6HT/events.json","paper":"https://pith.science/paper/TN5NSIGA"},"agent_actions":{"view_html":"https://pith.science/pith/TN5NSIGANW7S55ZQ5X6BAQF6HT","download_json":"https://pith.science/pith/TN5NSIGANW7S55ZQ5X6BAQF6HT.json","view_paper":"https://pith.science/paper/TN5NSIGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.08465&json=true","fetch_graph":"https://pith.science/api/pith-number/TN5NSIGANW7S55ZQ5X6BAQF6HT/graph.json","fetch_events":"https://pith.science/api/pith-number/TN5NSIGANW7S55ZQ5X6BAQF6HT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TN5NSIGANW7S55ZQ5X6BAQF6HT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TN5NSIGANW7S55ZQ5X6BAQF6HT/action/storage_attestation","attest_author":"https://pith.science/pith/TN5NSIGANW7S55ZQ5X6BAQF6HT/action/author_attestation","sign_citation":"https://pith.science/pith/TN5NSIGANW7S55ZQ5X6BAQF6HT/action/citation_signature","submit_replication":"https://pith.science/pith/TN5NSIGANW7S55ZQ5X6BAQF6HT/action/replication_record"}},"created_at":"2026-07-05T01:10:21.847421+00:00","updated_at":"2026-07-05T01:10:21.847421+00:00"}