{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CKWEZZ2OQXQR52JQTV3IULC6PL","short_pith_number":"pith:CKWEZZ2O","schema_version":"1.0","canonical_sha256":"12ac4ce74e85e11ee9309d768a2c5e7ad6e9d4061c2804cc1bd21f5df4178a5a","source":{"kind":"arxiv","id":"2603.04365","version":3},"attestation_state":"computed","paper":{"title":"Comparison theorems for the extreme eigenvalues of a random symmetric matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Joel A. Tropp","submitted_at":"2026-03-04T18:30:04Z","abstract_excerpt":"This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian random matrix whose statistics match the sum, and it strengthens previous results of this type. Corollaries address the minimum eigenvalue and the spectral norm; the proof strategy also extends to matrix martingale sequences.\n  The comparison methodology is powerful because of the vast arsenal of tools for treating Gaussian random matrices. As applications, "},"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":"2603.04365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-03-04T18:30:04Z","cross_cats_sorted":["cs.NA","math.NA","math.ST","stat.TH"],"title_canon_sha256":"eee4193c823f266b2c8e677e2b42585b4c42badb8cbdef8d0dd4ac84b4b452ca","abstract_canon_sha256":"630ea065d2fe48c86f9310fdaa0af49a287f7eb42a2797994f898d8d35f4b377"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:18:36.405790Z","signature_b64":"TjQ2mjnku+Ku3VzDNuDw6BZ/kw+pH+v7KEIcLLhPgkga7sOuwHRds5WU7EDItiyeuTrJYWNdZDU60QwWm/VbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12ac4ce74e85e11ee9309d768a2c5e7ad6e9d4061c2804cc1bd21f5df4178a5a","last_reissued_at":"2026-07-07T02:18:36.404712Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:18:36.404712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparison theorems for the extreme eigenvalues of a random symmetric matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Joel A. Tropp","submitted_at":"2026-03-04T18:30:04Z","abstract_excerpt":"This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian random matrix whose statistics match the sum, and it strengthens previous results of this type. Corollaries address the minimum eigenvalue and the spectral norm; the proof strategy also extends to matrix martingale sequences.\n  The comparison methodology is powerful because of the vast arsenal of tools for treating Gaussian random matrices. As applications, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.04365","kind":"arxiv","version":3},"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/2603.04365/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":"2603.04365","created_at":"2026-07-07T02:18:36.404829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.04365v3","created_at":"2026-07-07T02:18:36.404829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.04365","created_at":"2026-07-07T02:18:36.404829+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKWEZZ2OQXQR","created_at":"2026-07-07T02:18:36.404829+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKWEZZ2OQXQR52JQ","created_at":"2026-07-07T02:18:36.404829+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKWEZZ2O","created_at":"2026-07-07T02:18:36.404829+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05384","citing_title":"Well-invertible column subsets of sparse matrices are rare","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CKWEZZ2OQXQR52JQTV3IULC6PL","json":"https://pith.science/pith/CKWEZZ2OQXQR52JQTV3IULC6PL.json","graph_json":"https://pith.science/api/pith-number/CKWEZZ2OQXQR52JQTV3IULC6PL/graph.json","events_json":"https://pith.science/api/pith-number/CKWEZZ2OQXQR52JQTV3IULC6PL/events.json","paper":"https://pith.science/paper/CKWEZZ2O"},"agent_actions":{"view_html":"https://pith.science/pith/CKWEZZ2OQXQR52JQTV3IULC6PL","download_json":"https://pith.science/pith/CKWEZZ2OQXQR52JQTV3IULC6PL.json","view_paper":"https://pith.science/paper/CKWEZZ2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.04365&json=true","fetch_graph":"https://pith.science/api/pith-number/CKWEZZ2OQXQR52JQTV3IULC6PL/graph.json","fetch_events":"https://pith.science/api/pith-number/CKWEZZ2OQXQR52JQTV3IULC6PL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKWEZZ2OQXQR52JQTV3IULC6PL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKWEZZ2OQXQR52JQTV3IULC6PL/action/storage_attestation","attest_author":"https://pith.science/pith/CKWEZZ2OQXQR52JQTV3IULC6PL/action/author_attestation","sign_citation":"https://pith.science/pith/CKWEZZ2OQXQR52JQTV3IULC6PL/action/citation_signature","submit_replication":"https://pith.science/pith/CKWEZZ2OQXQR52JQTV3IULC6PL/action/replication_record"}},"created_at":"2026-07-07T02:18:36.404829+00:00","updated_at":"2026-07-07T02:18:36.404829+00:00"}