{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:H5CQHMAIBVWC2QEJ56VI4WLSE3","short_pith_number":"pith:H5CQHMAI","schema_version":"1.0","canonical_sha256":"3f4503b0080d6c2d4089efaa8e597226ea53505e406db96acb5a84c96ecdd734","source":{"kind":"arxiv","id":"2605.20108","version":1},"attestation_state":"computed","paper":{"title":"k-Inductive Neural Barrier Certificates for Unknown Nonlinear Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.LO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Abolfazl Lavaei, Ben Wooding, Hongchao Zhang, Taylor T. Johnson","submitted_at":"2026-05-19T16:58:37Z","abstract_excerpt":"While conventional (k=1) discrete-time barrier certificate conditions impose strict safety constraints by requiring the function to be non-increasing at every step, k-inductive barrier certificates relax this by allowing a temporary increase -- up to k-1 times, each within a threshold $\\epsilon$ -- while maintaining overall safety, and improving flexibility. This paper leverages neural networks and constructs k-inductive neural barrier certificates (k-NBCs) for (partially) unknown nonlinear systems. While neural networks offer scalability in the design process, they lack formal guarantees, 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":"2605.20108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-05-19T16:58:37Z","cross_cats_sorted":["cs.AI","cs.LG","cs.LO","cs.SY"],"title_canon_sha256":"46f24c3b2f3bfdc02c208a0ea541d27bcdddbfff35793970862a178318d75968","abstract_canon_sha256":"72ba3a31cdd65bbcc077689faa7f0f7f4d3041e957794b7f1bc98bbd1bb638d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:06:02.359575Z","signature_b64":"iNeVz/QLEOUl7hy7xSUTd7Y5nrkoR/demN/pTal67EbVttNRh8tUd9hCtKmYrw/l0n+DsZ7vzjBPruYlYGBdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f4503b0080d6c2d4089efaa8e597226ea53505e406db96acb5a84c96ecdd734","last_reissued_at":"2026-05-20T02:06:02.358913Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:06:02.358913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-Inductive Neural Barrier Certificates for Unknown Nonlinear Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.LO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Abolfazl Lavaei, Ben Wooding, Hongchao Zhang, Taylor T. Johnson","submitted_at":"2026-05-19T16:58:37Z","abstract_excerpt":"While conventional (k=1) discrete-time barrier certificate conditions impose strict safety constraints by requiring the function to be non-increasing at every step, k-inductive barrier certificates relax this by allowing a temporary increase -- up to k-1 times, each within a threshold $\\epsilon$ -- while maintaining overall safety, and improving flexibility. This paper leverages neural networks and constructs k-inductive neural barrier certificates (k-NBCs) for (partially) unknown nonlinear systems. While neural networks offer scalability in the design process, they lack formal guarantees, req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20108","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/2605.20108/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":"2605.20108","created_at":"2026-05-20T02:06:02.359012+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20108v1","created_at":"2026-05-20T02:06:02.359012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20108","created_at":"2026-05-20T02:06:02.359012+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5CQHMAIBVWC","created_at":"2026-05-20T02:06:02.359012+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5CQHMAIBVWC2QEJ","created_at":"2026-05-20T02:06:02.359012+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5CQHMAI","created_at":"2026-05-20T02:06:02.359012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H5CQHMAIBVWC2QEJ56VI4WLSE3","json":"https://pith.science/pith/H5CQHMAIBVWC2QEJ56VI4WLSE3.json","graph_json":"https://pith.science/api/pith-number/H5CQHMAIBVWC2QEJ56VI4WLSE3/graph.json","events_json":"https://pith.science/api/pith-number/H5CQHMAIBVWC2QEJ56VI4WLSE3/events.json","paper":"https://pith.science/paper/H5CQHMAI"},"agent_actions":{"view_html":"https://pith.science/pith/H5CQHMAIBVWC2QEJ56VI4WLSE3","download_json":"https://pith.science/pith/H5CQHMAIBVWC2QEJ56VI4WLSE3.json","view_paper":"https://pith.science/paper/H5CQHMAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20108&json=true","fetch_graph":"https://pith.science/api/pith-number/H5CQHMAIBVWC2QEJ56VI4WLSE3/graph.json","fetch_events":"https://pith.science/api/pith-number/H5CQHMAIBVWC2QEJ56VI4WLSE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5CQHMAIBVWC2QEJ56VI4WLSE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5CQHMAIBVWC2QEJ56VI4WLSE3/action/storage_attestation","attest_author":"https://pith.science/pith/H5CQHMAIBVWC2QEJ56VI4WLSE3/action/author_attestation","sign_citation":"https://pith.science/pith/H5CQHMAIBVWC2QEJ56VI4WLSE3/action/citation_signature","submit_replication":"https://pith.science/pith/H5CQHMAIBVWC2QEJ56VI4WLSE3/action/replication_record"}},"created_at":"2026-05-20T02:06:02.359012+00:00","updated_at":"2026-05-20T02:06:02.359012+00:00"}