{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MTDM3XBYUNYSYDQGSQAO6CQKSH","short_pith_number":"pith:MTDM3XBY","schema_version":"1.0","canonical_sha256":"64c6cddc38a3712c0e069400ef0a0a91c6fffca8beb84c7a204e485de17af5b5","source":{"kind":"arxiv","id":"1801.05577","version":2},"attestation_state":"computed","paper":{"title":"The rank of random regular digraphs of constant degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Litvak, Anna Lytova, Konstantin Tikhomirov, Nicole Tomczak-Jaegermann, Pierre Youssef","submitted_at":"2018-01-17T07:42:48Z","abstract_excerpt":"Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with probability going to one as $n$ goes to infinity. The proof combines the method of simple switchings and a recent result of the authors on delocalization of eigenvectors of $A_n$."},"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":"1801.05577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-17T07:42:48Z","cross_cats_sorted":[],"title_canon_sha256":"f6788189f3155b16613e8f3f68945d919b204ec97cbfd0c4f454e1bb1a2095cb","abstract_canon_sha256":"d7df0bc0c25d6c95c1044e58e25703667335ccea7970b3328739a6b868779851"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:22.154976Z","signature_b64":"W7sSger4ZGr/ih/dvbmQXsb+blM97LAxaH1s6Chhas9VMX8XV5fjGfKwDttQhajNskq5BKE86koaqah6GFdlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64c6cddc38a3712c0e069400ef0a0a91c6fffca8beb84c7a204e485de17af5b5","last_reissued_at":"2026-05-18T00:10:22.154179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:22.154179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The rank of random regular digraphs of constant degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Litvak, Anna Lytova, Konstantin Tikhomirov, Nicole Tomczak-Jaegermann, Pierre Youssef","submitted_at":"2018-01-17T07:42:48Z","abstract_excerpt":"Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with probability going to one as $n$ goes to infinity. The proof combines the method of simple switchings and a recent result of the authors on delocalization of eigenvectors of $A_n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05577","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":""},"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":"1801.05577","created_at":"2026-05-18T00:10:22.154327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05577v2","created_at":"2026-05-18T00:10:22.154327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05577","created_at":"2026-05-18T00:10:22.154327+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTDM3XBYUNYS","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTDM3XBYUNYSYDQG","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTDM3XBY","created_at":"2026-05-18T12:32:40.477152+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/MTDM3XBYUNYSYDQGSQAO6CQKSH","json":"https://pith.science/pith/MTDM3XBYUNYSYDQGSQAO6CQKSH.json","graph_json":"https://pith.science/api/pith-number/MTDM3XBYUNYSYDQGSQAO6CQKSH/graph.json","events_json":"https://pith.science/api/pith-number/MTDM3XBYUNYSYDQGSQAO6CQKSH/events.json","paper":"https://pith.science/paper/MTDM3XBY"},"agent_actions":{"view_html":"https://pith.science/pith/MTDM3XBYUNYSYDQGSQAO6CQKSH","download_json":"https://pith.science/pith/MTDM3XBYUNYSYDQGSQAO6CQKSH.json","view_paper":"https://pith.science/paper/MTDM3XBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05577&json=true","fetch_graph":"https://pith.science/api/pith-number/MTDM3XBYUNYSYDQGSQAO6CQKSH/graph.json","fetch_events":"https://pith.science/api/pith-number/MTDM3XBYUNYSYDQGSQAO6CQKSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTDM3XBYUNYSYDQGSQAO6CQKSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTDM3XBYUNYSYDQGSQAO6CQKSH/action/storage_attestation","attest_author":"https://pith.science/pith/MTDM3XBYUNYSYDQGSQAO6CQKSH/action/author_attestation","sign_citation":"https://pith.science/pith/MTDM3XBYUNYSYDQGSQAO6CQKSH/action/citation_signature","submit_replication":"https://pith.science/pith/MTDM3XBYUNYSYDQGSQAO6CQKSH/action/replication_record"}},"created_at":"2026-05-18T00:10:22.154327+00:00","updated_at":"2026-05-18T00:10:22.154327+00:00"}