{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:K7CZDDPVOFB5FM5RAJKNARUDFL","short_pith_number":"pith:K7CZDDPV","schema_version":"1.0","canonical_sha256":"57c5918df57143d2b3b10254d046832adb5f3994d7c1165a0abafc4d37917304","source":{"kind":"arxiv","id":"2208.01681","version":1},"attestation_state":"computed","paper":{"title":"Representer Theorem for Learning Koopman Operators","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","eess.SP"],"primary_cat":"eess.SY","authors_text":"Mohammad Khosravi","submitted_at":"2022-08-02T18:16:15Z","abstract_excerpt":"In this work, the problem of learning Koopman operator of a discrete-time autonomous system is considered. The learning problem is formulated as a constrained regularized empirical loss minimization in the infinite-dimensional space of linear operators. We show that under certain but general conditions, a representer theorem holds for the learning problem. This allows reformulating the problem in a finite-dimensional space without any approximation and loss of precision. Following this, we consider various cases of regularization and constraints in the learning problem, including the operator "},"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":"2208.01681","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2022-08-02T18:16:15Z","cross_cats_sorted":["cs.SY","eess.SP"],"title_canon_sha256":"075258a3aba4c164c76028411995e4b492535cce8fd3a4ffb8a0224c032284ed","abstract_canon_sha256":"a8476d50b0d4fa0ba61dd1493900b8ac7644149d7a55a255a5c8edf1c64f364a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:45:39.068474Z","signature_b64":"ubH8JQeSAWPNVMthyRx9aGsw2Oy6l+bX7DBIgMXpkJWi87OyrmnctygbIutDK4N65t5WXNmxbd4QtTpGsAhJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c5918df57143d2b3b10254d046832adb5f3994d7c1165a0abafc4d37917304","last_reissued_at":"2026-07-05T04:45:39.068003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:45:39.068003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representer Theorem for Learning Koopman Operators","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","eess.SP"],"primary_cat":"eess.SY","authors_text":"Mohammad Khosravi","submitted_at":"2022-08-02T18:16:15Z","abstract_excerpt":"In this work, the problem of learning Koopman operator of a discrete-time autonomous system is considered. The learning problem is formulated as a constrained regularized empirical loss minimization in the infinite-dimensional space of linear operators. We show that under certain but general conditions, a representer theorem holds for the learning problem. This allows reformulating the problem in a finite-dimensional space without any approximation and loss of precision. Following this, we consider various cases of regularization and constraints in the learning problem, including the operator "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.01681","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/2208.01681/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":"2208.01681","created_at":"2026-07-05T04:45:39.068062+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.01681v1","created_at":"2026-07-05T04:45:39.068062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.01681","created_at":"2026-07-05T04:45:39.068062+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7CZDDPVOFB5","created_at":"2026-07-05T04:45:39.068062+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7CZDDPVOFB5FM5R","created_at":"2026-07-05T04:45:39.068062+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7CZDDPV","created_at":"2026-07-05T04:45:39.068062+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7CZDDPVOFB5FM5RAJKNARUDFL","json":"https://pith.science/pith/K7CZDDPVOFB5FM5RAJKNARUDFL.json","graph_json":"https://pith.science/api/pith-number/K7CZDDPVOFB5FM5RAJKNARUDFL/graph.json","events_json":"https://pith.science/api/pith-number/K7CZDDPVOFB5FM5RAJKNARUDFL/events.json","paper":"https://pith.science/paper/K7CZDDPV"},"agent_actions":{"view_html":"https://pith.science/pith/K7CZDDPVOFB5FM5RAJKNARUDFL","download_json":"https://pith.science/pith/K7CZDDPVOFB5FM5RAJKNARUDFL.json","view_paper":"https://pith.science/paper/K7CZDDPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.01681&json=true","fetch_graph":"https://pith.science/api/pith-number/K7CZDDPVOFB5FM5RAJKNARUDFL/graph.json","fetch_events":"https://pith.science/api/pith-number/K7CZDDPVOFB5FM5RAJKNARUDFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7CZDDPVOFB5FM5RAJKNARUDFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7CZDDPVOFB5FM5RAJKNARUDFL/action/storage_attestation","attest_author":"https://pith.science/pith/K7CZDDPVOFB5FM5RAJKNARUDFL/action/author_attestation","sign_citation":"https://pith.science/pith/K7CZDDPVOFB5FM5RAJKNARUDFL/action/citation_signature","submit_replication":"https://pith.science/pith/K7CZDDPVOFB5FM5RAJKNARUDFL/action/replication_record"}},"created_at":"2026-07-05T04:45:39.068062+00:00","updated_at":"2026-07-05T04:45:39.068062+00:00"}