{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3MIG2MLWBXUQMU4XD6JYN5LEFX","short_pith_number":"pith:3MIG2MLW","schema_version":"1.0","canonical_sha256":"db106d31760de90653971f9386f5642de34d508889684df3b9c570f87b016a41","source":{"kind":"arxiv","id":"1608.02148","version":5},"attestation_state":"computed","paper":{"title":"Randomized Matrix Decompositions using R","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","stat.ME"],"primary_cat":"stat.CO","authors_text":"J. Nathan Kutz, N. Benjamin Erichson, Sergey Voronin, Steven L. Brunton","submitted_at":"2016-08-06T19:47:48Z","abstract_excerpt":"Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality reduction, and data compression. Massive datasets, however, pose a computational challenge for traditional algorithms, placing significant constraints on both memory and processing power. Recently, the powerful concept of randomness has been introduced as a strategy to ease the computational load. The essential idea of probabilistic algorithms is to employ some amou"},"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":"1608.02148","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-08-06T19:47:48Z","cross_cats_sorted":["cs.MS","stat.ME"],"title_canon_sha256":"a7e095ff9b992d4aeaa362914450fdcb3dc545af860eb6a464e816c7aaf90750","abstract_canon_sha256":"06b2e1544cefc59caf476665712bdf8f32bf27d4aacbe7091d19f1f29248b165"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:22:21.451850Z","signature_b64":"ygQ34aL0/HHpULKUxjozb7rZvAtIMBDv8R/yeGocnknhslY5zS/jD0RMyglGa5DK/1zbCUbZ8BMy0WZRWdNdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db106d31760de90653971f9386f5642de34d508889684df3b9c570f87b016a41","last_reissued_at":"2026-07-05T00:22:21.451443Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:22:21.451443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Matrix Decompositions using R","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","stat.ME"],"primary_cat":"stat.CO","authors_text":"J. Nathan Kutz, N. Benjamin Erichson, Sergey Voronin, Steven L. Brunton","submitted_at":"2016-08-06T19:47:48Z","abstract_excerpt":"Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality reduction, and data compression. Massive datasets, however, pose a computational challenge for traditional algorithms, placing significant constraints on both memory and processing power. Recently, the powerful concept of randomness has been introduced as a strategy to ease the computational load. The essential idea of probabilistic algorithms is to employ some amou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02148","kind":"arxiv","version":5},"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/1608.02148/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":"1608.02148","created_at":"2026-07-05T00:22:21.451502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02148v5","created_at":"2026-07-05T00:22:21.451502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02148","created_at":"2026-07-05T00:22:21.451502+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MIG2MLWBXUQ","created_at":"2026-07-05T00:22:21.451502+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MIG2MLWBXUQMU4X","created_at":"2026-07-05T00:22:21.451502+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MIG2MLW","created_at":"2026-07-05T00:22:21.451502+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17793","citing_title":"On the Optimization of Singular Spectrum Analyses: A Pragmatic Approach","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3MIG2MLWBXUQMU4XD6JYN5LEFX","json":"https://pith.science/pith/3MIG2MLWBXUQMU4XD6JYN5LEFX.json","graph_json":"https://pith.science/api/pith-number/3MIG2MLWBXUQMU4XD6JYN5LEFX/graph.json","events_json":"https://pith.science/api/pith-number/3MIG2MLWBXUQMU4XD6JYN5LEFX/events.json","paper":"https://pith.science/paper/3MIG2MLW"},"agent_actions":{"view_html":"https://pith.science/pith/3MIG2MLWBXUQMU4XD6JYN5LEFX","download_json":"https://pith.science/pith/3MIG2MLWBXUQMU4XD6JYN5LEFX.json","view_paper":"https://pith.science/paper/3MIG2MLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02148&json=true","fetch_graph":"https://pith.science/api/pith-number/3MIG2MLWBXUQMU4XD6JYN5LEFX/graph.json","fetch_events":"https://pith.science/api/pith-number/3MIG2MLWBXUQMU4XD6JYN5LEFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MIG2MLWBXUQMU4XD6JYN5LEFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MIG2MLWBXUQMU4XD6JYN5LEFX/action/storage_attestation","attest_author":"https://pith.science/pith/3MIG2MLWBXUQMU4XD6JYN5LEFX/action/author_attestation","sign_citation":"https://pith.science/pith/3MIG2MLWBXUQMU4XD6JYN5LEFX/action/citation_signature","submit_replication":"https://pith.science/pith/3MIG2MLWBXUQMU4XD6JYN5LEFX/action/replication_record"}},"created_at":"2026-07-05T00:22:21.451502+00:00","updated_at":"2026-07-05T00:22:21.451502+00:00"}