{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VEBUKDAXBFAPY2AGZIBNQQMXIP","short_pith_number":"pith:VEBUKDAX","canonical_record":{"source":{"id":"2606.25204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-23T21:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"4207e05c4d3c9bad8eee2a4b212ceec5393ba4afa2bc7bb0137293e25b15ad4d","abstract_canon_sha256":"edd70b768333fe82ddb4c28adeb2773aa22bd2dee52c3e59d35b817b860481f5"},"schema_version":"1.0"},"canonical_sha256":"a903450c170940fc6806ca02d8419743d36c766cbbfaf420e74c7f98d0e32157","source":{"kind":"arxiv","id":"2606.25204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25204","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25204v1","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25204","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"pith_short_12","alias_value":"VEBUKDAXBFAP","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"pith_short_16","alias_value":"VEBUKDAXBFAPY2AG","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"pith_short_8","alias_value":"VEBUKDAX","created_at":"2026-06-25T00:18:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VEBUKDAXBFAPY2AGZIBNQQMXIP","target":"record","payload":{"canonical_record":{"source":{"id":"2606.25204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-23T21:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"4207e05c4d3c9bad8eee2a4b212ceec5393ba4afa2bc7bb0137293e25b15ad4d","abstract_canon_sha256":"edd70b768333fe82ddb4c28adeb2773aa22bd2dee52c3e59d35b817b860481f5"},"schema_version":"1.0"},"canonical_sha256":"a903450c170940fc6806ca02d8419743d36c766cbbfaf420e74c7f98d0e32157","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:20.764776Z","signature_b64":"OKMsuTr1lf/gXBcjy8/fIT/S5ykXahXMviE/Aig/rEJQefrT2/GcyQt9I8dNNqDcKtSgmmEonqgomr5hFCJ6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a903450c170940fc6806ca02d8419743d36c766cbbfaf420e74c7f98d0e32157","last_reissued_at":"2026-06-25T00:18:20.764376Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:20.764376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.25204","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-06-25T00:18:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mj3fv9h7bkukHyeydvLSX922VnatrIOP1yJqyniHPPX4as1Q1fVVODd2O8NZUAKCLd0PQetaM5AgGVGLU0Y5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:49:15.518437Z"},"content_sha256":"3b18d4eabbe2f6348f5f8c13a2bd3e82153edfd041654971dbe2f4b1747c1e70","schema_version":"1.0","event_id":"sha256:3b18d4eabbe2f6348f5f8c13a2bd3e82153edfd041654971dbe2f4b1747c1e70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VEBUKDAXBFAPY2AGZIBNQQMXIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential Rank Bounds for Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Achintya Raya Polavarapu","submitted_at":"2026-06-23T21:53:58Z","abstract_excerpt":"Fix $b\\in(0,1)$, let $1\\leq k\\leq n$, and let $A=(A_{ij})$ be an $n\\times n$ random matrix with independent real entries satisfying $$ \\sup_{x\\in\\mathbb{R}}\\mathbb{P}\\{A_{ij}=x\\}\\leq b<1 \\qquad (1\\leq i,j\\leq n). $$ We show that there exists $c>0$ such that $$ \\mathbb{P}\\{\\operatorname{rank} A\\leq n-k\\}\\leq \\exp(-cnk), \\qquad 1\\leq k\\leq n. $$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25204","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.25204/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"},"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-06-25T00:18:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RZ48QNNl2+umbOHymJoZ6SlfAsD0MOvsRqSs6eJ6grsXATKmzVK+nZgMH01vnHjzeW2FV2JKZPR8CCQ3NzzdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:49:15.518815Z"},"content_sha256":"6f7e33dc6bceb48c28de9e2c6b6641ae631d75e3e2722051c2292b55e85cb211","schema_version":"1.0","event_id":"sha256:6f7e33dc6bceb48c28de9e2c6b6641ae631d75e3e2722051c2292b55e85cb211"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEBUKDAXBFAPY2AGZIBNQQMXIP/bundle.json","state_url":"https://pith.science/pith/VEBUKDAXBFAPY2AGZIBNQQMXIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEBUKDAXBFAPY2AGZIBNQQMXIP/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-07-02T23:49:15Z","links":{"resolver":"https://pith.science/pith/VEBUKDAXBFAPY2AGZIBNQQMXIP","bundle":"https://pith.science/pith/VEBUKDAXBFAPY2AGZIBNQQMXIP/bundle.json","state":"https://pith.science/pith/VEBUKDAXBFAPY2AGZIBNQQMXIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEBUKDAXBFAPY2AGZIBNQQMXIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VEBUKDAXBFAPY2AGZIBNQQMXIP","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":"edd70b768333fe82ddb4c28adeb2773aa22bd2dee52c3e59d35b817b860481f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-23T21:53:58Z","title_canon_sha256":"4207e05c4d3c9bad8eee2a4b212ceec5393ba4afa2bc7bb0137293e25b15ad4d"},"schema_version":"1.0","source":{"id":"2606.25204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25204","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25204v1","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25204","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"pith_short_12","alias_value":"VEBUKDAXBFAP","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"pith_short_16","alias_value":"VEBUKDAXBFAPY2AG","created_at":"2026-06-25T00:18:20Z"},{"alias_kind":"pith_short_8","alias_value":"VEBUKDAX","created_at":"2026-06-25T00:18:20Z"}],"graph_snapshots":[{"event_id":"sha256:6f7e33dc6bceb48c28de9e2c6b6641ae631d75e3e2722051c2292b55e85cb211","target":"graph","created_at":"2026-06-25T00:18:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.25204/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fix $b\\in(0,1)$, let $1\\leq k\\leq n$, and let $A=(A_{ij})$ be an $n\\times n$ random matrix with independent real entries satisfying $$ \\sup_{x\\in\\mathbb{R}}\\mathbb{P}\\{A_{ij}=x\\}\\leq b<1 \\qquad (1\\leq i,j\\leq n). $$ We show that there exists $c>0$ such that $$ \\mathbb{P}\\{\\operatorname{rank} A\\leq n-k\\}\\leq \\exp(-cnk), \\qquad 1\\leq k\\leq n. $$","authors_text":"Achintya Raya Polavarapu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-23T21:53:58Z","title":"Exponential Rank Bounds for Random Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25204","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:3b18d4eabbe2f6348f5f8c13a2bd3e82153edfd041654971dbe2f4b1747c1e70","target":"record","created_at":"2026-06-25T00:18:20Z","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":"edd70b768333fe82ddb4c28adeb2773aa22bd2dee52c3e59d35b817b860481f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-23T21:53:58Z","title_canon_sha256":"4207e05c4d3c9bad8eee2a4b212ceec5393ba4afa2bc7bb0137293e25b15ad4d"},"schema_version":"1.0","source":{"id":"2606.25204","kind":"arxiv","version":1}},"canonical_sha256":"a903450c170940fc6806ca02d8419743d36c766cbbfaf420e74c7f98d0e32157","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a903450c170940fc6806ca02d8419743d36c766cbbfaf420e74c7f98d0e32157","first_computed_at":"2026-06-25T00:18:20.764376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T00:18:20.764376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OKMsuTr1lf/gXBcjy8/fIT/S5ykXahXMviE/Aig/rEJQefrT2/GcyQt9I8dNNqDcKtSgmmEonqgomr5hFCJ6Dw==","signature_status":"signed_v1","signed_at":"2026-06-25T00:18:20.764776Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.25204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b18d4eabbe2f6348f5f8c13a2bd3e82153edfd041654971dbe2f4b1747c1e70","sha256:6f7e33dc6bceb48c28de9e2c6b6641ae631d75e3e2722051c2292b55e85cb211"],"state_sha256":"7f1245a8ca0eea87a305bc7acdc6ae6f42c8e12fa1faa207ca97596f5d5f330f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+MY7J8g7yt6gYyEd/L5RYYcCwAvrOCoRKZXiysygbGwbnSbsoHjcF98T8gqWAgX7wV5GjfbfTXovlPn4hwNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:49:15.520827Z","bundle_sha256":"28cf3adc044105c8ef8abd00f4388c5511b9f91d83364c9d119853530cfc1af1"}}