{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SFBQHTKGDBONKIDOG6S4DV7A23","short_pith_number":"pith:SFBQHTKG","schema_version":"1.0","canonical_sha256":"914303cd46185cd5206e37a5c1d7e0d6dcfb8309a0b1d90583892309744a7e86","source":{"kind":"arxiv","id":"1809.04718","version":2},"attestation_state":"computed","paper":{"title":"Singularity of random symmetric matrices -- a combinatorial approach to improved bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Asaf Ferber, Vishesh Jain","submitted_at":"2018-09-13T00:24:51Z","abstract_excerpt":"Let $M_n$ denote a random symmetric $n \\times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely conjectured that $M_n$ is singular with probability at most $(2+o(1))^{-n}$. On the other hand, the best known upper bound on the singularity probability of $M_n$, due to Vershynin (2011), is $2^{-n^c}$, for some unspecified small constant $c > 0$. This improves on a polynomial singularity bound due to Costello, Tao, and Vu (2005), and a bound of Nguyen (2011) showin"},"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":"1809.04718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-09-13T00:24:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"712cf13ad17426ad64128057708534a13024ab82d0d32fd2ff316a6f44a591d2","abstract_canon_sha256":"c455cb0916fb46bf30d4808467b86bf60de225eb1320412d797132c9d2f89800"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:54.383514Z","signature_b64":"L7CA8aOGPs3/yYUTIu9k/onKproVhbTpXHW5+ZHgNranpAOz0K4YrbX7LUtYt97qTF757mxT3EAQ3rK8DKFBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"914303cd46185cd5206e37a5c1d7e0d6dcfb8309a0b1d90583892309744a7e86","last_reissued_at":"2026-07-05T00:02:54.382953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:54.382953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Singularity of random symmetric matrices -- a combinatorial approach to improved bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Asaf Ferber, Vishesh Jain","submitted_at":"2018-09-13T00:24:51Z","abstract_excerpt":"Let $M_n$ denote a random symmetric $n \\times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely conjectured that $M_n$ is singular with probability at most $(2+o(1))^{-n}$. On the other hand, the best known upper bound on the singularity probability of $M_n$, due to Vershynin (2011), is $2^{-n^c}$, for some unspecified small constant $c > 0$. This improves on a polynomial singularity bound due to Costello, Tao, and Vu (2005), and a bound of Nguyen (2011) showin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04718","kind":"arxiv","version":2},"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/1809.04718/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":"1809.04718","created_at":"2026-07-05T00:02:54.383007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04718v2","created_at":"2026-07-05T00:02:54.383007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04718","created_at":"2026-07-05T00:02:54.383007+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFBQHTKGDBON","created_at":"2026-07-05T00:02:54.383007+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFBQHTKGDBONKIDO","created_at":"2026-07-05T00:02:54.383007+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFBQHTKG","created_at":"2026-07-05T00:02:54.383007+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":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SFBQHTKGDBONKIDOG6S4DV7A23","json":"https://pith.science/pith/SFBQHTKGDBONKIDOG6S4DV7A23.json","graph_json":"https://pith.science/api/pith-number/SFBQHTKGDBONKIDOG6S4DV7A23/graph.json","events_json":"https://pith.science/api/pith-number/SFBQHTKGDBONKIDOG6S4DV7A23/events.json","paper":"https://pith.science/paper/SFBQHTKG"},"agent_actions":{"view_html":"https://pith.science/pith/SFBQHTKGDBONKIDOG6S4DV7A23","download_json":"https://pith.science/pith/SFBQHTKGDBONKIDOG6S4DV7A23.json","view_paper":"https://pith.science/paper/SFBQHTKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04718&json=true","fetch_graph":"https://pith.science/api/pith-number/SFBQHTKGDBONKIDOG6S4DV7A23/graph.json","fetch_events":"https://pith.science/api/pith-number/SFBQHTKGDBONKIDOG6S4DV7A23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFBQHTKGDBONKIDOG6S4DV7A23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFBQHTKGDBONKIDOG6S4DV7A23/action/storage_attestation","attest_author":"https://pith.science/pith/SFBQHTKGDBONKIDOG6S4DV7A23/action/author_attestation","sign_citation":"https://pith.science/pith/SFBQHTKGDBONKIDOG6S4DV7A23/action/citation_signature","submit_replication":"https://pith.science/pith/SFBQHTKGDBONKIDOG6S4DV7A23/action/replication_record"}},"created_at":"2026-07-05T00:02:54.383007+00:00","updated_at":"2026-07-05T00:02:54.383007+00:00"}