{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:N7NPNDHYLBUWS55P7EULICGACC","short_pith_number":"pith:N7NPNDHY","schema_version":"1.0","canonical_sha256":"6fdaf68cf858696977aff928b408c010b972296c28e14d71811cd646d7bb594f","source":{"kind":"arxiv","id":"2303.17618","version":4},"attestation_state":"computed","paper":{"title":"Data-driven abstractions via adaptive refinements and a Kantorovich metric [extended version]","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Adrien Banse, Alessandro Abate, Licio Romao, Rapha\\\"el M. Jungers","submitted_at":"2023-03-30T11:26:40Z","abstract_excerpt":"We introduce an adaptive refinement procedure for smart, and scalable abstraction of dynamical systems. Our technique relies on partitioning the state space depending on the observation of future outputs. However, this knowledge is dynamically constructed in an adaptive, asymmetric way. In order to learn the optimal structure, we define a Kantorovich-inspired metric between Markov chains, and we use it as a loss function. Our technique is prone to data-driven frameworks, but not restricted to.\n  We also study properties of the above mentioned metric between Markov chains, which we believe coul"},"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":"2303.17618","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-30T11:26:40Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"c8b9de424c16f9192a22f443c3afb904849eaabae299bed074a3d9485c844caa","abstract_canon_sha256":"eb530bdfb990ebaf13dd034955a7cba164bfe92ac96d2ee861d63e7f4c5d76b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:25.212441Z","signature_b64":"rBv8A+2SXKL5ATWMVrUqLiD+aDD/rsPsk4vmmBt/vP8GvxNzpzbmXprcuNP80/KaBjdmNzNsqGX0//Hh6Sw2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fdaf68cf858696977aff928b408c010b972296c28e14d71811cd646d7bb594f","last_reissued_at":"2026-07-05T07:06:25.211936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:25.211936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-driven abstractions via adaptive refinements and a Kantorovich metric [extended version]","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Adrien Banse, Alessandro Abate, Licio Romao, Rapha\\\"el M. Jungers","submitted_at":"2023-03-30T11:26:40Z","abstract_excerpt":"We introduce an adaptive refinement procedure for smart, and scalable abstraction of dynamical systems. Our technique relies on partitioning the state space depending on the observation of future outputs. However, this knowledge is dynamically constructed in an adaptive, asymmetric way. In order to learn the optimal structure, we define a Kantorovich-inspired metric between Markov chains, and we use it as a loss function. Our technique is prone to data-driven frameworks, but not restricted to.\n  We also study properties of the above mentioned metric between Markov chains, which we believe coul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17618","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/2303.17618/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":"2303.17618","created_at":"2026-07-05T07:06:25.212001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.17618v4","created_at":"2026-07-05T07:06:25.212001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17618","created_at":"2026-07-05T07:06:25.212001+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7NPNDHYLBUW","created_at":"2026-07-05T07:06:25.212001+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7NPNDHYLBUWS55P","created_at":"2026-07-05T07:06:25.212001+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7NPNDHY","created_at":"2026-07-05T07:06:25.212001+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.01191","citing_title":"Data-Driven Yet Formal Policy Synthesis for Stochastic Nonlinear Dynamical Systems","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N7NPNDHYLBUWS55P7EULICGACC","json":"https://pith.science/pith/N7NPNDHYLBUWS55P7EULICGACC.json","graph_json":"https://pith.science/api/pith-number/N7NPNDHYLBUWS55P7EULICGACC/graph.json","events_json":"https://pith.science/api/pith-number/N7NPNDHYLBUWS55P7EULICGACC/events.json","paper":"https://pith.science/paper/N7NPNDHY"},"agent_actions":{"view_html":"https://pith.science/pith/N7NPNDHYLBUWS55P7EULICGACC","download_json":"https://pith.science/pith/N7NPNDHYLBUWS55P7EULICGACC.json","view_paper":"https://pith.science/paper/N7NPNDHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.17618&json=true","fetch_graph":"https://pith.science/api/pith-number/N7NPNDHYLBUWS55P7EULICGACC/graph.json","fetch_events":"https://pith.science/api/pith-number/N7NPNDHYLBUWS55P7EULICGACC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7NPNDHYLBUWS55P7EULICGACC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7NPNDHYLBUWS55P7EULICGACC/action/storage_attestation","attest_author":"https://pith.science/pith/N7NPNDHYLBUWS55P7EULICGACC/action/author_attestation","sign_citation":"https://pith.science/pith/N7NPNDHYLBUWS55P7EULICGACC/action/citation_signature","submit_replication":"https://pith.science/pith/N7NPNDHYLBUWS55P7EULICGACC/action/replication_record"}},"created_at":"2026-07-05T07:06:25.212001+00:00","updated_at":"2026-07-05T07:06:25.212001+00:00"}