{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Z7JADHALD5KVUHQFREDFRBYWHH","short_pith_number":"pith:Z7JADHAL","canonical_record":{"source":{"id":"1904.10592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-24T01:20:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c28483aa9b11af18cc3d00527cfb9ac79da29b3a9018ae300aa602202f3a86ab","abstract_canon_sha256":"b720b62a5f51b7a744f0f2670c05e3212d866512cdaaac4f483df41386a5b1f4"},"schema_version":"1.0"},"canonical_sha256":"cfd2019c0b1f555a1e05890658871639e410fff22fa86a8014332207b1993abe","source":{"kind":"arxiv","id":"1904.10592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10592","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10592v1","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10592","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"Z7JADHALD5KV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z7JADHALD5KVUHQF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z7JADHAL","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Z7JADHALD5KVUHQFREDFRBYWHH","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-24T01:20:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c28483aa9b11af18cc3d00527cfb9ac79da29b3a9018ae300aa602202f3a86ab","abstract_canon_sha256":"b720b62a5f51b7a744f0f2670c05e3212d866512cdaaac4f483df41386a5b1f4"},"schema_version":"1.0"},"canonical_sha256":"cfd2019c0b1f555a1e05890658871639e410fff22fa86a8014332207b1993abe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:53.306935Z","signature_b64":"8mEdjv68TWHN6cGBUNBx0d7m7Jt5oSwc95lwC59y1Ez1MH261E2XjVnrSLJbQBzWCScWdtJkn8zFTTJSHJg8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfd2019c0b1f555a1e05890658871639e410fff22fa86a8014332207b1993abe","last_reissued_at":"2026-05-17T23:47:53.306468Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:53.306468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10592","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-05-17T23:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWTJPtEVbrc7J+m7D7tYwLSaWpUWyIewCs8PVydoqQrtNBqvfV2vm3zq7ftn3KPfbpo7h4LR5IPOUbE3Y0dUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:29:47.359860Z"},"content_sha256":"ec5a536b23763f347411e3690b0cd457cbf274e1f8c6d045dd9bb04696ab4f3b","schema_version":"1.0","event_id":"sha256:ec5a536b23763f347411e3690b0cd457cbf274e1f8c6d045dd9bb04696ab4f3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Z7JADHALD5KVUHQFREDFRBYWHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Vishesh Jain","submitted_at":"2019-04-24T01:20:24Z","abstract_excerpt":"An approximate Spielman-Teng theorem for the least singular value $s_n(M_n)$ of a random $n\\times n$ square matrix $M_n$ is a statement of the following form: there exist constants $C,c >0$ such that for all $\\eta \\geq 0$, $\\Pr(s_n(M_n) \\leq \\eta) \\lesssim n^{C}\\eta + \\exp(-n^{c})$. The goal of this paper is to develop a simple and novel framework for proving such results for discrete random matrices. As an application, we prove an approximate Spielman-Teng theorem for $\\{0,1\\}$-valued matrices, each of whose rows is an independent vector with exactly $n/2$ zero components. This improves on pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10592","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"},"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-05-17T23:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bu+Cvb6aeUURV0FwiUo3OO6kEsyyRW3u867i/9pajtv3w/AtO/ihEFNnSm5cgfleC3ys8VhLtkeiJ/lKWZ+cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:29:47.360336Z"},"content_sha256":"97358265d3c53c641447adba5123c4ebde7b2089e6e325fd919f89804e4b9469","schema_version":"1.0","event_id":"sha256:97358265d3c53c641447adba5123c4ebde7b2089e6e325fd919f89804e4b9469"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH/bundle.json","state_url":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7JADHALD5KVUHQFREDFRBYWHH/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-08-16T19:29:47Z","links":{"resolver":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH","bundle":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH/bundle.json","state":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7JADHALD5KVUHQFREDFRBYWHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Z7JADHALD5KVUHQFREDFRBYWHH","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":"b720b62a5f51b7a744f0f2670c05e3212d866512cdaaac4f483df41386a5b1f4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-24T01:20:24Z","title_canon_sha256":"c28483aa9b11af18cc3d00527cfb9ac79da29b3a9018ae300aa602202f3a86ab"},"schema_version":"1.0","source":{"id":"1904.10592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10592","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10592v1","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10592","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"Z7JADHALD5KV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z7JADHALD5KVUHQF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z7JADHAL","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:97358265d3c53c641447adba5123c4ebde7b2089e6e325fd919f89804e4b9469","target":"graph","created_at":"2026-05-17T23:47:53Z","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"},"paper":{"abstract_excerpt":"An approximate Spielman-Teng theorem for the least singular value $s_n(M_n)$ of a random $n\\times n$ square matrix $M_n$ is a statement of the following form: there exist constants $C,c >0$ such that for all $\\eta \\geq 0$, $\\Pr(s_n(M_n) \\leq \\eta) \\lesssim n^{C}\\eta + \\exp(-n^{c})$. The goal of this paper is to develop a simple and novel framework for proving such results for discrete random matrices. As an application, we prove an approximate Spielman-Teng theorem for $\\{0,1\\}$-valued matrices, each of whose rows is an independent vector with exactly $n/2$ zero components. This improves on pr","authors_text":"Vishesh Jain","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-24T01:20:24Z","title":"Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10592","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:ec5a536b23763f347411e3690b0cd457cbf274e1f8c6d045dd9bb04696ab4f3b","target":"record","created_at":"2026-05-17T23:47:53Z","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":"b720b62a5f51b7a744f0f2670c05e3212d866512cdaaac4f483df41386a5b1f4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-24T01:20:24Z","title_canon_sha256":"c28483aa9b11af18cc3d00527cfb9ac79da29b3a9018ae300aa602202f3a86ab"},"schema_version":"1.0","source":{"id":"1904.10592","kind":"arxiv","version":1}},"canonical_sha256":"cfd2019c0b1f555a1e05890658871639e410fff22fa86a8014332207b1993abe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfd2019c0b1f555a1e05890658871639e410fff22fa86a8014332207b1993abe","first_computed_at":"2026-05-17T23:47:53.306468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:53.306468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8mEdjv68TWHN6cGBUNBx0d7m7Jt5oSwc95lwC59y1Ez1MH261E2XjVnrSLJbQBzWCScWdtJkn8zFTTJSHJg8Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:53.306935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec5a536b23763f347411e3690b0cd457cbf274e1f8c6d045dd9bb04696ab4f3b","sha256:97358265d3c53c641447adba5123c4ebde7b2089e6e325fd919f89804e4b9469"],"state_sha256":"3938f3357e4196148795dedb07ffea68bf8bd167e430b54d6bd94cefec6242ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zHqDZ8H0TxqkEvcjp25Ba6icP92QWeyi8rawTDyuZgA4KxhUGHKRBA8hVP59qiW1ewsL4jB3Tvbm/kAbYHynBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T19:29:47.363798Z","bundle_sha256":"c9f6f49a39fbbd8b23c48aff53cb5481e3466ac9df58af93a9490c82005dbc9b"}}