{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7HQXO5QY637X3YV4J2CRODFFRJ","short_pith_number":"pith:7HQXO5QY","schema_version":"1.0","canonical_sha256":"f9e1777618f6ff7de2bc4e85170ca58a4cfc470a58342cea606f971bfe469de1","source":{"kind":"arxiv","id":"1610.02962","version":8},"attestation_state":"computed","paper":{"title":"Low-Rank Dynamic Mode Decomposition: An Exact and Tractable Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"C\\'edric Herzet, Patrick H\\'eas","submitted_at":"2016-10-10T15:29:12Z","abstract_excerpt":"This work studies the linear approximation of high-dimensional dynamical systems using low-rank dynamic mode decomposition (DMD). Searching this approximation in a data-driven approach is formalised as attempting to solve a low-rank constrained optimisation problem. This problem is non-convex and state-of-the-art algorithms are all sub-optimal. This paper shows that there exists a closed-form solution, which is computed in polynomial time, and characterises the l2-norm of the optimal approximation error. The paper also proposes low-complexity algorithms building reduced models from this optima"},"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":"1610.02962","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-10T15:29:12Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"85a7c0a2de500b2f209f4d149b110315a7dd79ca291caa6c66dc4c8fac7f73f0","abstract_canon_sha256":"2c760f1b290e5903d20a8ff03af645baf231b9b18b171652026b2627653a6603"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T18:10:05.771115Z","signature_b64":"QktW4ldDWIeM14KHHsLbOUi/eknQtwV0eFuXgumvpltgqsEnV4p+yXQ3R+i9+b5sJ7VnWGTUNBZkOx7rvvpBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9e1777618f6ff7de2bc4e85170ca58a4cfc470a58342cea606f971bfe469de1","last_reissued_at":"2026-06-04T18:10:05.770715Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T18:10:05.770715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Rank Dynamic Mode Decomposition: An Exact and Tractable Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"stat.ML","authors_text":"C\\'edric Herzet, Patrick H\\'eas","submitted_at":"2016-10-10T15:29:12Z","abstract_excerpt":"This work studies the linear approximation of high-dimensional dynamical systems using low-rank dynamic mode decomposition (DMD). Searching this approximation in a data-driven approach is formalised as attempting to solve a low-rank constrained optimisation problem. This problem is non-convex and state-of-the-art algorithms are all sub-optimal. This paper shows that there exists a closed-form solution, which is computed in polynomial time, and characterises the l2-norm of the optimal approximation error. The paper also proposes low-complexity algorithms building reduced models from this optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02962","kind":"arxiv","version":8},"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/1610.02962/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":"1610.02962","created_at":"2026-06-04T18:10:05.770773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02962v8","created_at":"2026-06-04T18:10:05.770773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02962","created_at":"2026-06-04T18:10:05.770773+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HQXO5QY637X","created_at":"2026-06-04T18:10:05.770773+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HQXO5QY637X3YV4","created_at":"2026-06-04T18:10:05.770773+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HQXO5QY","created_at":"2026-06-04T18:10:05.770773+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/7HQXO5QY637X3YV4J2CRODFFRJ","json":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ.json","graph_json":"https://pith.science/api/pith-number/7HQXO5QY637X3YV4J2CRODFFRJ/graph.json","events_json":"https://pith.science/api/pith-number/7HQXO5QY637X3YV4J2CRODFFRJ/events.json","paper":"https://pith.science/paper/7HQXO5QY"},"agent_actions":{"view_html":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ","download_json":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ.json","view_paper":"https://pith.science/paper/7HQXO5QY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02962&json=true","fetch_graph":"https://pith.science/api/pith-number/7HQXO5QY637X3YV4J2CRODFFRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7HQXO5QY637X3YV4J2CRODFFRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ/action/storage_attestation","attest_author":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ/action/author_attestation","sign_citation":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ/action/citation_signature","submit_replication":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ/action/replication_record"}},"created_at":"2026-06-04T18:10:05.770773+00:00","updated_at":"2026-06-04T18:10:05.770773+00:00"}