{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D3GFVLYQREOEHFLQUB4WRTNP43","short_pith_number":"pith:D3GFVLYQ","schema_version":"1.0","canonical_sha256":"1ecc5aaf10891c439570a07968cdafe6dd9c361e783d2f2102c305b5581ba0fb","source":{"kind":"arxiv","id":"1306.2887","version":2},"attestation_state":"computed","paper":{"title":"Delocalization of eigenvectors of random matrices with independent entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Mark Rudelson, Roman Vershynin","submitted_at":"2013-06-12T16:37:53Z","abstract_excerpt":"We prove that an n by n random matrix G with independent entries is completely delocalized. Suppose the entries of G have zero means, variances uniformly bounded below, and a uniform tail decay of exponential type. Then with high probability all unit eigenvectors of G have all coordinates of magnitude O(n^{-1/2}), modulo logarithmic corrections. This comes a consequence of a new, geometric, approach to delocalization for random matrices."},"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":"1306.2887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-06-12T16:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"31aca4a938e32ebe837cb70b1a8d9ed15d2207cbe15fedd8763bfba50a899ecc","abstract_canon_sha256":"c1524598f34e3a5f394581b8477f399a5e3f0f7d5c1b99ea5b960487dd6d44b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:06.220617Z","signature_b64":"ZUe2dqKXIwIuW3nciZa0IQKlA2VKcWxVPXhd0lYDy0BTTZd6i6x6HDy9ySnLtTV6WTSlYEttBdFY6GIEXJGzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ecc5aaf10891c439570a07968cdafe6dd9c361e783d2f2102c305b5581ba0fb","last_reissued_at":"2026-05-18T01:28:06.219987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:06.219987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delocalization of eigenvectors of random matrices with independent entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Mark Rudelson, Roman Vershynin","submitted_at":"2013-06-12T16:37:53Z","abstract_excerpt":"We prove that an n by n random matrix G with independent entries is completely delocalized. Suppose the entries of G have zero means, variances uniformly bounded below, and a uniform tail decay of exponential type. Then with high probability all unit eigenvectors of G have all coordinates of magnitude O(n^{-1/2}), modulo logarithmic corrections. This comes a consequence of a new, geometric, approach to delocalization for random matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2887","kind":"arxiv","version":2},"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":"1306.2887","created_at":"2026-05-18T01:28:06.220098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2887v2","created_at":"2026-05-18T01:28:06.220098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2887","created_at":"2026-05-18T01:28:06.220098+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3GFVLYQREOE","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3GFVLYQREOEHFLQ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3GFVLYQ","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2008.02217","citing_title":"Hopfield Networks is All You Need","ref_index":135,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3GFVLYQREOEHFLQUB4WRTNP43","json":"https://pith.science/pith/D3GFVLYQREOEHFLQUB4WRTNP43.json","graph_json":"https://pith.science/api/pith-number/D3GFVLYQREOEHFLQUB4WRTNP43/graph.json","events_json":"https://pith.science/api/pith-number/D3GFVLYQREOEHFLQUB4WRTNP43/events.json","paper":"https://pith.science/paper/D3GFVLYQ"},"agent_actions":{"view_html":"https://pith.science/pith/D3GFVLYQREOEHFLQUB4WRTNP43","download_json":"https://pith.science/pith/D3GFVLYQREOEHFLQUB4WRTNP43.json","view_paper":"https://pith.science/paper/D3GFVLYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2887&json=true","fetch_graph":"https://pith.science/api/pith-number/D3GFVLYQREOEHFLQUB4WRTNP43/graph.json","fetch_events":"https://pith.science/api/pith-number/D3GFVLYQREOEHFLQUB4WRTNP43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3GFVLYQREOEHFLQUB4WRTNP43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3GFVLYQREOEHFLQUB4WRTNP43/action/storage_attestation","attest_author":"https://pith.science/pith/D3GFVLYQREOEHFLQUB4WRTNP43/action/author_attestation","sign_citation":"https://pith.science/pith/D3GFVLYQREOEHFLQUB4WRTNP43/action/citation_signature","submit_replication":"https://pith.science/pith/D3GFVLYQREOEHFLQUB4WRTNP43/action/replication_record"}},"created_at":"2026-05-18T01:28:06.220098+00:00","updated_at":"2026-05-18T01:28:06.220098+00:00"}