{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AP3NZ4E2YZDXOWMQPER7C5HUOG","short_pith_number":"pith:AP3NZ4E2","schema_version":"1.0","canonical_sha256":"03f6dcf09ac6477759907923f174f47198499fa9c49a49d5b6bb5f1b48074396","source":{"kind":"arxiv","id":"2403.05350","version":1},"attestation_state":"computed","paper":{"title":"Formal Verification of Unknown Stochastic Systems via Non-parametric Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Chenyu Ma, Sadegh Soudjani, Saleh Soudijani, Zhi Zhang","submitted_at":"2024-03-08T14:31:20Z","abstract_excerpt":"A novel data-driven method for formal verification is proposed to study complex systems operating in safety-critical domains. The proposed approach is able to formally verify discrete-time stochastic dynamical systems against temporal logic specifications only using observation samples and without the knowledge of the model, and provide a probabilistic guarantee on the satisfaction of the specification. We first propose the theoretical results for using non-parametric estimation to estimate an asymptotic upper bound for the \\emph{Lipschitz constant} of the stochastic system, which can determin"},"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.05350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-03-08T14:31:20Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b2bbebae0536024d59d64390ab9a2de0d99393f05070e2479bcd5cf72a1a3d1e","abstract_canon_sha256":"0392a76231e1a98a608f89febfbb8cc5a77c05e4d1172a2195febdd02d376e44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:54.160196Z","signature_b64":"Ga425SxyUgLi4bNagYamJnj44vLS4aj6e8OGh7hOtFBn6pCA/1Cr3w+r3P0xiWdE6Rs20v+07b1HWloWSR8sAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03f6dcf09ac6477759907923f174f47198499fa9c49a49d5b6bb5f1b48074396","last_reissued_at":"2026-07-05T07:53:54.159700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:54.159700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Verification of Unknown Stochastic Systems via Non-parametric Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Chenyu Ma, Sadegh Soudjani, Saleh Soudijani, Zhi Zhang","submitted_at":"2024-03-08T14:31:20Z","abstract_excerpt":"A novel data-driven method for formal verification is proposed to study complex systems operating in safety-critical domains. The proposed approach is able to formally verify discrete-time stochastic dynamical systems against temporal logic specifications only using observation samples and without the knowledge of the model, and provide a probabilistic guarantee on the satisfaction of the specification. We first propose the theoretical results for using non-parametric estimation to estimate an asymptotic upper bound for the \\emph{Lipschitz constant} of the stochastic system, which can determin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05350","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.05350/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.05350","created_at":"2026-07-05T07:53:54.159760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.05350v1","created_at":"2026-07-05T07:53:54.159760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05350","created_at":"2026-07-05T07:53:54.159760+00:00"},{"alias_kind":"pith_short_12","alias_value":"AP3NZ4E2YZDX","created_at":"2026-07-05T07:53:54.159760+00:00"},{"alias_kind":"pith_short_16","alias_value":"AP3NZ4E2YZDXOWMQ","created_at":"2026-07-05T07:53:54.159760+00:00"},{"alias_kind":"pith_short_8","alias_value":"AP3NZ4E2","created_at":"2026-07-05T07:53:54.159760+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.14668","citing_title":"A Byzantine Fault Tolerance Approach towards AI Safety","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AP3NZ4E2YZDXOWMQPER7C5HUOG","json":"https://pith.science/pith/AP3NZ4E2YZDXOWMQPER7C5HUOG.json","graph_json":"https://pith.science/api/pith-number/AP3NZ4E2YZDXOWMQPER7C5HUOG/graph.json","events_json":"https://pith.science/api/pith-number/AP3NZ4E2YZDXOWMQPER7C5HUOG/events.json","paper":"https://pith.science/paper/AP3NZ4E2"},"agent_actions":{"view_html":"https://pith.science/pith/AP3NZ4E2YZDXOWMQPER7C5HUOG","download_json":"https://pith.science/pith/AP3NZ4E2YZDXOWMQPER7C5HUOG.json","view_paper":"https://pith.science/paper/AP3NZ4E2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.05350&json=true","fetch_graph":"https://pith.science/api/pith-number/AP3NZ4E2YZDXOWMQPER7C5HUOG/graph.json","fetch_events":"https://pith.science/api/pith-number/AP3NZ4E2YZDXOWMQPER7C5HUOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AP3NZ4E2YZDXOWMQPER7C5HUOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AP3NZ4E2YZDXOWMQPER7C5HUOG/action/storage_attestation","attest_author":"https://pith.science/pith/AP3NZ4E2YZDXOWMQPER7C5HUOG/action/author_attestation","sign_citation":"https://pith.science/pith/AP3NZ4E2YZDXOWMQPER7C5HUOG/action/citation_signature","submit_replication":"https://pith.science/pith/AP3NZ4E2YZDXOWMQPER7C5HUOG/action/replication_record"}},"created_at":"2026-07-05T07:53:54.159760+00:00","updated_at":"2026-07-05T07:53:54.159760+00:00"}