{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3NGG47MTGN2I37DISZOAFLP4M5","short_pith_number":"pith:3NGG47MT","schema_version":"1.0","canonical_sha256":"db4c6e7d9333748dfc68965c02adfc677d3eae0b066ee2416921e430bca22d29","source":{"kind":"arxiv","id":"2507.15093","version":1},"attestation_state":"computed","paper":{"title":"Exact Finite Koopman Embedding of Block-Oriented Polynomial Systems","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Lucian Cristian Iacob, Maarten Schoukens, Roland T\\'oth","submitted_at":"2025-07-20T19:18:17Z","abstract_excerpt":"The challenge of finding exact and finite-dimensional Koopman embeddings of nonlinear systems has been largely circumvented by employing data-driven techniques to learn models of different complexities (e.g., linear, bilinear, input affine). Although these models may provide good accuracy, selecting the model structure and dimension is still ad-hoc and it is difficult to quantify the error that is introduced. In contrast to the general trend of data-driven learning, in this paper, we develop a systematic technique for nonlinear systems that produces a finite-dimensional and exact embedding. If"},"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":"2507.15093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"eess.SY","submitted_at":"2025-07-20T19:18:17Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c30a32719da5254f4a836ddd81e8e9252596bf488d548042cae50ee490983503","abstract_canon_sha256":"155ad041d68388b2d0e19fbf789310f8f48070e28bc69379284989b7ed0d5083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:18.428591Z","signature_b64":"OXFea7i2pHcYZwg5DlYvl/7i8mDY4MLi+pzoaKH+F0PF5PHJZjepGWs0DDWErfvL8m3JTKgoeXHExIXvB84aDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db4c6e7d9333748dfc68965c02adfc677d3eae0b066ee2416921e430bca22d29","last_reissued_at":"2026-07-05T11:40:18.428102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:18.428102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Finite Koopman Embedding of Block-Oriented Polynomial Systems","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Lucian Cristian Iacob, Maarten Schoukens, Roland T\\'oth","submitted_at":"2025-07-20T19:18:17Z","abstract_excerpt":"The challenge of finding exact and finite-dimensional Koopman embeddings of nonlinear systems has been largely circumvented by employing data-driven techniques to learn models of different complexities (e.g., linear, bilinear, input affine). Although these models may provide good accuracy, selecting the model structure and dimension is still ad-hoc and it is difficult to quantify the error that is introduced. In contrast to the general trend of data-driven learning, in this paper, we develop a systematic technique for nonlinear systems that produces a finite-dimensional and exact embedding. If"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15093","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/2507.15093/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":"2507.15093","created_at":"2026-07-05T11:40:18.428164+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15093v1","created_at":"2026-07-05T11:40:18.428164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15093","created_at":"2026-07-05T11:40:18.428164+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NGG47MTGN2I","created_at":"2026-07-05T11:40:18.428164+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NGG47MTGN2I37DI","created_at":"2026-07-05T11:40:18.428164+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NGG47MT","created_at":"2026-07-05T11:40:18.428164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.09646","citing_title":"Learning Koopman Models From Data Under General Noise Conditions","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3NGG47MTGN2I37DISZOAFLP4M5","json":"https://pith.science/pith/3NGG47MTGN2I37DISZOAFLP4M5.json","graph_json":"https://pith.science/api/pith-number/3NGG47MTGN2I37DISZOAFLP4M5/graph.json","events_json":"https://pith.science/api/pith-number/3NGG47MTGN2I37DISZOAFLP4M5/events.json","paper":"https://pith.science/paper/3NGG47MT"},"agent_actions":{"view_html":"https://pith.science/pith/3NGG47MTGN2I37DISZOAFLP4M5","download_json":"https://pith.science/pith/3NGG47MTGN2I37DISZOAFLP4M5.json","view_paper":"https://pith.science/paper/3NGG47MT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15093&json=true","fetch_graph":"https://pith.science/api/pith-number/3NGG47MTGN2I37DISZOAFLP4M5/graph.json","fetch_events":"https://pith.science/api/pith-number/3NGG47MTGN2I37DISZOAFLP4M5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NGG47MTGN2I37DISZOAFLP4M5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NGG47MTGN2I37DISZOAFLP4M5/action/storage_attestation","attest_author":"https://pith.science/pith/3NGG47MTGN2I37DISZOAFLP4M5/action/author_attestation","sign_citation":"https://pith.science/pith/3NGG47MTGN2I37DISZOAFLP4M5/action/citation_signature","submit_replication":"https://pith.science/pith/3NGG47MTGN2I37DISZOAFLP4M5/action/replication_record"}},"created_at":"2026-07-05T11:40:18.428164+00:00","updated_at":"2026-07-05T11:40:18.428164+00:00"}