{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N3WGOG5WOQEL76WT3URQWWZYDC","short_pith_number":"pith:N3WGOG5W","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"},"canonical_sha256":"6eec671bb67408bffad3dd230b5b38188bdeda671a2eee2ceec6171b800c22f5","source":{"kind":"arxiv","id":"1312.3580","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3580","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3580v1","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3580","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"N3WGOG5WOQEL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N3WGOG5WOQEL76WT","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N3WGOG5W","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N3WGOG5WOQEL76WT3URQWWZYDC","target":"record","payload":{"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"},"canonical_sha256":"6eec671bb67408bffad3dd230b5b38188bdeda671a2eee2ceec6171b800c22f5","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"},"source_kind":"arxiv","source_id":"1312.3580","source_version":1,"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-18T03:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKFwhvcXtkKHkJi3+BrKeZs0as/3IyI9HlGAJGZvjO7pKzT8srlFm0dif/YaPRAqzSx0mPPeSu4E8eqJT1tlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:23.893585Z"},"content_sha256":"f1ce4ffcf2623f8636901d7a50c685113c31475a5d966a96047068b708013015","schema_version":"1.0","event_id":"sha256:f1ce4ffcf2623f8636901d7a50c685113c31475a5d966a96047068b708013015"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N3WGOG5WOQEL76WT3URQWWZYDC","target":"graph","payload":{"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"},"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-18T03:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wxb2A1N/qbU7v5WQr4vEuyabbjbuiUuaFICzeua2Kouj8gwLJh6OPrhBsvlsOH8NYBKpPjk8ij4kKVeNNxnGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:23.894339Z"},"content_sha256":"2dc8577ddf526d529075f199004e621dd3f6d536c597ea1535699b6bb9172a54","schema_version":"1.0","event_id":"sha256:2dc8577ddf526d529075f199004e621dd3f6d536c597ea1535699b6bb9172a54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC/bundle.json","state_url":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3WGOG5WOQEL76WT3URQWWZYDC/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-05-31T09:58:23Z","links":{"resolver":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC","bundle":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC/bundle.json","state":"https://pith.science/pith/N3WGOG5WOQEL76WT3URQWWZYDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3WGOG5WOQEL76WT3URQWWZYDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N3WGOG5WOQEL76WT3URQWWZYDC","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":"9968ccb5018567990bf0d1bb9edaca76b3da8294ca1442f98270d2dedd446cf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-12T18:37:03Z","title_canon_sha256":"90ddc1eca470c571d91dcd6a132b054d28c4c45dd4648c04d9648aa4155a60c3"},"schema_version":"1.0","source":{"id":"1312.3580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3580","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3580v1","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3580","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"N3WGOG5WOQEL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N3WGOG5WOQEL76WT","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N3WGOG5W","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:2dc8577ddf526d529075f199004e621dd3f6d536c597ea1535699b6bb9172a54","target":"graph","created_at":"2026-05-18T03:04:50Z","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":"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 ","authors_text":"Shahar Mendelson, Vladimir Koltchinskii","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-12T18:37:03Z","title":"Bounding the smallest singular value of a random matrix without concentration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3580","kind":"arxiv","version":1},"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:f1ce4ffcf2623f8636901d7a50c685113c31475a5d966a96047068b708013015","target":"record","created_at":"2026-05-18T03:04:50Z","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":"9968ccb5018567990bf0d1bb9edaca76b3da8294ca1442f98270d2dedd446cf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-12T18:37:03Z","title_canon_sha256":"90ddc1eca470c571d91dcd6a132b054d28c4c45dd4648c04d9648aa4155a60c3"},"schema_version":"1.0","source":{"id":"1312.3580","kind":"arxiv","version":1}},"canonical_sha256":"6eec671bb67408bffad3dd230b5b38188bdeda671a2eee2ceec6171b800c22f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eec671bb67408bffad3dd230b5b38188bdeda671a2eee2ceec6171b800c22f5","first_computed_at":"2026-05-18T03:04:50.492274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:50.492274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uqfG3SJ+TujhEuCQiLF6oMFtb50lJ/OA5jTMUOjopPkrEK1JNHeyZAHBBj1js3RQFW11Y/+WaGgQnouHDwtcCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:50.493179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1ce4ffcf2623f8636901d7a50c685113c31475a5d966a96047068b708013015","sha256:2dc8577ddf526d529075f199004e621dd3f6d536c597ea1535699b6bb9172a54"],"state_sha256":"79c7655a00abb07597642dd59bccee22c28e332d0a188c8c3a0f93bb040cb78a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTQvnQRHkR7lKTTqCvsoemJeBRqczbwJd5Ab0Ff9SXuZ3sH/1lKf+a5s8i86uXtMsVBLFe+cTZSdrpXOxbNpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:58:23.898464Z","bundle_sha256":"a93cba60a32476b07dae7e6bf51476498bda641956ab80aa3396ad1b18dddecc"}}