{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MM5DALDB277XBKJYLKXYVSAVGE","short_pith_number":"pith:MM5DALDB","schema_version":"1.0","canonical_sha256":"633a302c61d7ff70a9385aaf8ac815310d4c352f157133d217548dd9ec930b68","source":{"kind":"arxiv","id":"2506.03859","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Bo Fu, Dandan Jiang, Weiwei Xu","submitted_at":"2025-06-04T11:46:45Z","abstract_excerpt":"Randomized algorithms are overwhelming methods for low-rank approximation that can alleviate the computational expenditure with great reliability compared to deterministic algorithms. A crucial thought is generating a standard Gaussian matrix $\\mathbf{G}$ and subsequently obtaining the orthonormal basis of the range of $\\mathbf{AG}$ for a given matrix $\\mathbf{A}$. Recently, the \\texttt{farPCA} algorithm offers a framework for randomized algorithms, but the dense Gaussian matrix remains computationally expensive. Motivated by this, we introduce the standardized Bernoulli, sparse sign, and spar"},"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":"2506.03859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-06-04T11:46:45Z","cross_cats_sorted":[],"title_canon_sha256":"85f35d81f9b04756e733a30c38492df0333665ade6399dde720717c5bba5ddd8","abstract_canon_sha256":"d5e2b29a64fdc08921e44e769707d0cba6810804f564cff5e152639da04f8bf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:52.973767Z","signature_b64":"gXp+77TjfNNVv5IL33oUyTBWZOCjW0YPABsa1Bw2QrES0pWCs0SwDh9CJnGFS8QLUdJfOwfD8OmREQscKw0/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"633a302c61d7ff70a9385aaf8ac815310d4c352f157133d217548dd9ec930b68","last_reissued_at":"2026-07-05T11:15:52.973310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:52.973310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Bo Fu, Dandan Jiang, Weiwei Xu","submitted_at":"2025-06-04T11:46:45Z","abstract_excerpt":"Randomized algorithms are overwhelming methods for low-rank approximation that can alleviate the computational expenditure with great reliability compared to deterministic algorithms. A crucial thought is generating a standard Gaussian matrix $\\mathbf{G}$ and subsequently obtaining the orthonormal basis of the range of $\\mathbf{AG}$ for a given matrix $\\mathbf{A}$. Recently, the \\texttt{farPCA} algorithm offers a framework for randomized algorithms, but the dense Gaussian matrix remains computationally expensive. Motivated by this, we introduce the standardized Bernoulli, sparse sign, and spar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03859","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/2506.03859/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":"2506.03859","created_at":"2026-07-05T11:15:52.973375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03859v1","created_at":"2026-07-05T11:15:52.973375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03859","created_at":"2026-07-05T11:15:52.973375+00:00"},{"alias_kind":"pith_short_12","alias_value":"MM5DALDB277X","created_at":"2026-07-05T11:15:52.973375+00:00"},{"alias_kind":"pith_short_16","alias_value":"MM5DALDB277XBKJY","created_at":"2026-07-05T11:15:52.973375+00:00"},{"alias_kind":"pith_short_8","alias_value":"MM5DALDB","created_at":"2026-07-05T11:15:52.973375+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/MM5DALDB277XBKJYLKXYVSAVGE","json":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE.json","graph_json":"https://pith.science/api/pith-number/MM5DALDB277XBKJYLKXYVSAVGE/graph.json","events_json":"https://pith.science/api/pith-number/MM5DALDB277XBKJYLKXYVSAVGE/events.json","paper":"https://pith.science/paper/MM5DALDB"},"agent_actions":{"view_html":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE","download_json":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE.json","view_paper":"https://pith.science/paper/MM5DALDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03859&json=true","fetch_graph":"https://pith.science/api/pith-number/MM5DALDB277XBKJYLKXYVSAVGE/graph.json","fetch_events":"https://pith.science/api/pith-number/MM5DALDB277XBKJYLKXYVSAVGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE/action/storage_attestation","attest_author":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE/action/author_attestation","sign_citation":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE/action/citation_signature","submit_replication":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE/action/replication_record"}},"created_at":"2026-07-05T11:15:52.973375+00:00","updated_at":"2026-07-05T11:15:52.973375+00:00"}