{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:N3WGOG5WOQEL76WT3URQWWZYDC","short_pith_number":"pith:N3WGOG5W","schema_version":"1.0","canonical_sha256":"6eec671bb67408bffad3dd230b5b38188bdeda671a2eee2ceec6171b800c22f5","source":{"kind":"arxiv","id":"1312.3580","version":1},"attestation_state":"computed","paper":{"title":"Bounding the smallest singular value of a random matrix without concentration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Shahar Mendelson, Vladimir Koltchinskii","submitted_at":"2013-12-12T18:37:03Z","abstract_excerpt":"Given $X$ a random vector in ${\\mathbb{R}}^n$, set $X_1,...,X_N$ to be independent copies of $X$ and let $\\Gamma=\\frac{1}{\\sqrt{N}}\\sum_{i=1}^N <X_i,\\cdot>e_i$ be the matrix whose rows are $\\frac{X_1}{\\sqrt{N}},\\dots, \\frac{X_N}{\\sqrt{N}}$.\n  We obtain sharp probabilistic lower bounds on the smallest singular value $\\lambda_{\\min}(\\Gamma)$ in a rather general situation, and in particular, under the assumption that $X$ is an isotropic random vector for which $\\sup_{t\\in S^{n-1}}{\\mathbb{E}}|<t,X>|^{2+\\eta} \\leq L$ for some $L,\\eta>0$. Our results imply that a Bai-Yin type lower bound holds for "},"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":"1312.3580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-12T18:37:03Z","cross_cats_sorted":[],"title_canon_sha256":"90ddc1eca470c571d91dcd6a132b054d28c4c45dd4648c04d9648aa4155a60c3","abstract_canon_sha256":"9968ccb5018567990bf0d1bb9edaca76b3da8294ca1442f98270d2dedd446cf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:50.493179Z","signature_b64":"uqfG3SJ+TujhEuCQiLF6oMFtb50lJ/OA5jTMUOjopPkrEK1JNHeyZAHBBj1js3RQFW11Y/+WaGgQnouHDwtcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eec671bb67408bffad3dd230b5b38188bdeda671a2eee2ceec6171b800c22f5","last_reissued_at":"2026-05-18T03:04:50.492274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:50.492274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the smallest singular value of a random matrix without concentration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Shahar Mendelson, Vladimir Koltchinskii","submitted_at":"2013-12-12T18:37:03Z","abstract_excerpt":"Given $X$ a random vector in ${\\mathbb{R}}^n$, set $X_1,...,X_N$ to be independent copies of $X$ and let $\\Gamma=\\frac{1}{\\sqrt{N}}\\sum_{i=1}^N <X_i,\\cdot>e_i$ be the matrix whose rows are $\\frac{X_1}{\\sqrt{N}},\\dots, \\frac{X_N}{\\sqrt{N}}$.\n  We obtain sharp probabilistic lower bounds on the smallest singular value $\\lambda_{\\min}(\\Gamma)$ in a rather general situation, and in particular, under the assumption that $X$ is an isotropic random vector for which $\\sup_{t\\in S^{n-1}}{\\mathbb{E}}|<t,X>|^{2+\\eta} \\leq L$ for some $L,\\eta>0$. Our results imply that a Bai-Yin type lower bound holds for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3580","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":"1312.3580","created_at":"2026-05-18T03:04:50.492432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3580v1","created_at":"2026-05-18T03:04:50.492432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3580","created_at":"2026-05-18T03:04:50.492432+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3WGOG5WOQEL","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3WGOG5WOQEL76WT","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3WGOG5W","created_at":"2026-05-18T12:27:52.871228+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/N3WGOG5WOQEL76WT3URQWWZYDC","json":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC.json","graph_json":"https://pith.science/api/pith-number/N3WGOG5WOQEL76WT3URQWWZYDC/graph.json","events_json":"https://pith.science/api/pith-number/N3WGOG5WOQEL76WT3URQWWZYDC/events.json","paper":"https://pith.science/paper/N3WGOG5W"},"agent_actions":{"view_html":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC","download_json":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC.json","view_paper":"https://pith.science/paper/N3WGOG5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3580&json=true","fetch_graph":"https://pith.science/api/pith-number/N3WGOG5WOQEL76WT3URQWWZYDC/graph.json","fetch_events":"https://pith.science/api/pith-number/N3WGOG5WOQEL76WT3URQWWZYDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC/action/storage_attestation","attest_author":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC/action/author_attestation","sign_citation":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC/action/citation_signature","submit_replication":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC/action/replication_record"}},"created_at":"2026-05-18T03:04:50.492432+00:00","updated_at":"2026-05-18T03:04:50.492432+00:00"}