{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Z7JADHALD5KVUHQFREDFRBYWHH","short_pith_number":"pith:Z7JADHAL","schema_version":"1.0","canonical_sha256":"cfd2019c0b1f555a1e05890658871639e410fff22fa86a8014332207b1993abe","source":{"kind":"arxiv","id":"1904.10592","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.10592","created_at":"2026-05-17T23:47:53.306546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10592v1","created_at":"2026-05-17T23:47:53.306546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10592","created_at":"2026-05-17T23:47:53.306546+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7JADHALD5KV","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7JADHALD5KVUHQF","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7JADHAL","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11255","citing_title":"Quantitative invertibility of random matrices: a combinatorial perspective","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH","json":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH.json","graph_json":"https://pith.science/api/pith-number/Z7JADHALD5KVUHQFREDFRBYWHH/graph.json","events_json":"https://pith.science/api/pith-number/Z7JADHALD5KVUHQFREDFRBYWHH/events.json","paper":"https://pith.science/paper/Z7JADHAL"},"agent_actions":{"view_html":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH","download_json":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH.json","view_paper":"https://pith.science/paper/Z7JADHAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10592&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7JADHALD5KVUHQFREDFRBYWHH/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7JADHALD5KVUHQFREDFRBYWHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH/action/storage_attestation","attest_author":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH/action/author_attestation","sign_citation":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH/action/citation_signature","submit_replication":"https://pith.science/pith/Z7JADHALD5KVUHQFREDFRBYWHH/action/replication_record"}},"created_at":"2026-05-17T23:47:53.306546+00:00","updated_at":"2026-05-17T23:47:53.306546+00:00"}