{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:32RSPQLUMD4AN2J5YBNSJL5YNQ","short_pith_number":"pith:32RSPQLU","schema_version":"1.0","canonical_sha256":"dea327c17460f806e93dc05b24afb86c20e84d1c55288027862739674ad2a88b","source":{"kind":"arxiv","id":"2007.03251","version":2},"attestation_state":"computed","paper":{"title":"Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Alessandro Abate, Andrea Peruffo, Daniele Ahmed","submitted_at":"2020-07-07T07:39:42Z","abstract_excerpt":"We introduce an automated, formal, counterexample-based approach to synthesise Barrier Certificates (BC) for the safety verification of continuous and hybrid dynamical models. The approach is underpinned by an inductive framework: this is structured as a sequential loop between a learner, which manipulates a candidate BC structured as a neural network, and a sound verifier, which either certifies the candidate's validity or generates counter-examples to further guide the learner. We compare the approach against state-of-the-art techniques, over polynomial and non-polynomial dynamical models: t"},"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":"2007.03251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-07-07T07:39:42Z","cross_cats_sorted":["cs.LG","cs.LO","cs.SY"],"title_canon_sha256":"7ab787af3c47f0f51033079e6c68115128ba95939fd0aab2252ef0c9d32ad5b0","abstract_canon_sha256":"79a265fc95a410c0e5d5ca17414130c735d443c7db1748ab0fc4ef535d3bd327"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:58.025791Z","signature_b64":"vZUiwqWkWkuQPv+vmx+PZ/GAVKsok7nKYocex2FngdlFqjz2jRbfN+H8VTf0kMYWcwJ4BMNPQIMC4nOEtigXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dea327c17460f806e93dc05b24afb86c20e84d1c55288027862739674ad2a88b","last_reissued_at":"2026-07-05T01:43:58.025345Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:58.025345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Alessandro Abate, Andrea Peruffo, Daniele Ahmed","submitted_at":"2020-07-07T07:39:42Z","abstract_excerpt":"We introduce an automated, formal, counterexample-based approach to synthesise Barrier Certificates (BC) for the safety verification of continuous and hybrid dynamical models. The approach is underpinned by an inductive framework: this is structured as a sequential loop between a learner, which manipulates a candidate BC structured as a neural network, and a sound verifier, which either certifies the candidate's validity or generates counter-examples to further guide the learner. We compare the approach against state-of-the-art techniques, over polynomial and non-polynomial dynamical models: t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03251","kind":"arxiv","version":2},"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/2007.03251/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":"2007.03251","created_at":"2026-07-05T01:43:58.025403+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03251v2","created_at":"2026-07-05T01:43:58.025403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03251","created_at":"2026-07-05T01:43:58.025403+00:00"},{"alias_kind":"pith_short_12","alias_value":"32RSPQLUMD4A","created_at":"2026-07-05T01:43:58.025403+00:00"},{"alias_kind":"pith_short_16","alias_value":"32RSPQLUMD4AN2J5","created_at":"2026-07-05T01:43:58.025403+00:00"},{"alias_kind":"pith_short_8","alias_value":"32RSPQLU","created_at":"2026-07-05T01:43:58.025403+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.17275","citing_title":"Conformal Safety Shielding for Imperfect-Perception Agents","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32RSPQLUMD4AN2J5YBNSJL5YNQ","json":"https://pith.science/pith/32RSPQLUMD4AN2J5YBNSJL5YNQ.json","graph_json":"https://pith.science/api/pith-number/32RSPQLUMD4AN2J5YBNSJL5YNQ/graph.json","events_json":"https://pith.science/api/pith-number/32RSPQLUMD4AN2J5YBNSJL5YNQ/events.json","paper":"https://pith.science/paper/32RSPQLU"},"agent_actions":{"view_html":"https://pith.science/pith/32RSPQLUMD4AN2J5YBNSJL5YNQ","download_json":"https://pith.science/pith/32RSPQLUMD4AN2J5YBNSJL5YNQ.json","view_paper":"https://pith.science/paper/32RSPQLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03251&json=true","fetch_graph":"https://pith.science/api/pith-number/32RSPQLUMD4AN2J5YBNSJL5YNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/32RSPQLUMD4AN2J5YBNSJL5YNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32RSPQLUMD4AN2J5YBNSJL5YNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32RSPQLUMD4AN2J5YBNSJL5YNQ/action/storage_attestation","attest_author":"https://pith.science/pith/32RSPQLUMD4AN2J5YBNSJL5YNQ/action/author_attestation","sign_citation":"https://pith.science/pith/32RSPQLUMD4AN2J5YBNSJL5YNQ/action/citation_signature","submit_replication":"https://pith.science/pith/32RSPQLUMD4AN2J5YBNSJL5YNQ/action/replication_record"}},"created_at":"2026-07-05T01:43:58.025403+00:00","updated_at":"2026-07-05T01:43:58.025403+00:00"}