{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C5J4ZPYMN3SEK7EWZBSL6ECCNO","short_pith_number":"pith:C5J4ZPYM","schema_version":"1.0","canonical_sha256":"1753ccbf0c6ee4457c96c864bf10426b8ed8b26910614b72ce06105478b17b91","source":{"kind":"arxiv","id":"2403.07308","version":1},"attestation_state":"computed","paper":{"title":"Verification-Aided Learning of Neural Network Barrier Functions with Termination Guarantees","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Lekan Molu, Mahyar Fazlyab, Shaoru Chen","submitted_at":"2024-03-12T04:29:43Z","abstract_excerpt":"Barrier functions are a general framework for establishing a safety guarantee for a system. However, there is no general method for finding these functions. To address this shortcoming, recent approaches use self-supervised learning techniques to learn these functions using training data that are periodically generated by a verification procedure, leading to a verification-aided learning framework. Despite its immense potential in automating barrier function synthesis, the verification-aided learning framework does not have termination guarantees and may suffer from a low success rate of findi"},"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":"2403.07308","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-12T04:29:43Z","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"title_canon_sha256":"05456344047923b7474c4a6c7d3b3791ca34823257bb83c92b7b16928ed776f6","abstract_canon_sha256":"f101b417dbcf302fdf573171994a76803f676d0bbb04d4c94a94378758703c84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:02.035716Z","signature_b64":"dYR4zVg3IWZamyIHZvSX4xLTAzIMkDanlhD2A3wolmgxpnBq0txRaNyeWCUui5ep/f1JtGWKR+zzGyTeZD9xAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1753ccbf0c6ee4457c96c864bf10426b8ed8b26910614b72ce06105478b17b91","last_reissued_at":"2026-07-05T07:55:02.035109Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:02.035109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification-Aided Learning of Neural Network Barrier Functions with Termination Guarantees","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Lekan Molu, Mahyar Fazlyab, Shaoru Chen","submitted_at":"2024-03-12T04:29:43Z","abstract_excerpt":"Barrier functions are a general framework for establishing a safety guarantee for a system. However, there is no general method for finding these functions. To address this shortcoming, recent approaches use self-supervised learning techniques to learn these functions using training data that are periodically generated by a verification procedure, leading to a verification-aided learning framework. Despite its immense potential in automating barrier function synthesis, the verification-aided learning framework does not have termination guarantees and may suffer from a low success rate of findi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07308","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/2403.07308/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":"2403.07308","created_at":"2026-07-05T07:55:02.035225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.07308v1","created_at":"2026-07-05T07:55:02.035225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07308","created_at":"2026-07-05T07:55:02.035225+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5J4ZPYMN3SE","created_at":"2026-07-05T07:55:02.035225+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5J4ZPYMN3SEK7EW","created_at":"2026-07-05T07:55:02.035225+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5J4ZPYM","created_at":"2026-07-05T07:55:02.035225+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07757","citing_title":"Efficient Verification of Neural Control Barrier Functions with Smooth Nonlinear Activations","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5J4ZPYMN3SEK7EWZBSL6ECCNO","json":"https://pith.science/pith/C5J4ZPYMN3SEK7EWZBSL6ECCNO.json","graph_json":"https://pith.science/api/pith-number/C5J4ZPYMN3SEK7EWZBSL6ECCNO/graph.json","events_json":"https://pith.science/api/pith-number/C5J4ZPYMN3SEK7EWZBSL6ECCNO/events.json","paper":"https://pith.science/paper/C5J4ZPYM"},"agent_actions":{"view_html":"https://pith.science/pith/C5J4ZPYMN3SEK7EWZBSL6ECCNO","download_json":"https://pith.science/pith/C5J4ZPYMN3SEK7EWZBSL6ECCNO.json","view_paper":"https://pith.science/paper/C5J4ZPYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.07308&json=true","fetch_graph":"https://pith.science/api/pith-number/C5J4ZPYMN3SEK7EWZBSL6ECCNO/graph.json","fetch_events":"https://pith.science/api/pith-number/C5J4ZPYMN3SEK7EWZBSL6ECCNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5J4ZPYMN3SEK7EWZBSL6ECCNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5J4ZPYMN3SEK7EWZBSL6ECCNO/action/storage_attestation","attest_author":"https://pith.science/pith/C5J4ZPYMN3SEK7EWZBSL6ECCNO/action/author_attestation","sign_citation":"https://pith.science/pith/C5J4ZPYMN3SEK7EWZBSL6ECCNO/action/citation_signature","submit_replication":"https://pith.science/pith/C5J4ZPYMN3SEK7EWZBSL6ECCNO/action/replication_record"}},"created_at":"2026-07-05T07:55:02.035225+00:00","updated_at":"2026-07-05T07:55:02.035225+00:00"}