{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:PH4EXJQW6QUKLNO7A6PP3JGYCJ","short_pith_number":"pith:PH4EXJQW","schema_version":"1.0","canonical_sha256":"79f84ba616f428a5b5df079efda4d8126678462653e9bd5db0b0a6ea3584cc08","source":{"kind":"arxiv","id":"0805.3407","version":1},"attestation_state":"computed","paper":{"title":"The least singular value of a random square matrix is O(n^{-1/2})","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.PR","authors_text":"Mark Rudelson, Roman Vershynin","submitted_at":"2008-05-22T18:44:22Z","abstract_excerpt":"Let A be a matrix whose entries are real i.i.d. centered random variables with unit variance and suitable moment assumptions. Then the smallest singular value of A is of order n^{-1/2} with high probability. The lower estimate of this type was proved recently by the authors; in this note we establish the matching upper estimate."},"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":"0805.3407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-05-22T18:44:22Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"1b6992bd25ca24d745d44fa337ba079e188e2f320adda1c4c84b417fa1ab0f11","abstract_canon_sha256":"c9066868c9f94c632f56d4671042d35834d54aba34f7d39e5260d2145c9ddc6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:14.243031Z","signature_b64":"iVXgmKkIBFxuve27dLeqHR4eGg2uv5kN+miSYKVH7Z0wDtxBku8Ytydg6mu1lAmZ9y6pDQokLBg/czCp/zZmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79f84ba616f428a5b5df079efda4d8126678462653e9bd5db0b0a6ea3584cc08","last_reissued_at":"2026-05-18T00:54:14.242622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:14.242622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The least singular value of a random square matrix is O(n^{-1/2})","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.PR","authors_text":"Mark Rudelson, Roman Vershynin","submitted_at":"2008-05-22T18:44:22Z","abstract_excerpt":"Let A be a matrix whose entries are real i.i.d. centered random variables with unit variance and suitable moment assumptions. Then the smallest singular value of A is of order n^{-1/2} with high probability. The lower estimate of this type was proved recently by the authors; in this note we establish the matching upper estimate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.3407","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":""},"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":"0805.3407","created_at":"2026-05-18T00:54:14.242691+00:00"},{"alias_kind":"arxiv_version","alias_value":"0805.3407v1","created_at":"2026-05-18T00:54:14.242691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.3407","created_at":"2026-05-18T00:54:14.242691+00:00"},{"alias_kind":"pith_short_12","alias_value":"PH4EXJQW6QUK","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"PH4EXJQW6QUKLNO7","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"PH4EXJQW","created_at":"2026-05-18T12:25:57.157939+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/PH4EXJQW6QUKLNO7A6PP3JGYCJ","json":"https://pith.science/pith/PH4EXJQW6QUKLNO7A6PP3JGYCJ.json","graph_json":"https://pith.science/api/pith-number/PH4EXJQW6QUKLNO7A6PP3JGYCJ/graph.json","events_json":"https://pith.science/api/pith-number/PH4EXJQW6QUKLNO7A6PP3JGYCJ/events.json","paper":"https://pith.science/paper/PH4EXJQW"},"agent_actions":{"view_html":"https://pith.science/pith/PH4EXJQW6QUKLNO7A6PP3JGYCJ","download_json":"https://pith.science/pith/PH4EXJQW6QUKLNO7A6PP3JGYCJ.json","view_paper":"https://pith.science/paper/PH4EXJQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0805.3407&json=true","fetch_graph":"https://pith.science/api/pith-number/PH4EXJQW6QUKLNO7A6PP3JGYCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PH4EXJQW6QUKLNO7A6PP3JGYCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PH4EXJQW6QUKLNO7A6PP3JGYCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PH4EXJQW6QUKLNO7A6PP3JGYCJ/action/storage_attestation","attest_author":"https://pith.science/pith/PH4EXJQW6QUKLNO7A6PP3JGYCJ/action/author_attestation","sign_citation":"https://pith.science/pith/PH4EXJQW6QUKLNO7A6PP3JGYCJ/action/citation_signature","submit_replication":"https://pith.science/pith/PH4EXJQW6QUKLNO7A6PP3JGYCJ/action/replication_record"}},"created_at":"2026-05-18T00:54:14.242691+00:00","updated_at":"2026-05-18T00:54:14.242691+00:00"}