{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ALNNKXGTZE7ZFP7EZZSX4VUDVV","short_pith_number":"pith:ALNNKXGT","schema_version":"1.0","canonical_sha256":"02dad55cd3c93f92bfe4ce657e5683ad6ff0cc51899c80f228fb07349c238626","source":{"kind":"arxiv","id":"2211.01793","version":2},"attestation_state":"computed","paper":{"title":"Data-driven Abstractions for Verification of Deterministic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Andrea Peruffo, Manuel Mazo Jr, Rudi Coppola","submitted_at":"2022-11-03T13:25:27Z","abstract_excerpt":"A common technique to verify complex logic specifications for dynamical systems is the construction of symbolic abstractions: simpler, finite-state models whose behaviour mimics the one of the systems of interest. Typically, abstractions are constructed exploiting an accurate knowledge of the underlying model: in real-life applications, this may be a costly assumption. By sampling random $\\ell$-step trajectories of an unknown system, we build an abstraction based on the notion of $\\ell$-completeness. We newly define the notion of probabilistic behavioural inclusion, and provide probably approx"},"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":"2211.01793","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2022-11-03T13:25:27Z","cross_cats_sorted":["cs.LO","cs.SY"],"title_canon_sha256":"5331307490c7f17cc224fd2a8fbcac0669ee6aa86aa7853c410f96f1210206e4","abstract_canon_sha256":"39e3e999eb242a75047319d6a4324211b3ff68503efeedea5f9fdc8866e66852"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:00.826514Z","signature_b64":"k0HxFGsSD0sipdSiAknR3TDU7HCG8otWjyBebmj/2iKMZBDXkj+mXWPBcGdu+WFcwWfEI8lYSA8MQPrQmgDFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02dad55cd3c93f92bfe4ce657e5683ad6ff0cc51899c80f228fb07349c238626","last_reissued_at":"2026-07-05T05:56:00.825944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:00.825944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-driven Abstractions for Verification of Deterministic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Andrea Peruffo, Manuel Mazo Jr, Rudi Coppola","submitted_at":"2022-11-03T13:25:27Z","abstract_excerpt":"A common technique to verify complex logic specifications for dynamical systems is the construction of symbolic abstractions: simpler, finite-state models whose behaviour mimics the one of the systems of interest. Typically, abstractions are constructed exploiting an accurate knowledge of the underlying model: in real-life applications, this may be a costly assumption. By sampling random $\\ell$-step trajectories of an unknown system, we build an abstraction based on the notion of $\\ell$-completeness. We newly define the notion of probabilistic behavioural inclusion, and provide probably approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01793","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/2211.01793/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":"2211.01793","created_at":"2026-07-05T05:56:00.826004+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.01793v2","created_at":"2026-07-05T05:56:00.826004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01793","created_at":"2026-07-05T05:56:00.826004+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALNNKXGTZE7Z","created_at":"2026-07-05T05:56:00.826004+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALNNKXGTZE7ZFP7E","created_at":"2026-07-05T05:56:00.826004+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALNNKXGT","created_at":"2026-07-05T05:56:00.826004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.03932","citing_title":"A Physics-Informed Scenario Approach with Data Mitigation for Safety Verification of Nonlinear Systems","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALNNKXGTZE7ZFP7EZZSX4VUDVV","json":"https://pith.science/pith/ALNNKXGTZE7ZFP7EZZSX4VUDVV.json","graph_json":"https://pith.science/api/pith-number/ALNNKXGTZE7ZFP7EZZSX4VUDVV/graph.json","events_json":"https://pith.science/api/pith-number/ALNNKXGTZE7ZFP7EZZSX4VUDVV/events.json","paper":"https://pith.science/paper/ALNNKXGT"},"agent_actions":{"view_html":"https://pith.science/pith/ALNNKXGTZE7ZFP7EZZSX4VUDVV","download_json":"https://pith.science/pith/ALNNKXGTZE7ZFP7EZZSX4VUDVV.json","view_paper":"https://pith.science/paper/ALNNKXGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.01793&json=true","fetch_graph":"https://pith.science/api/pith-number/ALNNKXGTZE7ZFP7EZZSX4VUDVV/graph.json","fetch_events":"https://pith.science/api/pith-number/ALNNKXGTZE7ZFP7EZZSX4VUDVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALNNKXGTZE7ZFP7EZZSX4VUDVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALNNKXGTZE7ZFP7EZZSX4VUDVV/action/storage_attestation","attest_author":"https://pith.science/pith/ALNNKXGTZE7ZFP7EZZSX4VUDVV/action/author_attestation","sign_citation":"https://pith.science/pith/ALNNKXGTZE7ZFP7EZZSX4VUDVV/action/citation_signature","submit_replication":"https://pith.science/pith/ALNNKXGTZE7ZFP7EZZSX4VUDVV/action/replication_record"}},"created_at":"2026-07-05T05:56:00.826004+00:00","updated_at":"2026-07-05T05:56:00.826004+00:00"}