{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7HQXO5QY637X3YV4J2CRODFFRJ","short_pith_number":"pith:7HQXO5QY","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"},"canonical_sha256":"f9e1777618f6ff7de2bc4e85170ca58a4cfc470a58342cea606f971bfe469de1","source":{"kind":"arxiv","id":"1610.02962","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02962","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02962v8","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02962","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"7HQXO5QY637X","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"pith_short_16","alias_value":"7HQXO5QY637X3YV4","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"pith_short_8","alias_value":"7HQXO5QY","created_at":"2026-06-04T18:10:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7HQXO5QY637X3YV4J2CRODFFRJ","target":"record","payload":{"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"},"canonical_sha256":"f9e1777618f6ff7de2bc4e85170ca58a4cfc470a58342cea606f971bfe469de1","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"},"source_kind":"arxiv","source_id":"1610.02962","source_version":8,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T18:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfd+M32iKnwWxHzLHec3ytSCPSpCIodq5K7LXiBkSaxsuCkTSS2m/SAooMoO2ANyNTfTtysbLWD5cnMqdYTjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:12:24.458663Z"},"content_sha256":"0e062baa1f07ce1be58a41027430c3ead8d9593a6a962df9c0485e071a1be1cc","schema_version":"1.0","event_id":"sha256:0e062baa1f07ce1be58a41027430c3ead8d9593a6a962df9c0485e071a1be1cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7HQXO5QY637X3YV4J2CRODFFRJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T18:10:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/dno2yixlhfSfFZgcRdWvRJTr3gawgMUYYi+2LQ8Skkp9hWtid/qLiP8cdq0lQX+nj/P2ntSPikfo56uQgRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:12:24.459042Z"},"content_sha256":"b0af94ccde332d288d9ed2a5f07c1a41ff64c189eccc79f16c987ac7c0768fab","schema_version":"1.0","event_id":"sha256:b0af94ccde332d288d9ed2a5f07c1a41ff64c189eccc79f16c987ac7c0768fab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ/bundle.json","state_url":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HQXO5QY637X3YV4J2CRODFFRJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T22:12:24Z","links":{"resolver":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ","bundle":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ/bundle.json","state":"https://pith.science/pith/7HQXO5QY637X3YV4J2CRODFFRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HQXO5QY637X3YV4J2CRODFFRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7HQXO5QY637X3YV4J2CRODFFRJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2c760f1b290e5903d20a8ff03af645baf231b9b18b171652026b2627653a6603","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-10T15:29:12Z","title_canon_sha256":"85a7c0a2de500b2f209f4d149b110315a7dd79ca291caa6c66dc4c8fac7f73f0"},"schema_version":"1.0","source":{"id":"1610.02962","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02962","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02962v8","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02962","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"pith_short_12","alias_value":"7HQXO5QY637X","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"pith_short_16","alias_value":"7HQXO5QY637X3YV4","created_at":"2026-06-04T18:10:05Z"},{"alias_kind":"pith_short_8","alias_value":"7HQXO5QY","created_at":"2026-06-04T18:10:05Z"}],"graph_snapshots":[{"event_id":"sha256:b0af94ccde332d288d9ed2a5f07c1a41ff64c189eccc79f16c987ac7c0768fab","target":"graph","created_at":"2026-06-04T18:10:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1610.02962/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"C\\'edric Herzet, Patrick H\\'eas","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-10T15:29:12Z","title":"Low-Rank Dynamic Mode Decomposition: An Exact and Tractable Solution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02962","kind":"arxiv","version":8},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0e062baa1f07ce1be58a41027430c3ead8d9593a6a962df9c0485e071a1be1cc","target":"record","created_at":"2026-06-04T18:10:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2c760f1b290e5903d20a8ff03af645baf231b9b18b171652026b2627653a6603","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-10T15:29:12Z","title_canon_sha256":"85a7c0a2de500b2f209f4d149b110315a7dd79ca291caa6c66dc4c8fac7f73f0"},"schema_version":"1.0","source":{"id":"1610.02962","kind":"arxiv","version":8}},"canonical_sha256":"f9e1777618f6ff7de2bc4e85170ca58a4cfc470a58342cea606f971bfe469de1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9e1777618f6ff7de2bc4e85170ca58a4cfc470a58342cea606f971bfe469de1","first_computed_at":"2026-06-04T18:10:05.770715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T18:10:05.770715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QktW4ldDWIeM14KHHsLbOUi/eknQtwV0eFuXgumvpltgqsEnV4p+yXQ3R+i9+b5sJ7VnWGTUNBZkOx7rvvpBBA==","signature_status":"signed_v1","signed_at":"2026-06-04T18:10:05.771115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02962","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e062baa1f07ce1be58a41027430c3ead8d9593a6a962df9c0485e071a1be1cc","sha256:b0af94ccde332d288d9ed2a5f07c1a41ff64c189eccc79f16c987ac7c0768fab"],"state_sha256":"2139a9e4732a0c867476c9ca82c9169ef9d04e36a1d5a6ae037ccf255b927567"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZqT7QxYppStTz/BSt5/H7iTKtkBvcNdOIstK7bn+yCV1uv4eJ4d/WkOHFOJachUqCXrm+gwZqwVeBuw++B7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:12:24.461309Z","bundle_sha256":"52169ea2312df63d878846af85b5fd73e16acc1b26897e8f8fe2ca07204d3805"}}