{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FODWCJYV6WX2OX4KCQ6O6ETKRR","short_pith_number":"pith:FODWCJYV","schema_version":"1.0","canonical_sha256":"2b87612715f5afa75f8a143cef126a8c787b362461ee02999964f89087dcbae1","source":{"kind":"arxiv","id":"1702.02912","version":3},"attestation_state":"computed","paper":{"title":"Randomized Dynamic Mode Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"J. Nathan Kutz, Lionel Mathelin, N. Benjamin Erichson, Steven L. Brunton","submitted_at":"2017-02-07T18:26:28Z","abstract_excerpt":"This paper presents a randomized algorithm for computing the near-optimal low-rank dynamic mode decomposition (DMD). Randomized algorithms are emerging techniques to compute low-rank matrix approximations at a fraction of the cost of deterministic algorithms, easing the computational challenges arising in the area of `big data'. The idea is to derive a small matrix from the high-dimensional data, which is then used to efficiently compute the dynamic modes and eigenvalues. The algorithm is presented in a modular probabilistic framework, and the approximation quality can be controlled via oversa"},"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":"1702.02912","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-02-07T18:26:28Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"caaf6e7fd2d75c589c102e940ea180f887245498cf168fe4ea8375b2aaf7f1bf","abstract_canon_sha256":"e6bc080ae56a3a07c8df8cc3a1d13a14d52db2dc57f7a87cd86f813b43a7ed47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:22:21.524360Z","signature_b64":"5to+4EtujUdp7eyMzy4DqPtFcGhWrTmt9ZwdmjFbq6aBlzaygtDvB2j8MQOYAWT4Tlc0Mh6n14BrIyL6QhbICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b87612715f5afa75f8a143cef126a8c787b362461ee02999964f89087dcbae1","last_reissued_at":"2026-07-05T00:22:21.523927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:22:21.523927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Dynamic Mode Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"J. Nathan Kutz, Lionel Mathelin, N. Benjamin Erichson, Steven L. Brunton","submitted_at":"2017-02-07T18:26:28Z","abstract_excerpt":"This paper presents a randomized algorithm for computing the near-optimal low-rank dynamic mode decomposition (DMD). Randomized algorithms are emerging techniques to compute low-rank matrix approximations at a fraction of the cost of deterministic algorithms, easing the computational challenges arising in the area of `big data'. The idea is to derive a small matrix from the high-dimensional data, which is then used to efficiently compute the dynamic modes and eigenvalues. The algorithm is presented in a modular probabilistic framework, and the approximation quality can be controlled via oversa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02912","kind":"arxiv","version":3},"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/1702.02912/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":"1702.02912","created_at":"2026-07-05T00:22:21.523993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02912v3","created_at":"2026-07-05T00:22:21.523993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02912","created_at":"2026-07-05T00:22:21.523993+00:00"},{"alias_kind":"pith_short_12","alias_value":"FODWCJYV6WX2","created_at":"2026-07-05T00:22:21.523993+00:00"},{"alias_kind":"pith_short_16","alias_value":"FODWCJYV6WX2OX4K","created_at":"2026-07-05T00:22:21.523993+00:00"},{"alias_kind":"pith_short_8","alias_value":"FODWCJYV","created_at":"2026-07-05T00:22:21.523993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03609","citing_title":"Online Physics-Informed Dynamic Mode Decomposition: Theory and Applications","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FODWCJYV6WX2OX4KCQ6O6ETKRR","json":"https://pith.science/pith/FODWCJYV6WX2OX4KCQ6O6ETKRR.json","graph_json":"https://pith.science/api/pith-number/FODWCJYV6WX2OX4KCQ6O6ETKRR/graph.json","events_json":"https://pith.science/api/pith-number/FODWCJYV6WX2OX4KCQ6O6ETKRR/events.json","paper":"https://pith.science/paper/FODWCJYV"},"agent_actions":{"view_html":"https://pith.science/pith/FODWCJYV6WX2OX4KCQ6O6ETKRR","download_json":"https://pith.science/pith/FODWCJYV6WX2OX4KCQ6O6ETKRR.json","view_paper":"https://pith.science/paper/FODWCJYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02912&json=true","fetch_graph":"https://pith.science/api/pith-number/FODWCJYV6WX2OX4KCQ6O6ETKRR/graph.json","fetch_events":"https://pith.science/api/pith-number/FODWCJYV6WX2OX4KCQ6O6ETKRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FODWCJYV6WX2OX4KCQ6O6ETKRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FODWCJYV6WX2OX4KCQ6O6ETKRR/action/storage_attestation","attest_author":"https://pith.science/pith/FODWCJYV6WX2OX4KCQ6O6ETKRR/action/author_attestation","sign_citation":"https://pith.science/pith/FODWCJYV6WX2OX4KCQ6O6ETKRR/action/citation_signature","submit_replication":"https://pith.science/pith/FODWCJYV6WX2OX4KCQ6O6ETKRR/action/replication_record"}},"created_at":"2026-07-05T00:22:21.523993+00:00","updated_at":"2026-07-05T00:22:21.523993+00:00"}