{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MWBLL7BZFXBVEZ4BOIJMTXRCCT","short_pith_number":"pith:MWBLL7BZ","schema_version":"1.0","canonical_sha256":"6582b5fc392dc35267817212c9de2214c92a6c2296c5b602257d12c3ac9afc86","source":{"kind":"arxiv","id":"1804.05500","version":2},"attestation_state":"computed","paper":{"title":"The maximum relaxation time of a random walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Fan Chung, Josh Tobin, Michael Tait, Sinan G. Aksoy","submitted_at":"2018-04-16T04:16:53Z","abstract_excerpt":"We show the minimum spectral gap of the normalized Laplacian over all simple, connected graphs on $n$ vertices is $(1+o(1))\\tfrac{54}{n^3}$. This minimum is achieved asymptotically by a double kite graph. Consequently, this leads to sharp upper bounds for the maximum relaxation time of a random walk, settling a conjecture of Aldous and Fill. We also improve an eigenvalue-diameter inequality by giving a new lower bound for the spectral gap of the normalized Laplacian. This eigenvalue lower bound is asymptotically best possible."},"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":"1804.05500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-16T04:16:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e9193d23c31afdd88fbe1843c4c3c25a15acaae0b04b7a85aeeeb2476dad98ab","abstract_canon_sha256":"8f0bc70779b3fbc465fa02f098c18d9ef5ec002a05879fca8d6e1cace813c581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:30.854083Z","signature_b64":"CkoeE063z/pO+17LFL5XeStyfQddhKcAtaDgkV0f3SNRWA/gfNWGFWJW8BCPqHbjOXfH22G+7et0lb8pH73bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6582b5fc392dc35267817212c9de2214c92a6c2296c5b602257d12c3ac9afc86","last_reissued_at":"2026-05-17T23:55:30.853644Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:30.853644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum relaxation time of a random walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Fan Chung, Josh Tobin, Michael Tait, Sinan G. Aksoy","submitted_at":"2018-04-16T04:16:53Z","abstract_excerpt":"We show the minimum spectral gap of the normalized Laplacian over all simple, connected graphs on $n$ vertices is $(1+o(1))\\tfrac{54}{n^3}$. This minimum is achieved asymptotically by a double kite graph. Consequently, this leads to sharp upper bounds for the maximum relaxation time of a random walk, settling a conjecture of Aldous and Fill. We also improve an eigenvalue-diameter inequality by giving a new lower bound for the spectral gap of the normalized Laplacian. This eigenvalue lower bound is asymptotically best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05500","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":"1804.05500","created_at":"2026-05-17T23:55:30.853737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05500v2","created_at":"2026-05-17T23:55:30.853737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05500","created_at":"2026-05-17T23:55:30.853737+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWBLL7BZFXBV","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWBLL7BZFXBVEZ4B","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWBLL7BZ","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/MWBLL7BZFXBVEZ4BOIJMTXRCCT","json":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT.json","graph_json":"https://pith.science/api/pith-number/MWBLL7BZFXBVEZ4BOIJMTXRCCT/graph.json","events_json":"https://pith.science/api/pith-number/MWBLL7BZFXBVEZ4BOIJMTXRCCT/events.json","paper":"https://pith.science/paper/MWBLL7BZ"},"agent_actions":{"view_html":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT","download_json":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT.json","view_paper":"https://pith.science/paper/MWBLL7BZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05500&json=true","fetch_graph":"https://pith.science/api/pith-number/MWBLL7BZFXBVEZ4BOIJMTXRCCT/graph.json","fetch_events":"https://pith.science/api/pith-number/MWBLL7BZFXBVEZ4BOIJMTXRCCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/action/storage_attestation","attest_author":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/action/author_attestation","sign_citation":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/action/citation_signature","submit_replication":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/action/replication_record"}},"created_at":"2026-05-17T23:55:30.853737+00:00","updated_at":"2026-05-17T23:55:30.853737+00:00"}