{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OUUFQW2LLMZUW6JHNGPLS4H5O7","short_pith_number":"pith:OUUFQW2L","schema_version":"1.0","canonical_sha256":"7528585b4b5b334b7927699eb970fd77c908d5369f1e1a2f6de96f5598f681b0","source":{"kind":"arxiv","id":"1405.0680","version":1},"attestation_state":"computed","paper":{"title":"A useful variant of the Davis--Kahan theorem for statisticians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Richard J. Samworth, Tengyao Wang, Yi Yu","submitted_at":"2014-05-04T10:57:43Z","abstract_excerpt":"The Davis--Kahan theorem is used in the analysis of many statistical procedures to bound the distance between subspaces spanned by population eigenvectors and their sample versions. It relies on an eigenvalue separation condition between certain relevant population and sample eigenvalues. We present a variant of this result that depends only on a population eigenvalue separation condition, making it more natural and convenient for direct application in statistical contexts, and improving the bounds in some cases. We also provide an extension to situations where the matrices under study may be "},"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":"1405.0680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-04T10:57:43Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"e3dca5eb00e3477c87d9ab7c8b951ea0d39260e1f8870c8043d605527a3e4656","abstract_canon_sha256":"2a9548f4774ac367616487233d3ac4e172cf67d5f7a2953ed59aa34c7544e779"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:40.938932Z","signature_b64":"X9S7WaajJIlCmYfKx/dSHn1ZnR1n2qXsuUI25Hb9+PhXgxuNsB3GYjcl36AmnMAFjjakZvPkIId58t0Hbvr2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7528585b4b5b334b7927699eb970fd77c908d5369f1e1a2f6de96f5598f681b0","last_reissued_at":"2026-05-18T02:52:40.938341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:40.938341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A useful variant of the Davis--Kahan theorem for statisticians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Richard J. Samworth, Tengyao Wang, Yi Yu","submitted_at":"2014-05-04T10:57:43Z","abstract_excerpt":"The Davis--Kahan theorem is used in the analysis of many statistical procedures to bound the distance between subspaces spanned by population eigenvectors and their sample versions. It relies on an eigenvalue separation condition between certain relevant population and sample eigenvalues. We present a variant of this result that depends only on a population eigenvalue separation condition, making it more natural and convenient for direct application in statistical contexts, and improving the bounds in some cases. We also provide an extension to situations where the matrices under study may be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0680","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":"1405.0680","created_at":"2026-05-18T02:52:40.938416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0680v1","created_at":"2026-05-18T02:52:40.938416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0680","created_at":"2026-05-18T02:52:40.938416+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUUFQW2LLMZU","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUUFQW2LLMZUW6JH","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUUFQW2L","created_at":"2026-05-18T12:28:43.426989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17951","citing_title":"Graph-Theoretic Detection of Hilbert Space Fragmentation","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OUUFQW2LLMZUW6JHNGPLS4H5O7","json":"https://pith.science/pith/OUUFQW2LLMZUW6JHNGPLS4H5O7.json","graph_json":"https://pith.science/api/pith-number/OUUFQW2LLMZUW6JHNGPLS4H5O7/graph.json","events_json":"https://pith.science/api/pith-number/OUUFQW2LLMZUW6JHNGPLS4H5O7/events.json","paper":"https://pith.science/paper/OUUFQW2L"},"agent_actions":{"view_html":"https://pith.science/pith/OUUFQW2LLMZUW6JHNGPLS4H5O7","download_json":"https://pith.science/pith/OUUFQW2LLMZUW6JHNGPLS4H5O7.json","view_paper":"https://pith.science/paper/OUUFQW2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0680&json=true","fetch_graph":"https://pith.science/api/pith-number/OUUFQW2LLMZUW6JHNGPLS4H5O7/graph.json","fetch_events":"https://pith.science/api/pith-number/OUUFQW2LLMZUW6JHNGPLS4H5O7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUUFQW2LLMZUW6JHNGPLS4H5O7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUUFQW2LLMZUW6JHNGPLS4H5O7/action/storage_attestation","attest_author":"https://pith.science/pith/OUUFQW2LLMZUW6JHNGPLS4H5O7/action/author_attestation","sign_citation":"https://pith.science/pith/OUUFQW2LLMZUW6JHNGPLS4H5O7/action/citation_signature","submit_replication":"https://pith.science/pith/OUUFQW2LLMZUW6JHNGPLS4H5O7/action/replication_record"}},"created_at":"2026-05-18T02:52:40.938416+00:00","updated_at":"2026-05-18T02:52:40.938416+00:00"}