{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MM5DALDB277XBKJYLKXYVSAVGE","short_pith_number":"pith:MM5DALDB","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"},"canonical_sha256":"633a302c61d7ff70a9385aaf8ac815310d4c352f157133d217548dd9ec930b68","source":{"kind":"arxiv","id":"2506.03859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03859","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03859v1","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03859","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"MM5DALDB277X","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"pith_short_16","alias_value":"MM5DALDB277XBKJY","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"pith_short_8","alias_value":"MM5DALDB","created_at":"2026-07-05T11:15:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MM5DALDB277XBKJYLKXYVSAVGE","target":"record","payload":{"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"},"canonical_sha256":"633a302c61d7ff70a9385aaf8ac815310d4c352f157133d217548dd9ec930b68","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"},"source_kind":"arxiv","source_id":"2506.03859","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-07-05T11:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oL1oEKwAPnxv+z53NnNBR4APxr9kK6vO5u77nJI0Qe+OZ8uz9vpRt8Yrf4c+zQXILtYTZgEt2a4RVhXe+8l0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:57:40.092614Z"},"content_sha256":"0fbc6f5c46dbe00ec2141600bd255bcdf36db2b9d464b82bd6540a93488b5293","schema_version":"1.0","event_id":"sha256:0fbc6f5c46dbe00ec2141600bd255bcdf36db2b9d464b82bd6540a93488b5293"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MM5DALDB277XBKJYLKXYVSAVGE","target":"graph","payload":{"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"},"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-07-05T11:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oLsyJFxdMTXU8qeFmvnSWwKEuoc1Fuww0u4bRA8HD/AKapStKPk+5Pdo65ixrOYIpOJtJ31qmc7JkMtOaJpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T06:57:40.093468Z"},"content_sha256":"0f55bf356cb7b35de29111de7c3b077b219ec617ea59af89b60d5ed2537f31a5","schema_version":"1.0","event_id":"sha256:0f55bf356cb7b35de29111de7c3b077b219ec617ea59af89b60d5ed2537f31a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE/bundle.json","state_url":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MM5DALDB277XBKJYLKXYVSAVGE/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-08-08T06:57:40Z","links":{"resolver":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE","bundle":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE/bundle.json","state":"https://pith.science/pith/MM5DALDB277XBKJYLKXYVSAVGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MM5DALDB277XBKJYLKXYVSAVGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MM5DALDB277XBKJYLKXYVSAVGE","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":"d5e2b29a64fdc08921e44e769707d0cba6810804f564cff5e152639da04f8bf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-06-04T11:46:45Z","title_canon_sha256":"85f35d81f9b04756e733a30c38492df0333665ade6399dde720717c5bba5ddd8"},"schema_version":"1.0","source":{"id":"2506.03859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03859","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03859v1","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03859","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"MM5DALDB277X","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"pith_short_16","alias_value":"MM5DALDB277XBKJY","created_at":"2026-07-05T11:15:52Z"},{"alias_kind":"pith_short_8","alias_value":"MM5DALDB","created_at":"2026-07-05T11:15:52Z"}],"graph_snapshots":[{"event_id":"sha256:0f55bf356cb7b35de29111de7c3b077b219ec617ea59af89b60d5ed2537f31a5","target":"graph","created_at":"2026-07-05T11:15:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.03859/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bo Fu, Dandan Jiang, Weiwei Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03859","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:0fbc6f5c46dbe00ec2141600bd255bcdf36db2b9d464b82bd6540a93488b5293","target":"record","created_at":"2026-07-05T11:15:52Z","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":"d5e2b29a64fdc08921e44e769707d0cba6810804f564cff5e152639da04f8bf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-06-04T11:46:45Z","title_canon_sha256":"85f35d81f9b04756e733a30c38492df0333665ade6399dde720717c5bba5ddd8"},"schema_version":"1.0","source":{"id":"2506.03859","kind":"arxiv","version":1}},"canonical_sha256":"633a302c61d7ff70a9385aaf8ac815310d4c352f157133d217548dd9ec930b68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"633a302c61d7ff70a9385aaf8ac815310d4c352f157133d217548dd9ec930b68","first_computed_at":"2026-07-05T11:15:52.973310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:52.973310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXp+77TjfNNVv5IL33oUyTBWZOCjW0YPABsa1Bw2QrES0pWCs0SwDh9CJnGFS8QLUdJfOwfD8OmREQscKw0/DA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:52.973767Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fbc6f5c46dbe00ec2141600bd255bcdf36db2b9d464b82bd6540a93488b5293","sha256:0f55bf356cb7b35de29111de7c3b077b219ec617ea59af89b60d5ed2537f31a5"],"state_sha256":"452b2e42bb4e965670000c120c31e21a6103937973bb79b4d615135b97ff7618"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oi+NKn0BCzSEXyopOCXBs8QO2uZd6kAlKIOocpaqIdnZoxsm0RBxDU6UPyLn5OdH7kYpyuBQFRec2BbIPSlDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T06:57:40.102531Z","bundle_sha256":"8d39a8cd4ec7cff90d75dbb3903783ba73a5192b2a569128a36c5555acb6fa39"}}