{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AF7XMA22ODPO2S3OFGQ34OA2JA","short_pith_number":"pith:AF7XMA22","schema_version":"1.0","canonical_sha256":"017f76035a70deed4b6e29a1be381a480f5f40aa7f5c7d1d4a575802d43a91ad","source":{"kind":"arxiv","id":"1004.4389","version":7},"attestation_state":"computed","paper":{"title":"User-friendly tail bounds for sums of random matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Joel A. Tropp","submitted_at":"2010-04-25T23:21:23Z","abstract_excerpt":"This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the large-deviation behavior of the maximum eigenvalue of the sum. Tail bounds for the norm of a sum of random rectangular matrices follow as an immediate corollary. The proof techniques also yield some information about matrix-valued martingales.\n  In other words, this paper provides noncommutative generalizations of the classical bounds associated with the names Azuma, 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":"1004.4389","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-25T23:21:23Z","cross_cats_sorted":[],"title_canon_sha256":"92e12765405b869d8b99cadc928246ded5806d496fdf50d7eb230913e3aba534","abstract_canon_sha256":"567d63288ab21f5b795f9480f747cbef4e6ef4843473b7348c2918e064b390f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:15.984571Z","signature_b64":"fwBeLHg7D5QAhVEGYAP2pHfvQg4vGsuV6BbiQW7D0p2p9V3JpgM7OZuotfl/T31wlWmknjhs+HZSszBIBlPQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"017f76035a70deed4b6e29a1be381a480f5f40aa7f5c7d1d4a575802d43a91ad","last_reissued_at":"2026-05-18T02:53:15.984019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:15.984019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"User-friendly tail bounds for sums of random matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Joel A. Tropp","submitted_at":"2010-04-25T23:21:23Z","abstract_excerpt":"This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the large-deviation behavior of the maximum eigenvalue of the sum. Tail bounds for the norm of a sum of random rectangular matrices follow as an immediate corollary. The proof techniques also yield some information about matrix-valued martingales.\n  In other words, this paper provides noncommutative generalizations of the classical bounds associated with the names Azuma, Be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4389","kind":"arxiv","version":7},"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":"1004.4389","created_at":"2026-05-18T02:53:15.984074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.4389v7","created_at":"2026-05-18T02:53:15.984074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4389","created_at":"2026-05-18T02:53:15.984074+00:00"},{"alias_kind":"pith_short_12","alias_value":"AF7XMA22ODPO","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AF7XMA22ODPO2S3O","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AF7XMA22","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10340","citing_title":"Flows in Almost Linear Time via Adaptive Preconditioning","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AF7XMA22ODPO2S3OFGQ34OA2JA","json":"https://pith.science/pith/AF7XMA22ODPO2S3OFGQ34OA2JA.json","graph_json":"https://pith.science/api/pith-number/AF7XMA22ODPO2S3OFGQ34OA2JA/graph.json","events_json":"https://pith.science/api/pith-number/AF7XMA22ODPO2S3OFGQ34OA2JA/events.json","paper":"https://pith.science/paper/AF7XMA22"},"agent_actions":{"view_html":"https://pith.science/pith/AF7XMA22ODPO2S3OFGQ34OA2JA","download_json":"https://pith.science/pith/AF7XMA22ODPO2S3OFGQ34OA2JA.json","view_paper":"https://pith.science/paper/AF7XMA22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.4389&json=true","fetch_graph":"https://pith.science/api/pith-number/AF7XMA22ODPO2S3OFGQ34OA2JA/graph.json","fetch_events":"https://pith.science/api/pith-number/AF7XMA22ODPO2S3OFGQ34OA2JA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AF7XMA22ODPO2S3OFGQ34OA2JA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AF7XMA22ODPO2S3OFGQ34OA2JA/action/storage_attestation","attest_author":"https://pith.science/pith/AF7XMA22ODPO2S3OFGQ34OA2JA/action/author_attestation","sign_citation":"https://pith.science/pith/AF7XMA22ODPO2S3OFGQ34OA2JA/action/citation_signature","submit_replication":"https://pith.science/pith/AF7XMA22ODPO2S3OFGQ34OA2JA/action/replication_record"}},"created_at":"2026-05-18T02:53:15.984074+00:00","updated_at":"2026-05-18T02:53:15.984074+00:00"}