{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZW4F7TMEFBJJ2N2TT2WT3ZDVGO","short_pith_number":"pith:ZW4F7TME","schema_version":"1.0","canonical_sha256":"cdb85fcd8428529d37539ead3de475339a4617c5e6deb9dfcadd3e6dd2b42924","source":{"kind":"arxiv","id":"1712.01883","version":1},"attestation_state":"computed","paper":{"title":"Robust and scalable methods for the dynamic mode decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Aleksandr Aravkin, J. Nathan Kutz, Peng Zheng, Travis Askham","submitted_at":"2017-12-05T19:42:29Z","abstract_excerpt":"The dynamic mode decomposition (DMD) is a broadly applicable dimensionality reduction algorithm that approximates a matrix containing time-series data by the outer product of a matrix of exponentials, representing Fourier-like time dynamics, and a matrix of coefficients, representing spatial structures. This interpretable spatio-temporal decomposition is commonly computed using linear algebraic techniques in its simplest formulation or a nonlinear optimization procedure within the variable projection framework. For data with sparse outliers or data which are not well-represented by exponential"},"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":"1712.01883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-05T19:42:29Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"a08eb966f1df8a95b962cde9644c896e19ad98db68e8dbe38446d309f017fbf8","abstract_canon_sha256":"7d20bfa33c85cdc65af50f9b99e1be6d697010411f4502db8bdf56e33696eed0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:39.828975Z","signature_b64":"caI6Z8lmSVSrf6Xf57FppHjXg4ea50nb1/DqzDWGFHwVedAGrLHeoPOtMzM35hT5nPSs7azMCGQbVXMGiBz7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdb85fcd8428529d37539ead3de475339a4617c5e6deb9dfcadd3e6dd2b42924","last_reissued_at":"2026-05-18T00:28:39.828245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:39.828245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and scalable methods for the dynamic mode decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Aleksandr Aravkin, J. Nathan Kutz, Peng Zheng, Travis Askham","submitted_at":"2017-12-05T19:42:29Z","abstract_excerpt":"The dynamic mode decomposition (DMD) is a broadly applicable dimensionality reduction algorithm that approximates a matrix containing time-series data by the outer product of a matrix of exponentials, representing Fourier-like time dynamics, and a matrix of coefficients, representing spatial structures. This interpretable spatio-temporal decomposition is commonly computed using linear algebraic techniques in its simplest formulation or a nonlinear optimization procedure within the variable projection framework. For data with sparse outliers or data which are not well-represented by exponential"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01883","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":""},"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":"1712.01883","created_at":"2026-05-18T00:28:39.828370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01883v1","created_at":"2026-05-18T00:28:39.828370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01883","created_at":"2026-05-18T00:28:39.828370+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZW4F7TMEFBJJ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZW4F7TMEFBJJ2N2T","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZW4F7TME","created_at":"2026-05-18T12:31:59.375834+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/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO","json":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO.json","graph_json":"https://pith.science/api/pith-number/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/graph.json","events_json":"https://pith.science/api/pith-number/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/events.json","paper":"https://pith.science/paper/ZW4F7TME"},"agent_actions":{"view_html":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO","download_json":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO.json","view_paper":"https://pith.science/paper/ZW4F7TME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01883&json=true","fetch_graph":"https://pith.science/api/pith-number/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/action/storage_attestation","attest_author":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/action/author_attestation","sign_citation":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/action/citation_signature","submit_replication":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/action/replication_record"}},"created_at":"2026-05-18T00:28:39.828370+00:00","updated_at":"2026-05-18T00:28:39.828370+00:00"}