{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SFBQHTKGDBONKIDOG6S4DV7A23","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":"c455cb0916fb46bf30d4808467b86bf60de225eb1320412d797132c9d2f89800","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-09-13T00:24:51Z","title_canon_sha256":"712cf13ad17426ad64128057708534a13024ab82d0d32fd2ff316a6f44a591d2"},"schema_version":"1.0","source":{"id":"1809.04718","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04718","created_at":"2026-07-05T00:02:54Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04718v2","created_at":"2026-07-05T00:02:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04718","created_at":"2026-07-05T00:02:54Z"},{"alias_kind":"pith_short_12","alias_value":"SFBQHTKGDBON","created_at":"2026-07-05T00:02:54Z"},{"alias_kind":"pith_short_16","alias_value":"SFBQHTKGDBONKIDO","created_at":"2026-07-05T00:02:54Z"},{"alias_kind":"pith_short_8","alias_value":"SFBQHTKG","created_at":"2026-07-05T00:02:54Z"}],"graph_snapshots":[{"event_id":"sha256:54a7f2c312c921ef78bebc0122054bafdfb853da3d5bc34df62c738fbf9e75d3","target":"graph","created_at":"2026-07-05T00:02:54Z","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/1809.04718/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Asaf Ferber, Vishesh Jain","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-09-13T00:24:51Z","title":"Singularity of random symmetric matrices -- a combinatorial approach to improved bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04718","kind":"arxiv","version":2},"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:e89bff8fe3da67ad7e1ae3d00cca76ff1446b7fd46bf7a5c39523e9fc7739f2c","target":"record","created_at":"2026-07-05T00:02:54Z","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":"c455cb0916fb46bf30d4808467b86bf60de225eb1320412d797132c9d2f89800","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-09-13T00:24:51Z","title_canon_sha256":"712cf13ad17426ad64128057708534a13024ab82d0d32fd2ff316a6f44a591d2"},"schema_version":"1.0","source":{"id":"1809.04718","kind":"arxiv","version":2}},"canonical_sha256":"914303cd46185cd5206e37a5c1d7e0d6dcfb8309a0b1d90583892309744a7e86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"914303cd46185cd5206e37a5c1d7e0d6dcfb8309a0b1d90583892309744a7e86","first_computed_at":"2026-07-05T00:02:54.382953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:54.382953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L7CA8aOGPs3/yYUTIu9k/onKproVhbTpXHW5+ZHgNranpAOz0K4YrbX7LUtYt97qTF757mxT3EAQ3rK8DKFBDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:54.383514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04718","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e89bff8fe3da67ad7e1ae3d00cca76ff1446b7fd46bf7a5c39523e9fc7739f2c","sha256:54a7f2c312c921ef78bebc0122054bafdfb853da3d5bc34df62c738fbf9e75d3"],"state_sha256":"9614ce2d0c795cd9941b40c49c743cb94892014aad938567c50d1f3974444704"}