{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L2LG4XTHMC2AEIPAYPEN3IV6RZ","short_pith_number":"pith:L2LG4XTH","schema_version":"1.0","canonical_sha256":"5e966e5e6760b40221e0c3c8dda2be8e49c092632173929d3607873097f2106a","source":{"kind":"arxiv","id":"2508.10126","version":1},"attestation_state":"computed","paper":{"title":"A tensor-based dynamic mode decomposition based on the $\\star_{\\boldsymbol{M}}$-product","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alex Mize, Arvind K. Saibaba, Fan Tian, Khalil Hall-Hooper, Misha E. Kilmer","submitted_at":"2025-08-13T18:42:45Z","abstract_excerpt":"Dynamic mode decomposition (DMD) is a data-driven method for estimating the dynamics of a discrete dynamical system. This paper proposes a tensor-based approach to DMD for applications in which the states can be viewed as tensors. Specifically, we use the $\\star_{\\boldsymbol{M}}$-product framework for tensor decompositions which we demonstrate offers excellent compression compared to matrix-based methods and can be implemented in a computationally efficient manner. We show how the proposed approach is connected to the traditional DMD and physics-informed DMD frameworks. We give a computational"},"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":"2508.10126","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-08-13T18:42:45Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1360e4d2b645e21edb478d676853d9dd912d5082d0c9f95e751824d2f44900c4","abstract_canon_sha256":"8c245be67da89ef7111e394cee47c7485402e530bd011a8d35b63e9d96ce60fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:32.085066Z","signature_b64":"vxgjCUufm+ZClQUSDC00kJIwR4B8CDjTZrHg7qYjYQZe+4ygQNeYCifR3Du4JcfAQAEdMHzTVfM2umEt8DnOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e966e5e6760b40221e0c3c8dda2be8e49c092632173929d3607873097f2106a","last_reissued_at":"2026-07-05T11:53:32.084603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:32.084603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tensor-based dynamic mode decomposition based on the $\\star_{\\boldsymbol{M}}$-product","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alex Mize, Arvind K. Saibaba, Fan Tian, Khalil Hall-Hooper, Misha E. Kilmer","submitted_at":"2025-08-13T18:42:45Z","abstract_excerpt":"Dynamic mode decomposition (DMD) is a data-driven method for estimating the dynamics of a discrete dynamical system. This paper proposes a tensor-based approach to DMD for applications in which the states can be viewed as tensors. Specifically, we use the $\\star_{\\boldsymbol{M}}$-product framework for tensor decompositions which we demonstrate offers excellent compression compared to matrix-based methods and can be implemented in a computationally efficient manner. We show how the proposed approach is connected to the traditional DMD and physics-informed DMD frameworks. We give a computational"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.10126","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/2508.10126/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":"2508.10126","created_at":"2026-07-05T11:53:32.084658+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.10126v1","created_at":"2026-07-05T11:53:32.084658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.10126","created_at":"2026-07-05T11:53:32.084658+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2LG4XTHMC2A","created_at":"2026-07-05T11:53:32.084658+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2LG4XTHMC2AEIPA","created_at":"2026-07-05T11:53:32.084658+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2LG4XTH","created_at":"2026-07-05T11:53:32.084658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26900","citing_title":"Incremental Tensor-Train Compression from Streaming TT-Formatted Data: Applications to Reduced-Order Modeling","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L2LG4XTHMC2AEIPAYPEN3IV6RZ","json":"https://pith.science/pith/L2LG4XTHMC2AEIPAYPEN3IV6RZ.json","graph_json":"https://pith.science/api/pith-number/L2LG4XTHMC2AEIPAYPEN3IV6RZ/graph.json","events_json":"https://pith.science/api/pith-number/L2LG4XTHMC2AEIPAYPEN3IV6RZ/events.json","paper":"https://pith.science/paper/L2LG4XTH"},"agent_actions":{"view_html":"https://pith.science/pith/L2LG4XTHMC2AEIPAYPEN3IV6RZ","download_json":"https://pith.science/pith/L2LG4XTHMC2AEIPAYPEN3IV6RZ.json","view_paper":"https://pith.science/paper/L2LG4XTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.10126&json=true","fetch_graph":"https://pith.science/api/pith-number/L2LG4XTHMC2AEIPAYPEN3IV6RZ/graph.json","fetch_events":"https://pith.science/api/pith-number/L2LG4XTHMC2AEIPAYPEN3IV6RZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2LG4XTHMC2AEIPAYPEN3IV6RZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2LG4XTHMC2AEIPAYPEN3IV6RZ/action/storage_attestation","attest_author":"https://pith.science/pith/L2LG4XTHMC2AEIPAYPEN3IV6RZ/action/author_attestation","sign_citation":"https://pith.science/pith/L2LG4XTHMC2AEIPAYPEN3IV6RZ/action/citation_signature","submit_replication":"https://pith.science/pith/L2LG4XTHMC2AEIPAYPEN3IV6RZ/action/replication_record"}},"created_at":"2026-07-05T11:53:32.084658+00:00","updated_at":"2026-07-05T11:53:32.084658+00:00"}