{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZW4F7TMEFBJJ2N2TT2WT3ZDVGO","short_pith_number":"pith:ZW4F7TME","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"},"canonical_sha256":"cdb85fcd8428529d37539ead3de475339a4617c5e6deb9dfcadd3e6dd2b42924","source":{"kind":"arxiv","id":"1712.01883","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01883","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01883v1","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01883","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZW4F7TMEFBJJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZW4F7TMEFBJJ2N2T","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZW4F7TME","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZW4F7TMEFBJJ2N2TT2WT3ZDVGO","target":"record","payload":{"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"},"canonical_sha256":"cdb85fcd8428529d37539ead3de475339a4617c5e6deb9dfcadd3e6dd2b42924","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"},"source_kind":"arxiv","source_id":"1712.01883","source_version":1,"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-05-18T00:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHc7K1wOWHTuEiJqjBbqznoRXYdOc5Z2ZaYWcarJj2HLczKkY6EXsH4WSsnbu9m29fm0Hw3rxy/PERxVSxbsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:07:34.146963Z"},"content_sha256":"33e081f3591ad16ce27e99fc5a3d35fcf0c10fe04434bc361fe8971737f796ac","schema_version":"1.0","event_id":"sha256:33e081f3591ad16ce27e99fc5a3d35fcf0c10fe04434bc361fe8971737f796ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZW4F7TMEFBJJ2N2TT2WT3ZDVGO","target":"graph","payload":{"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"},"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-05-18T00:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlTji07bJXG9yuT7sS2qd73jR0atdQOWfnSEp7XsnOn8eSA2bOBigcKzmepHI8wqHuBbiTRhMx1hRwV9zxJ4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:07:34.147561Z"},"content_sha256":"62dfd971a10b9605c2bc8a996b9526f8dea1c497dbad744e879b93c47213cccc","schema_version":"1.0","event_id":"sha256:62dfd971a10b9605c2bc8a996b9526f8dea1c497dbad744e879b93c47213cccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/bundle.json","state_url":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/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-07T21:07:34Z","links":{"resolver":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO","bundle":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/bundle.json","state":"https://pith.science/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZW4F7TMEFBJJ2N2TT2WT3ZDVGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZW4F7TMEFBJJ2N2TT2WT3ZDVGO","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":"7d20bfa33c85cdc65af50f9b99e1be6d697010411f4502db8bdf56e33696eed0","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-05T19:42:29Z","title_canon_sha256":"a08eb966f1df8a95b962cde9644c896e19ad98db68e8dbe38446d309f017fbf8"},"schema_version":"1.0","source":{"id":"1712.01883","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01883","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01883v1","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01883","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZW4F7TMEFBJJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZW4F7TMEFBJJ2N2T","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZW4F7TME","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:62dfd971a10b9605c2bc8a996b9526f8dea1c497dbad744e879b93c47213cccc","target":"graph","created_at":"2026-05-18T00:28:39Z","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"},"paper":{"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","authors_text":"Aleksandr Aravkin, J. Nathan Kutz, Peng Zheng, Travis Askham","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-05T19:42:29Z","title":"Robust and scalable methods for the dynamic mode decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01883","kind":"arxiv","version":1},"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:33e081f3591ad16ce27e99fc5a3d35fcf0c10fe04434bc361fe8971737f796ac","target":"record","created_at":"2026-05-18T00:28:39Z","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":"7d20bfa33c85cdc65af50f9b99e1be6d697010411f4502db8bdf56e33696eed0","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-05T19:42:29Z","title_canon_sha256":"a08eb966f1df8a95b962cde9644c896e19ad98db68e8dbe38446d309f017fbf8"},"schema_version":"1.0","source":{"id":"1712.01883","kind":"arxiv","version":1}},"canonical_sha256":"cdb85fcd8428529d37539ead3de475339a4617c5e6deb9dfcadd3e6dd2b42924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdb85fcd8428529d37539ead3de475339a4617c5e6deb9dfcadd3e6dd2b42924","first_computed_at":"2026-05-18T00:28:39.828245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:39.828245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"caI6Z8lmSVSrf6Xf57FppHjXg4ea50nb1/DqzDWGFHwVedAGrLHeoPOtMzM35hT5nPSs7azMCGQbVXMGiBz7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:39.828975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01883","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33e081f3591ad16ce27e99fc5a3d35fcf0c10fe04434bc361fe8971737f796ac","sha256:62dfd971a10b9605c2bc8a996b9526f8dea1c497dbad744e879b93c47213cccc"],"state_sha256":"f623bd23ce454ebe7ba78e85256eafcef58d40e8448b1c1d8c2eb06c4c534313"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vnS+LYsMKHOcwjUwTXYbeoF+31cyQwFJu9M+26SxGdrO+d1IcJlyI1ayvGuONWpyI9xJEw4zFKiluPVNw0RcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:07:34.151575Z","bundle_sha256":"05510869736025674062b207584dcdfe61a24a8ab44af73007bf3548bb0e0158"}}