{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3ZFX7P3QLALUB6XKDSCOOYCRIQ","short_pith_number":"pith:3ZFX7P3Q","schema_version":"1.0","canonical_sha256":"de4b7fbf70581740faea1c84e760514426eb35713f667a17ffa3b3c2ecee4363","source":{"kind":"arxiv","id":"1610.01765","version":2},"attestation_state":"computed","paper":{"title":"The spectral gap of dense random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Konstantin Tikhomirov, Pierre Youssef","submitted_at":"2016-10-06T07:54:39Z","abstract_excerpt":"For any $\\alpha\\in (0,1)$ and any $n^{\\alpha}\\leq d\\leq n/2$, we show that $\\lambda(G)\\leq C_\\alpha \\sqrt{d}$ with probability at least $1-\\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\\lambda(G)$ denotes its second largest eigenvalue (in absolute value) and $C_\\alpha$ is a constant depending only on $\\alpha$. Combined with earlier results in this direction covering the case of sparse random graphs, this completely settles the problem of estimating the magnitude of $\\lambda(G)$, up to a multiplicative constant, for all values of $n$ and $d$, confirming a con"},"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":"1610.01765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-06T07:54:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"adb2a8a591e0f338ea3bd86df993464b9992b38ee3e0b4139233cb785370e8ec","abstract_canon_sha256":"42d5c320c5fb6ae63106c8d8402864285865a8fbb69f98c3ba184c43946c5555"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:00.918640Z","signature_b64":"p3L2iUlI3fAVes84jVfCDmxzxmJbxoycyvnbAWK76LwguCBvX4VoeR2GBxLDOPvutDnU2acjfzTSghjHk7D2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de4b7fbf70581740faea1c84e760514426eb35713f667a17ffa3b3c2ecee4363","last_reissued_at":"2026-05-17T23:57:00.917948Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:00.917948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The spectral gap of dense random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Konstantin Tikhomirov, Pierre Youssef","submitted_at":"2016-10-06T07:54:39Z","abstract_excerpt":"For any $\\alpha\\in (0,1)$ and any $n^{\\alpha}\\leq d\\leq n/2$, we show that $\\lambda(G)\\leq C_\\alpha \\sqrt{d}$ with probability at least $1-\\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\\lambda(G)$ denotes its second largest eigenvalue (in absolute value) and $C_\\alpha$ is a constant depending only on $\\alpha$. Combined with earlier results in this direction covering the case of sparse random graphs, this completely settles the problem of estimating the magnitude of $\\lambda(G)$, up to a multiplicative constant, for all values of $n$ and $d$, confirming a con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01765","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":"1610.01765","created_at":"2026-05-17T23:57:00.918054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01765v2","created_at":"2026-05-17T23:57:00.918054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01765","created_at":"2026-05-17T23:57:00.918054+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZFX7P3QLALU","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZFX7P3QLALUB6XK","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZFX7P3Q","created_at":"2026-05-18T12:29:58.707656+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/3ZFX7P3QLALUB6XKDSCOOYCRIQ","json":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ.json","graph_json":"https://pith.science/api/pith-number/3ZFX7P3QLALUB6XKDSCOOYCRIQ/graph.json","events_json":"https://pith.science/api/pith-number/3ZFX7P3QLALUB6XKDSCOOYCRIQ/events.json","paper":"https://pith.science/paper/3ZFX7P3Q"},"agent_actions":{"view_html":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ","download_json":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ.json","view_paper":"https://pith.science/paper/3ZFX7P3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01765&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZFX7P3QLALUB6XKDSCOOYCRIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZFX7P3QLALUB6XKDSCOOYCRIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/action/storage_attestation","attest_author":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/action/author_attestation","sign_citation":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/action/citation_signature","submit_replication":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/action/replication_record"}},"created_at":"2026-05-17T23:57:00.918054+00:00","updated_at":"2026-05-17T23:57:00.918054+00:00"}