{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6W2UJZMC2VGBFHI5HTNOZHSO6S","short_pith_number":"pith:6W2UJZMC","schema_version":"1.0","canonical_sha256":"f5b544e582d54c129d1d3cdaec9e4ef495c5cba2827d9e509bde0b86dd9c5c22","source":{"kind":"arxiv","id":"1909.04798","version":2},"attestation_state":"computed","paper":{"title":"Unified $\\ell_{2\\rightarrow\\infty}$ Eigenspace Perturbation Theory for Symmetric Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Lihua Lei","submitted_at":"2019-09-11T00:21:49Z","abstract_excerpt":"Modern applications in statistics, computer science and network science have seen tremendous values of finer matrix spectral perturbation theory. In this paper, we derive a generic $\\ell_{2\\rightarrow\\infty}$ eigenspace perturbation bound for symmetric random matrices, with independent or dependent entries and fairly flexible entry distributions. In particular, we apply our generic bound to binary random matrices with independent entries or with certain dependency structures, including the unnormalized Laplacian of inhomogenous random graphs and $m$-dependent matrices. Through a detailed compa"},"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":"1909.04798","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-09-11T00:21:49Z","cross_cats_sorted":["math.SP","math.ST","stat.TH"],"title_canon_sha256":"e8ebc1bcf5f6077b56171b4fbf02d0a4a9e08f895f478431b563f8344cc4acb0","abstract_canon_sha256":"c49be69c94ff70b74ed36b9a1474afb36a11dba9bfcac8cbf5846792c4b7e1eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:04.740691Z","signature_b64":"th6H+XiUnznSKOwOVJJ704+knj6w2pqE9+zlefW0ye03cIPSilkcAt2fzrQ4LrEIHpLfvZOmXjKiXxxwUHUNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5b544e582d54c129d1d3cdaec9e4ef495c5cba2827d9e509bde0b86dd9c5c22","last_reissued_at":"2026-07-05T00:58:04.740256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:04.740256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unified $\\ell_{2\\rightarrow\\infty}$ Eigenspace Perturbation Theory for Symmetric Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Lihua Lei","submitted_at":"2019-09-11T00:21:49Z","abstract_excerpt":"Modern applications in statistics, computer science and network science have seen tremendous values of finer matrix spectral perturbation theory. In this paper, we derive a generic $\\ell_{2\\rightarrow\\infty}$ eigenspace perturbation bound for symmetric random matrices, with independent or dependent entries and fairly flexible entry distributions. In particular, we apply our generic bound to binary random matrices with independent entries or with certain dependency structures, including the unnormalized Laplacian of inhomogenous random graphs and $m$-dependent matrices. Through a detailed compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04798","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.04798/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.04798","created_at":"2026-07-05T00:58:04.740325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.04798v2","created_at":"2026-07-05T00:58:04.740325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04798","created_at":"2026-07-05T00:58:04.740325+00:00"},{"alias_kind":"pith_short_12","alias_value":"6W2UJZMC2VGB","created_at":"2026-07-05T00:58:04.740325+00:00"},{"alias_kind":"pith_short_16","alias_value":"6W2UJZMC2VGBFHI5","created_at":"2026-07-05T00:58:04.740325+00:00"},{"alias_kind":"pith_short_8","alias_value":"6W2UJZMC","created_at":"2026-07-05T00:58:04.740325+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11263","citing_title":"Geometric bias in eigenspace perturbation under random heterogeneous noise","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2309.00578","citing_title":"Consistency of Lloyd's Algorithm Under Perturbations","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2308.02480","citing_title":"Statistical Inference for Linear Functions of Eigenvectors with Small Eigengaps","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2411.11728","citing_title":"Davis-Kahan Theorem in the two-to-infinity norm and its application to perfect clustering","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6W2UJZMC2VGBFHI5HTNOZHSO6S","json":"https://pith.science/pith/6W2UJZMC2VGBFHI5HTNOZHSO6S.json","graph_json":"https://pith.science/api/pith-number/6W2UJZMC2VGBFHI5HTNOZHSO6S/graph.json","events_json":"https://pith.science/api/pith-number/6W2UJZMC2VGBFHI5HTNOZHSO6S/events.json","paper":"https://pith.science/paper/6W2UJZMC"},"agent_actions":{"view_html":"https://pith.science/pith/6W2UJZMC2VGBFHI5HTNOZHSO6S","download_json":"https://pith.science/pith/6W2UJZMC2VGBFHI5HTNOZHSO6S.json","view_paper":"https://pith.science/paper/6W2UJZMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.04798&json=true","fetch_graph":"https://pith.science/api/pith-number/6W2UJZMC2VGBFHI5HTNOZHSO6S/graph.json","fetch_events":"https://pith.science/api/pith-number/6W2UJZMC2VGBFHI5HTNOZHSO6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6W2UJZMC2VGBFHI5HTNOZHSO6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6W2UJZMC2VGBFHI5HTNOZHSO6S/action/storage_attestation","attest_author":"https://pith.science/pith/6W2UJZMC2VGBFHI5HTNOZHSO6S/action/author_attestation","sign_citation":"https://pith.science/pith/6W2UJZMC2VGBFHI5HTNOZHSO6S/action/citation_signature","submit_replication":"https://pith.science/pith/6W2UJZMC2VGBFHI5HTNOZHSO6S/action/replication_record"}},"created_at":"2026-07-05T00:58:04.740325+00:00","updated_at":"2026-07-05T00:58:04.740325+00:00"}