{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DBXJQIPRCRKLATIQTRBEUKYHNF","short_pith_number":"pith:DBXJQIPR","canonical_record":{"source":{"id":"2009.11392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-23T21:40:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6ba6893f7a2714925b2f462b6f41132d9fca04cbb5a4a2cc3ffd1a52d7fc7ece","abstract_canon_sha256":"d70141c3d506d69ade8c418ed8cf5027113abf516f57836ec1663759a38d1e63"},"schema_version":"1.0"},"canonical_sha256":"186e9821f11454b04d109c424a2b07697d3ffc48e8a572d9e93680a5386e6b1a","source":{"kind":"arxiv","id":"2009.11392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11392","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11392v1","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11392","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"DBXJQIPRCRKL","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"pith_short_16","alias_value":"DBXJQIPRCRKLATIQ","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"pith_short_8","alias_value":"DBXJQIPR","created_at":"2026-07-05T01:37:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DBXJQIPRCRKLATIQTRBEUKYHNF","target":"record","payload":{"canonical_record":{"source":{"id":"2009.11392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-23T21:40:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6ba6893f7a2714925b2f462b6f41132d9fca04cbb5a4a2cc3ffd1a52d7fc7ece","abstract_canon_sha256":"d70141c3d506d69ade8c418ed8cf5027113abf516f57836ec1663759a38d1e63"},"schema_version":"1.0"},"canonical_sha256":"186e9821f11454b04d109c424a2b07697d3ffc48e8a572d9e93680a5386e6b1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:45.204303Z","signature_b64":"BljFAc6FzS/aQLWugRK43/aY01BwsvC2GYDAC7HdBNdj4XirAY5sTwcpMDB41pZ+YNIo97A8hyCaMoJW51uOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"186e9821f11454b04d109c424a2b07697d3ffc48e8a572d9e93680a5386e6b1a","last_reissued_at":"2026-07-05T01:37:45.203958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:45.203958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.11392","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-05T01:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gFNYdPI1UsI2LV9PcnoFkxHUnstVlTFtrqOo7RjOF1PfnZ+H0tZgAx81UquMp7hD67nrOAnAgg/mOpFnS94XDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:38:07.736024Z"},"content_sha256":"d286221153ad09186f87c75980b09cb288ee04b75f3a7724ba100d4bdfbcda39","schema_version":"1.0","event_id":"sha256:d286221153ad09186f87c75980b09cb288ee04b75f3a7724ba100d4bdfbcda39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DBXJQIPRCRKLATIQTRBEUKYHNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and stable randomized low-rank matrix approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Yuji Nakatsukasa","submitted_at":"2020-09-23T21:40:36Z","abstract_excerpt":"Randomized SVD has become an extremely successful approach for efficiently computing a low-rank approximation of matrices. In particular the paper by Halko, Martinsson, and Tropp (SIREV 2011) contains extensive analysis, and has made it a very popular method. The typical complexity for a rank-$r$ approximation of $m\\times n$ matrices is $O(mn\\log n+(m+n)r^2)$ for dense matrices. The classical Nystr{\\\"o}m method is much faster, but applicable only to positive semidefinite matrices. This work studies a generalization of Nystr{\\\"o}m method applicable to general matrices, and shows that (i) it has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11392","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/2009.11392/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-05T01:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdpAyNm2pMa2OFqV8Glus9p6EAQXRohXiEHHHZt/LCBQja1/crU4t58JJjlNxDRvvBFpUo1R4hHk/Lu3cEp8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:38:07.736544Z"},"content_sha256":"d7f2707863775dd02a31a56ca3ad6a3d6def2ee0db26badd23f20345484b510f","schema_version":"1.0","event_id":"sha256:d7f2707863775dd02a31a56ca3ad6a3d6def2ee0db26badd23f20345484b510f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBXJQIPRCRKLATIQTRBEUKYHNF/bundle.json","state_url":"https://pith.science/pith/DBXJQIPRCRKLATIQTRBEUKYHNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBXJQIPRCRKLATIQTRBEUKYHNF/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-08T13:38:07Z","links":{"resolver":"https://pith.science/pith/DBXJQIPRCRKLATIQTRBEUKYHNF","bundle":"https://pith.science/pith/DBXJQIPRCRKLATIQTRBEUKYHNF/bundle.json","state":"https://pith.science/pith/DBXJQIPRCRKLATIQTRBEUKYHNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBXJQIPRCRKLATIQTRBEUKYHNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DBXJQIPRCRKLATIQTRBEUKYHNF","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":"d70141c3d506d69ade8c418ed8cf5027113abf516f57836ec1663759a38d1e63","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-23T21:40:36Z","title_canon_sha256":"6ba6893f7a2714925b2f462b6f41132d9fca04cbb5a4a2cc3ffd1a52d7fc7ece"},"schema_version":"1.0","source":{"id":"2009.11392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11392","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11392v1","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11392","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"DBXJQIPRCRKL","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"pith_short_16","alias_value":"DBXJQIPRCRKLATIQ","created_at":"2026-07-05T01:37:45Z"},{"alias_kind":"pith_short_8","alias_value":"DBXJQIPR","created_at":"2026-07-05T01:37:45Z"}],"graph_snapshots":[{"event_id":"sha256:d7f2707863775dd02a31a56ca3ad6a3d6def2ee0db26badd23f20345484b510f","target":"graph","created_at":"2026-07-05T01:37:45Z","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/2009.11392/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Randomized SVD has become an extremely successful approach for efficiently computing a low-rank approximation of matrices. In particular the paper by Halko, Martinsson, and Tropp (SIREV 2011) contains extensive analysis, and has made it a very popular method. The typical complexity for a rank-$r$ approximation of $m\\times n$ matrices is $O(mn\\log n+(m+n)r^2)$ for dense matrices. The classical Nystr{\\\"o}m method is much faster, but applicable only to positive semidefinite matrices. This work studies a generalization of Nystr{\\\"o}m method applicable to general matrices, and shows that (i) it has","authors_text":"Yuji Nakatsukasa","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11392","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:d286221153ad09186f87c75980b09cb288ee04b75f3a7724ba100d4bdfbcda39","target":"record","created_at":"2026-07-05T01:37:45Z","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":"d70141c3d506d69ade8c418ed8cf5027113abf516f57836ec1663759a38d1e63","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-23T21:40:36Z","title_canon_sha256":"6ba6893f7a2714925b2f462b6f41132d9fca04cbb5a4a2cc3ffd1a52d7fc7ece"},"schema_version":"1.0","source":{"id":"2009.11392","kind":"arxiv","version":1}},"canonical_sha256":"186e9821f11454b04d109c424a2b07697d3ffc48e8a572d9e93680a5386e6b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"186e9821f11454b04d109c424a2b07697d3ffc48e8a572d9e93680a5386e6b1a","first_computed_at":"2026-07-05T01:37:45.203958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:37:45.203958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BljFAc6FzS/aQLWugRK43/aY01BwsvC2GYDAC7HdBNdj4XirAY5sTwcpMDB41pZ+YNIo97A8hyCaMoJW51uOCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:37:45.204303Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.11392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d286221153ad09186f87c75980b09cb288ee04b75f3a7724ba100d4bdfbcda39","sha256:d7f2707863775dd02a31a56ca3ad6a3d6def2ee0db26badd23f20345484b510f"],"state_sha256":"66556cac32453f0d6f97b87b1baa77d1ec2c4ba59e4b0642c91ba81832f6a065"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZL3ioG2R9D2t6mHirc2S1CSuK1C+MyucE0Cj4FA86r+D3Gr/RUR65Ozh4IX0mh4Il5t7k+5zxWKspz2cebaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:38:07.741206Z","bundle_sha256":"9f97c714742ab817ee9d267e20f27d97c909ea3dc072b8858740131c7cd24597"}}