{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:X6T7SL7IMUNXVUYECPKJS5QQRW","short_pith_number":"pith:X6T7SL7I","schema_version":"1.0","canonical_sha256":"bfa7f92fe8651b7ad30413d49976108db741f879bc534f149cfec8aded656302","source":{"kind":"arxiv","id":"2105.11718","version":2},"attestation_state":"computed","paper":{"title":"On the Rank, Kernel, and Core of Sparse Random Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alexander Moreira, Margalit Glasgow, Patrick DeMichele","submitted_at":"2021-05-25T07:41:58Z","abstract_excerpt":"We study the rank of the adjacency matrix $A$ of a random Erdos Renyi graph $G\\sim \\mathbb{G}(n,p)$. It is well known that when $p = (\\log(n) - \\omega(1))/n$, with high probability, $A$ is singular. We prove that when $p = \\omega(1/n)$, with high probability, the corank of $A$ is equal to the number of isolated vertices remaining in $G$ after the Karp-Sipser leaf-removal process, which removes vertices of degree one and their unique neighbor. We prove a similar result for the random matrix $B$, where all entries are independent Bernoulli random variables with parameter $p$. Namely, we show tha"},"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":"2105.11718","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-25T07:41:58Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"70c87330a315b6e03dabe65b72dc2a85152b304cdb47d9caafbe36025f921d07","abstract_canon_sha256":"79db32f2b5e5dfb0a58992cc765b5f5c9558ee8e8efa125dce5bf63d3a0a3044"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:35.334685Z","signature_b64":"rS7F0nSMqWKwcl4/nsIbrN73/RHk3efv1glewkgOZ7e2eo29QYFH/y6my+F63rGUS4FxWHi3Wk8g+EvJjut+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfa7f92fe8651b7ad30413d49976108db741f879bc534f149cfec8aded656302","last_reissued_at":"2026-07-05T03:50:35.334120Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:35.334120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Rank, Kernel, and Core of Sparse Random Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alexander Moreira, Margalit Glasgow, Patrick DeMichele","submitted_at":"2021-05-25T07:41:58Z","abstract_excerpt":"We study the rank of the adjacency matrix $A$ of a random Erdos Renyi graph $G\\sim \\mathbb{G}(n,p)$. It is well known that when $p = (\\log(n) - \\omega(1))/n$, with high probability, $A$ is singular. We prove that when $p = \\omega(1/n)$, with high probability, the corank of $A$ is equal to the number of isolated vertices remaining in $G$ after the Karp-Sipser leaf-removal process, which removes vertices of degree one and their unique neighbor. We prove a similar result for the random matrix $B$, where all entries are independent Bernoulli random variables with parameter $p$. Namely, we show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11718","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/2105.11718/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":"2105.11718","created_at":"2026-07-05T03:50:35.334179+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.11718v2","created_at":"2026-07-05T03:50:35.334179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11718","created_at":"2026-07-05T03:50:35.334179+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6T7SL7IMUNX","created_at":"2026-07-05T03:50:35.334179+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6T7SL7IMUNXVUYE","created_at":"2026-07-05T03:50:35.334179+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6T7SL7I","created_at":"2026-07-05T03:50:35.334179+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6T7SL7IMUNXVUYECPKJS5QQRW","json":"https://pith.science/pith/X6T7SL7IMUNXVUYECPKJS5QQRW.json","graph_json":"https://pith.science/api/pith-number/X6T7SL7IMUNXVUYECPKJS5QQRW/graph.json","events_json":"https://pith.science/api/pith-number/X6T7SL7IMUNXVUYECPKJS5QQRW/events.json","paper":"https://pith.science/paper/X6T7SL7I"},"agent_actions":{"view_html":"https://pith.science/pith/X6T7SL7IMUNXVUYECPKJS5QQRW","download_json":"https://pith.science/pith/X6T7SL7IMUNXVUYECPKJS5QQRW.json","view_paper":"https://pith.science/paper/X6T7SL7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.11718&json=true","fetch_graph":"https://pith.science/api/pith-number/X6T7SL7IMUNXVUYECPKJS5QQRW/graph.json","fetch_events":"https://pith.science/api/pith-number/X6T7SL7IMUNXVUYECPKJS5QQRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6T7SL7IMUNXVUYECPKJS5QQRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6T7SL7IMUNXVUYECPKJS5QQRW/action/storage_attestation","attest_author":"https://pith.science/pith/X6T7SL7IMUNXVUYECPKJS5QQRW/action/author_attestation","sign_citation":"https://pith.science/pith/X6T7SL7IMUNXVUYECPKJS5QQRW/action/citation_signature","submit_replication":"https://pith.science/pith/X6T7SL7IMUNXVUYECPKJS5QQRW/action/replication_record"}},"created_at":"2026-07-05T03:50:35.334179+00:00","updated_at":"2026-07-05T03:50:35.334179+00:00"}