{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3C4K7TQXBCED7ZSUKZATLP7UYT","short_pith_number":"pith:3C4K7TQX","schema_version":"1.0","canonical_sha256":"d8b8afce1708883fe654564135bff4c4db33abd281b41d27b41a4ae86a644354","source":{"kind":"arxiv","id":"1801.05575","version":4},"attestation_state":"computed","paper":{"title":"Structure of eigenvectors of random regular digraphs","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:22:18Z","abstract_excerpt":"Let $d$ and $n$ be integers satisfying $C\\leq d\\leq \\exp(c\\sqrt{\\ln n})$ for some universal constants $c, C>0$, and let $z\\in \\mathbb{C}$. Denote by $M$ the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. In this paper, we study the structure of the kernel of submatrices of $M-z\\,{\\rm Id}$, formed by removing a subset of rows. We show that with large probability the kernel consists of two non-intersecting types of vectors, which we call very steep and gradual with many levels. As a corollary, we show, in particular, that every eigenvector of $M$, except for constant mu"},"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.05575","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-17T07:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"ebe398f6bbe5c420be72b50a736adaf13c66b27ac286dfe2ee7e4cc2d0c9a013","abstract_canon_sha256":"bfa9209aa7ad59f8d249c7ac91db986471982f1b3703e0120ddfbe23df8c8983"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:19.460896Z","signature_b64":"wwyE9mWIQEUOPtUc2TxGt/tBc/E25aqlBmUvT+F5mw3//ViraHfcG7KlHK+mGtl7WJK6FbAqvg+QBHUEPHQjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8b8afce1708883fe654564135bff4c4db33abd281b41d27b41a4ae86a644354","last_reissued_at":"2026-05-18T00:02:19.460396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:19.460396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure of eigenvectors of random regular digraphs","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:22:18Z","abstract_excerpt":"Let $d$ and $n$ be integers satisfying $C\\leq d\\leq \\exp(c\\sqrt{\\ln n})$ for some universal constants $c, C>0$, and let $z\\in \\mathbb{C}$. Denote by $M$ the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. In this paper, we study the structure of the kernel of submatrices of $M-z\\,{\\rm Id}$, formed by removing a subset of rows. We show that with large probability the kernel consists of two non-intersecting types of vectors, which we call very steep and gradual with many levels. As a corollary, we show, in particular, that every eigenvector of $M$, except for constant mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05575","kind":"arxiv","version":4},"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.05575","created_at":"2026-05-18T00:02:19.460478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05575v4","created_at":"2026-05-18T00:02:19.460478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05575","created_at":"2026-05-18T00:02:19.460478+00:00"},{"alias_kind":"pith_short_12","alias_value":"3C4K7TQXBCED","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3C4K7TQXBCED7ZSU","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3C4K7TQX","created_at":"2026-05-18T12:32:02.567920+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/3C4K7TQXBCED7ZSUKZATLP7UYT","json":"https://pith.science/pith/3C4K7TQXBCED7ZSUKZATLP7UYT.json","graph_json":"https://pith.science/api/pith-number/3C4K7TQXBCED7ZSUKZATLP7UYT/graph.json","events_json":"https://pith.science/api/pith-number/3C4K7TQXBCED7ZSUKZATLP7UYT/events.json","paper":"https://pith.science/paper/3C4K7TQX"},"agent_actions":{"view_html":"https://pith.science/pith/3C4K7TQXBCED7ZSUKZATLP7UYT","download_json":"https://pith.science/pith/3C4K7TQXBCED7ZSUKZATLP7UYT.json","view_paper":"https://pith.science/paper/3C4K7TQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05575&json=true","fetch_graph":"https://pith.science/api/pith-number/3C4K7TQXBCED7ZSUKZATLP7UYT/graph.json","fetch_events":"https://pith.science/api/pith-number/3C4K7TQXBCED7ZSUKZATLP7UYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3C4K7TQXBCED7ZSUKZATLP7UYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3C4K7TQXBCED7ZSUKZATLP7UYT/action/storage_attestation","attest_author":"https://pith.science/pith/3C4K7TQXBCED7ZSUKZATLP7UYT/action/author_attestation","sign_citation":"https://pith.science/pith/3C4K7TQXBCED7ZSUKZATLP7UYT/action/citation_signature","submit_replication":"https://pith.science/pith/3C4K7TQXBCED7ZSUKZATLP7UYT/action/replication_record"}},"created_at":"2026-05-18T00:02:19.460478+00:00","updated_at":"2026-05-18T00:02:19.460478+00:00"}