{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:VG3DFDEZ7GBIU4TCMM3YSGJ7XC","short_pith_number":"pith:VG3DFDEZ","schema_version":"1.0","canonical_sha256":"a9b6328c99f9828a7262633789193fb8a84e1e189ceb32afc4af43a0dd16e080","source":{"kind":"arxiv","id":"math/0503442","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0503442","created_at":"2026-05-18T00:54:09.269003+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0503442v3","created_at":"2026-05-18T00:54:09.269003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0503442","created_at":"2026-05-18T00:54:09.269003+00:00"},{"alias_kind":"pith_short_12","alias_value":"VG3DFDEZ7GBI","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"VG3DFDEZ7GBIU4TC","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"VG3DFDEZ","created_at":"2026-05-18T12:25:53.939244+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/VG3DFDEZ7GBIU4TCMM3YSGJ7XC","json":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC.json","graph_json":"https://pith.science/api/pith-number/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/graph.json","events_json":"https://pith.science/api/pith-number/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/events.json","paper":"https://pith.science/paper/VG3DFDEZ"},"agent_actions":{"view_html":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC","download_json":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC.json","view_paper":"https://pith.science/paper/VG3DFDEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0503442&json=true","fetch_graph":"https://pith.science/api/pith-number/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/graph.json","fetch_events":"https://pith.science/api/pith-number/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/action/storage_attestation","attest_author":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/action/author_attestation","sign_citation":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/action/citation_signature","submit_replication":"https://pith.science/pith/VG3DFDEZ7GBIU4TCMM3YSGJ7XC/action/replication_record"}},"created_at":"2026-05-18T00:54:09.269003+00:00","updated_at":"2026-05-18T00:54:09.269003+00:00"}