{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HDFWMQPIKK47U3WQJMDCCMI7E2","short_pith_number":"pith:HDFWMQPI","schema_version":"1.0","canonical_sha256":"38cb6641e852b9fa6ed04b0621311f26aa193a941feadb6cbe21b140bb69c1a5","source":{"kind":"arxiv","id":"2408.08497","version":2},"attestation_state":"computed","paper":{"title":"Data-driven Construction of Finite Abstractions for Interconnected Systems: A Compositional Approach","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Daniel Ajeleye, Majid Zamani","submitted_at":"2024-08-16T02:42:17Z","abstract_excerpt":"Finite-state abstractions (a.k.a. symbolic models) present a promising avenue for the formal verification and synthesis of controllers in continuous-space control systems. These abstractions provide simplified models that capture the fundamental behaviors of the original systems. However, the creation of such abstractions typically relies on the availability of precise knowledge concerning system dynamics, which might not be available in many real-world applications. In this work, we introduce a novel data-driven and compositional approach for constructing finite abstractions for interconnecte"},"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":"2408.08497","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2024-08-16T02:42:17Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"8f378b05a17182ec2dd83281cc926af18733808ba3ccb6ae1ce56cffbbe41c40","abstract_canon_sha256":"02101e28ff21168df496711e108415da8df60833f112f273960a5f8df44c2aa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:09.599322Z","signature_b64":"+pPUmzUzhm4msyTteRVKFhUZOUPn6VpjBgXT0xBIZhdzckVHYSYX8j52qafHokFcaV94b4UAJBwDLIL89bcvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38cb6641e852b9fa6ed04b0621311f26aa193a941feadb6cbe21b140bb69c1a5","last_reissued_at":"2026-07-05T10:18:09.598834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:09.598834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-driven Construction of Finite Abstractions for Interconnected Systems: A Compositional Approach","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Daniel Ajeleye, Majid Zamani","submitted_at":"2024-08-16T02:42:17Z","abstract_excerpt":"Finite-state abstractions (a.k.a. symbolic models) present a promising avenue for the formal verification and synthesis of controllers in continuous-space control systems. These abstractions provide simplified models that capture the fundamental behaviors of the original systems. However, the creation of such abstractions typically relies on the availability of precise knowledge concerning system dynamics, which might not be available in many real-world applications. In this work, we introduce a novel data-driven and compositional approach for constructing finite abstractions for interconnecte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08497","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/2408.08497/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":"2408.08497","created_at":"2026-07-05T10:18:09.598917+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.08497v2","created_at":"2026-07-05T10:18:09.598917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08497","created_at":"2026-07-05T10:18:09.598917+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDFWMQPIKK47","created_at":"2026-07-05T10:18:09.598917+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDFWMQPIKK47U3WQ","created_at":"2026-07-05T10:18:09.598917+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDFWMQPI","created_at":"2026-07-05T10:18:09.598917+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.12014","citing_title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDFWMQPIKK47U3WQJMDCCMI7E2","json":"https://pith.science/pith/HDFWMQPIKK47U3WQJMDCCMI7E2.json","graph_json":"https://pith.science/api/pith-number/HDFWMQPIKK47U3WQJMDCCMI7E2/graph.json","events_json":"https://pith.science/api/pith-number/HDFWMQPIKK47U3WQJMDCCMI7E2/events.json","paper":"https://pith.science/paper/HDFWMQPI"},"agent_actions":{"view_html":"https://pith.science/pith/HDFWMQPIKK47U3WQJMDCCMI7E2","download_json":"https://pith.science/pith/HDFWMQPIKK47U3WQJMDCCMI7E2.json","view_paper":"https://pith.science/paper/HDFWMQPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.08497&json=true","fetch_graph":"https://pith.science/api/pith-number/HDFWMQPIKK47U3WQJMDCCMI7E2/graph.json","fetch_events":"https://pith.science/api/pith-number/HDFWMQPIKK47U3WQJMDCCMI7E2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDFWMQPIKK47U3WQJMDCCMI7E2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDFWMQPIKK47U3WQJMDCCMI7E2/action/storage_attestation","attest_author":"https://pith.science/pith/HDFWMQPIKK47U3WQJMDCCMI7E2/action/author_attestation","sign_citation":"https://pith.science/pith/HDFWMQPIKK47U3WQJMDCCMI7E2/action/citation_signature","submit_replication":"https://pith.science/pith/HDFWMQPIKK47U3WQJMDCCMI7E2/action/replication_record"}},"created_at":"2026-07-05T10:18:09.598917+00:00","updated_at":"2026-07-05T10:18:09.598917+00:00"}