{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K7W56T4P365O6M73VNWF56S5GI","short_pith_number":"pith:K7W56T4P","schema_version":"1.0","canonical_sha256":"57eddf4f8fdfbaef33fbab6c5efa5d322c793b9e83001a98d5276bfcd514383b","source":{"kind":"arxiv","id":"2406.00826","version":4},"attestation_state":"computed","paper":{"title":"Policy Verification in Stochastic Dynamical Systems Using Logarithmic Neural Certificates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Nils Jansen, Sebastian Junges, Thom Badings, Wietze Koops","submitted_at":"2024-06-02T18:19:19Z","abstract_excerpt":"We consider the verification of neural network policies for discrete-time stochastic systems with respect to reach-avoid specifications. We use a learner-verifier procedure that learns a certificate for the specification, represented as a neural network. Verifying that this neural network certificate is a so-called reach-avoid supermartingale (RASM) proves the satisfaction of a reach-avoid specification. Existing approaches for such a verification task rely on computed Lipschitz constants of neural networks. These approaches struggle with large Lipschitz constants, especially for reach-avoid 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":"2406.00826","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-02T18:19:19Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"22669128fe87fe03b0e2d801daa491c97a3e8ee6a5d5a209533dfd4a60c207c5","abstract_canon_sha256":"97231df6bc235595a3feb319e41c55e136237ca644d562a8f5d938e6204d4ad3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:03.293581Z","signature_b64":"ylLDqZlQll2zKBSSNv8Zadn+Idb+hl9jw9YSwRhOBeqvksxzPt/jksfhtNSx3ZjRUbHK8QGsmJ2GPR6ElR5IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57eddf4f8fdfbaef33fbab6c5efa5d322c793b9e83001a98d5276bfcd514383b","last_reissued_at":"2026-07-05T11:39:03.293060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:03.293060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Policy Verification in Stochastic Dynamical Systems Using Logarithmic Neural Certificates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Nils Jansen, Sebastian Junges, Thom Badings, Wietze Koops","submitted_at":"2024-06-02T18:19:19Z","abstract_excerpt":"We consider the verification of neural network policies for discrete-time stochastic systems with respect to reach-avoid specifications. We use a learner-verifier procedure that learns a certificate for the specification, represented as a neural network. Verifying that this neural network certificate is a so-called reach-avoid supermartingale (RASM) proves the satisfaction of a reach-avoid specification. Existing approaches for such a verification task rely on computed Lipschitz constants of neural networks. These approaches struggle with large Lipschitz constants, especially for reach-avoid s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.00826","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/2406.00826/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":"2406.00826","created_at":"2026-07-05T11:39:03.293139+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.00826v4","created_at":"2026-07-05T11:39:03.293139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.00826","created_at":"2026-07-05T11:39:03.293139+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7W56T4P365O","created_at":"2026-07-05T11:39:03.293139+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7W56T4P365O6M73","created_at":"2026-07-05T11:39:03.293139+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7W56T4P","created_at":"2026-07-05T11:39:03.293139+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/K7W56T4P365O6M73VNWF56S5GI","json":"https://pith.science/pith/K7W56T4P365O6M73VNWF56S5GI.json","graph_json":"https://pith.science/api/pith-number/K7W56T4P365O6M73VNWF56S5GI/graph.json","events_json":"https://pith.science/api/pith-number/K7W56T4P365O6M73VNWF56S5GI/events.json","paper":"https://pith.science/paper/K7W56T4P"},"agent_actions":{"view_html":"https://pith.science/pith/K7W56T4P365O6M73VNWF56S5GI","download_json":"https://pith.science/pith/K7W56T4P365O6M73VNWF56S5GI.json","view_paper":"https://pith.science/paper/K7W56T4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.00826&json=true","fetch_graph":"https://pith.science/api/pith-number/K7W56T4P365O6M73VNWF56S5GI/graph.json","fetch_events":"https://pith.science/api/pith-number/K7W56T4P365O6M73VNWF56S5GI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7W56T4P365O6M73VNWF56S5GI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7W56T4P365O6M73VNWF56S5GI/action/storage_attestation","attest_author":"https://pith.science/pith/K7W56T4P365O6M73VNWF56S5GI/action/author_attestation","sign_citation":"https://pith.science/pith/K7W56T4P365O6M73VNWF56S5GI/action/citation_signature","submit_replication":"https://pith.science/pith/K7W56T4P365O6M73VNWF56S5GI/action/replication_record"}},"created_at":"2026-07-05T11:39:03.293139+00:00","updated_at":"2026-07-05T11:39:03.293139+00:00"}