{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:VG3DFDEZ7GBIU4TCMM3YSGJ7XC","short_pith_number":"pith:VG3DFDEZ","canonical_record":{"source":{"id":"math/0503442","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.FA","submitted_at":"2005-03-22T00:01:47Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"a01c8cd9d7f72b3ae849994e7ddb8b579a74a04fbc9bd286d461571c8404e990","abstract_canon_sha256":"ba9511db6055189870b20b889a6f203448d3968a86195788ef24257f61149e59"},"schema_version":"1.0"},"canonical_sha256":"a9b6328c99f9828a7262633789193fb8a84e1e189ceb32afc4af43a0dd16e080","source":{"kind":"arxiv","id":"math/0503442","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0503442","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"math/0503442v3","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0503442","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"VG3DFDEZ7GBI","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"VG3DFDEZ7GBIU4TC","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"VG3DFDEZ","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:VG3DFDEZ7GBIU4TCMM3YSGJ7XC","target":"record","payload":{"canonical_record":{"source":{"id":"math/0503442","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.FA","submitted_at":"2005-03-22T00:01:47Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"a01c8cd9d7f72b3ae849994e7ddb8b579a74a04fbc9bd286d461571c8404e990","abstract_canon_sha256":"ba9511db6055189870b20b889a6f203448d3968a86195788ef24257f61149e59"},"schema_version":"1.0"},"canonical_sha256":"a9b6328c99f9828a7262633789193fb8a84e1e189ceb32afc4af43a0dd16e080","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:09.269339Z","signature_b64":"OoSJHOXiWdwVWktTb6boupdKUSDWAUPINlTR8ye3hz3KdtF8k1WNj2MoxWD+PtqD64WzOku82Gvz6UKvmb1hBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9b6328c99f9828a7262633789193fb8a84e1e189ceb32afc4af43a0dd16e080","last_reissued_at":"2026-05-18T00:54:09.268940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:09.268940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0503442","source_version":3,"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:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hi6L1vOBbGqdfJl6SHzXeINfRtfnTHL7oj1y0DcXRfarSvm6qiEpC9gsJgQyvbzhDXXQKmpLDkzjVPYvxFDADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:36:18.825568Z"},"content_sha256":"0e8e8d9346873ee792e89ac4dbeebd7214614277e51e736eee83ff5ae1cf5ac6","schema_version":"1.0","event_id":"sha256:0e8e8d9346873ee792e89ac4dbeebd7214614277e51e736eee83ff5ae1cf5ac6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:VG3DFDEZ7GBIU4TCMM3YSGJ7XC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling from large matrices: an approach through geometric functional analysis","license":"","headline":"","cross_cats":["math.NA"],"primary_cat":"math.FA","authors_text":"Mark Rudelson, Roman Vershynin","submitted_at":"2005-03-22T00:01:47Z","abstract_excerpt":"We study random submatrices of a large matrix A. We show how to approximately compute A from its random submatrix of the smallest possible size O(r log r) with a small error in the spectral norm, where r = ||A||_F^2 / ||A||_2^2 is the numerical rank of A. The numerical rank is always bounded by, and is a stable relaxation of, the rank of A. This yields an asymptotically optimal guarantee in an algorithm for computing low-rank approximations of A. We also prove asymptotically optimal estimates on the spectral norm and the cut-norm of random submatrices of A. The result for the cut-norm yields a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0503442","kind":"arxiv","version":3},"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:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBYNH5Ph2tz/a84NJZ8JA9gLvkGxxJ6U7fhgbTuJ/EmuUTUGBXuESmHOIxcK3WfUjN3/WYX1Aj3qqlA3yy4IDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:36:18.825926Z"},"content_sha256":"5a0467c9f1fb1c1abe01673c2621fd7b7732b120af394f6eaffb8be8bdfd1298","schema_version":"1.0","event_id":"sha256:5a0467c9f1fb1c1abe01673c2621fd7b7732b120af394f6eaffb8be8bdfd1298"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/bundle.json","state_url":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/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-03T02:36:18Z","links":{"resolver":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC","bundle":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/bundle.json","state":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:VG3DFDEZ7GBIU4TCMM3YSGJ7XC","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":"ba9511db6055189870b20b889a6f203448d3968a86195788ef24257f61149e59","cross_cats_sorted":["math.NA"],"license":"","primary_cat":"math.FA","submitted_at":"2005-03-22T00:01:47Z","title_canon_sha256":"a01c8cd9d7f72b3ae849994e7ddb8b579a74a04fbc9bd286d461571c8404e990"},"schema_version":"1.0","source":{"id":"math/0503442","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0503442","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"math/0503442v3","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0503442","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"VG3DFDEZ7GBI","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"VG3DFDEZ7GBIU4TC","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"VG3DFDEZ","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:5a0467c9f1fb1c1abe01673c2621fd7b7732b120af394f6eaffb8be8bdfd1298","target":"graph","created_at":"2026-05-18T00:54:09Z","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":"We study random submatrices of a large matrix A. We show how to approximately compute A from its random submatrix of the smallest possible size O(r log r) with a small error in the spectral norm, where r = ||A||_F^2 / ||A||_2^2 is the numerical rank of A. The numerical rank is always bounded by, and is a stable relaxation of, the rank of A. This yields an asymptotically optimal guarantee in an algorithm for computing low-rank approximations of A. We also prove asymptotically optimal estimates on the spectral norm and the cut-norm of random submatrices of A. The result for the cut-norm yields a","authors_text":"Mark Rudelson, Roman Vershynin","cross_cats":["math.NA"],"headline":"","license":"","primary_cat":"math.FA","submitted_at":"2005-03-22T00:01:47Z","title":"Sampling from large matrices: an approach through geometric functional analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0503442","kind":"arxiv","version":3},"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:0e8e8d9346873ee792e89ac4dbeebd7214614277e51e736eee83ff5ae1cf5ac6","target":"record","created_at":"2026-05-18T00:54:09Z","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":"ba9511db6055189870b20b889a6f203448d3968a86195788ef24257f61149e59","cross_cats_sorted":["math.NA"],"license":"","primary_cat":"math.FA","submitted_at":"2005-03-22T00:01:47Z","title_canon_sha256":"a01c8cd9d7f72b3ae849994e7ddb8b579a74a04fbc9bd286d461571c8404e990"},"schema_version":"1.0","source":{"id":"math/0503442","kind":"arxiv","version":3}},"canonical_sha256":"a9b6328c99f9828a7262633789193fb8a84e1e189ceb32afc4af43a0dd16e080","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9b6328c99f9828a7262633789193fb8a84e1e189ceb32afc4af43a0dd16e080","first_computed_at":"2026-05-18T00:54:09.268940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:09.268940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OoSJHOXiWdwVWktTb6boupdKUSDWAUPINlTR8ye3hz3KdtF8k1WNj2MoxWD+PtqD64WzOku82Gvz6UKvmb1hBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:09.269339Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0503442","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e8e8d9346873ee792e89ac4dbeebd7214614277e51e736eee83ff5ae1cf5ac6","sha256:5a0467c9f1fb1c1abe01673c2621fd7b7732b120af394f6eaffb8be8bdfd1298"],"state_sha256":"88e91b7c50794f70557eb43a2e6261bc43fbc02a46686a6d93618ab5a1a54e58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyNKkSB/hVK/iAbYaToQTUdYZLtKE9Df+5HhkOkn9G6Eu84gXLy/4o1CT0HgE1nnTh42VF9th/C4u4G7oS1qCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:36:18.827940Z","bundle_sha256":"3b64ff64f4a6432b5e32011669a7764668df01c835e2fc8a8e662c2cdb429df4"}}