{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3ZFX7P3QLALUB6XKDSCOOYCRIQ","short_pith_number":"pith:3ZFX7P3Q","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"},"canonical_sha256":"de4b7fbf70581740faea1c84e760514426eb35713f667a17ffa3b3c2ecee4363","source":{"kind":"arxiv","id":"1610.01765","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01765","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01765v2","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01765","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"3ZFX7P3QLALU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZFX7P3QLALUB6XK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZFX7P3Q","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3ZFX7P3QLALUB6XKDSCOOYCRIQ","target":"record","payload":{"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"},"canonical_sha256":"de4b7fbf70581740faea1c84e760514426eb35713f667a17ffa3b3c2ecee4363","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"},"source_kind":"arxiv","source_id":"1610.01765","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uufz3zeRQD0Kfcnvb99WrLUtsDpA4JrPzdGJmLhDJ/dx3ffTsZzHqtmizD46GE32cSe/iBCXGEzgcOQfggt7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:52:31.916995Z"},"content_sha256":"ca6308a9d48a4c96e7425adec551adba9aefb59064f54b50cce3c9dd902ed0bb","schema_version":"1.0","event_id":"sha256:ca6308a9d48a4c96e7425adec551adba9aefb59064f54b50cce3c9dd902ed0bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3ZFX7P3QLALUB6XKDSCOOYCRIQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H4pfSTN5W92iXQ06VOYMNaYsFFEhZbOBgouht0/B7R00O6Ahbr28ft9J25FLAE4CYG1983ywZdWnk2m17HVrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:52:31.917359Z"},"content_sha256":"f2969e2beae4a3a5422ae5bf6bdfd5d68571da2db75a34ba7325a436767e98af","schema_version":"1.0","event_id":"sha256:f2969e2beae4a3a5422ae5bf6bdfd5d68571da2db75a34ba7325a436767e98af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/bundle.json","state_url":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T22:52:31Z","links":{"resolver":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ","bundle":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/bundle.json","state":"https://pith.science/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZFX7P3QLALUB6XKDSCOOYCRIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3ZFX7P3QLALUB6XKDSCOOYCRIQ","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":"42d5c320c5fb6ae63106c8d8402864285865a8fbb69f98c3ba184c43946c5555","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-06T07:54:39Z","title_canon_sha256":"adb2a8a591e0f338ea3bd86df993464b9992b38ee3e0b4139233cb785370e8ec"},"schema_version":"1.0","source":{"id":"1610.01765","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01765","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01765v2","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01765","created_at":"2026-05-17T23:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"3ZFX7P3QLALU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZFX7P3QLALUB6XK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZFX7P3Q","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:f2969e2beae4a3a5422ae5bf6bdfd5d68571da2db75a34ba7325a436767e98af","target":"graph","created_at":"2026-05-17T23:57:00Z","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"},"paper":{"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","authors_text":"Konstantin Tikhomirov, Pierre Youssef","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-06T07:54:39Z","title":"The spectral gap of dense random regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01765","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:ca6308a9d48a4c96e7425adec551adba9aefb59064f54b50cce3c9dd902ed0bb","target":"record","created_at":"2026-05-17T23:57:00Z","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":"42d5c320c5fb6ae63106c8d8402864285865a8fbb69f98c3ba184c43946c5555","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-06T07:54:39Z","title_canon_sha256":"adb2a8a591e0f338ea3bd86df993464b9992b38ee3e0b4139233cb785370e8ec"},"schema_version":"1.0","source":{"id":"1610.01765","kind":"arxiv","version":2}},"canonical_sha256":"de4b7fbf70581740faea1c84e760514426eb35713f667a17ffa3b3c2ecee4363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de4b7fbf70581740faea1c84e760514426eb35713f667a17ffa3b3c2ecee4363","first_computed_at":"2026-05-17T23:57:00.917948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:00.917948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p3L2iUlI3fAVes84jVfCDmxzxmJbxoycyvnbAWK76LwguCBvX4VoeR2GBxLDOPvutDnU2acjfzTSghjHk7D2Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:00.918640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01765","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca6308a9d48a4c96e7425adec551adba9aefb59064f54b50cce3c9dd902ed0bb","sha256:f2969e2beae4a3a5422ae5bf6bdfd5d68571da2db75a34ba7325a436767e98af"],"state_sha256":"95063da3046cc0d67b00b71c0109df50a445bdd226bf89d6894acad73df51fd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hkKjCsQ11Ijc3WX3Sm+F+PMQR/56iRhqJjvhvVjMhmS6sRDYvXNqV3szxcP0kpVmz4QO3TT5zX3wWRJVA26BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:52:31.919585Z","bundle_sha256":"f13e4fe600d3a5c503f76dc6745fc2b9d8ea7676c4b9712ba1b7ab7d0ba07a9a"}}