{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MWBLL7BZFXBVEZ4BOIJMTXRCCT","short_pith_number":"pith:MWBLL7BZ","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"},"canonical_sha256":"6582b5fc392dc35267817212c9de2214c92a6c2296c5b602257d12c3ac9afc86","source":{"kind":"arxiv","id":"1804.05500","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05500","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05500v2","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05500","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"MWBLL7BZFXBV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MWBLL7BZFXBVEZ4B","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MWBLL7BZ","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MWBLL7BZFXBVEZ4BOIJMTXRCCT","target":"record","payload":{"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"},"canonical_sha256":"6582b5fc392dc35267817212c9de2214c92a6c2296c5b602257d12c3ac9afc86","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"},"source_kind":"arxiv","source_id":"1804.05500","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:55:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cK1f03XzGuwvsEBT44J99U6ULrSZ3OGgD6IU/Tn0RANME+xY7mgQm6KL4b9U0h8xvBWRqqTNWPvazgJ8gHUBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:23:39.339724Z"},"content_sha256":"2c2f19d08a372fbb7e93a541c5632b665e11e8276d306ebf11498fc099fb52c2","schema_version":"1.0","event_id":"sha256:2c2f19d08a372fbb7e93a541c5632b665e11e8276d306ebf11498fc099fb52c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MWBLL7BZFXBVEZ4BOIJMTXRCCT","target":"graph","payload":{"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"},"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:55:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wuCAsE32UIZn8SEq8kYcR+cWW/9Yb8q5Q6qOoWifuLCLA0EJ4Z/ZhlIo8fJ6S/cY9vHJwhaTQbyJHYzJQbqtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:23:39.340078Z"},"content_sha256":"f53dc11a7f48213e7ff3bc3b7e48a5b2709b957ff44607006ad3bd7f1f64e75a","schema_version":"1.0","event_id":"sha256:f53dc11a7f48213e7ff3bc3b7e48a5b2709b957ff44607006ad3bd7f1f64e75a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/bundle.json","state_url":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/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-01T23:23:39Z","links":{"resolver":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT","bundle":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/bundle.json","state":"https://pith.science/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWBLL7BZFXBVEZ4BOIJMTXRCCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MWBLL7BZFXBVEZ4BOIJMTXRCCT","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":"8f0bc70779b3fbc465fa02f098c18d9ef5ec002a05879fca8d6e1cace813c581","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-16T04:16:53Z","title_canon_sha256":"e9193d23c31afdd88fbe1843c4c3c25a15acaae0b04b7a85aeeeb2476dad98ab"},"schema_version":"1.0","source":{"id":"1804.05500","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05500","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05500v2","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05500","created_at":"2026-05-17T23:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"MWBLL7BZFXBV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MWBLL7BZFXBVEZ4B","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MWBLL7BZ","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:f53dc11a7f48213e7ff3bc3b7e48a5b2709b957ff44607006ad3bd7f1f64e75a","target":"graph","created_at":"2026-05-17T23:55:30Z","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":"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.","authors_text":"Fan Chung, Josh Tobin, Michael Tait, Sinan G. Aksoy","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-16T04:16:53Z","title":"The maximum relaxation time of a random walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05500","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:2c2f19d08a372fbb7e93a541c5632b665e11e8276d306ebf11498fc099fb52c2","target":"record","created_at":"2026-05-17T23:55:30Z","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":"8f0bc70779b3fbc465fa02f098c18d9ef5ec002a05879fca8d6e1cace813c581","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-16T04:16:53Z","title_canon_sha256":"e9193d23c31afdd88fbe1843c4c3c25a15acaae0b04b7a85aeeeb2476dad98ab"},"schema_version":"1.0","source":{"id":"1804.05500","kind":"arxiv","version":2}},"canonical_sha256":"6582b5fc392dc35267817212c9de2214c92a6c2296c5b602257d12c3ac9afc86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6582b5fc392dc35267817212c9de2214c92a6c2296c5b602257d12c3ac9afc86","first_computed_at":"2026-05-17T23:55:30.853644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:30.853644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CkoeE063z/pO+17LFL5XeStyfQddhKcAtaDgkV0f3SNRWA/gfNWGFWJW8BCPqHbjOXfH22G+7et0lb8pH73bAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:30.854083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05500","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c2f19d08a372fbb7e93a541c5632b665e11e8276d306ebf11498fc099fb52c2","sha256:f53dc11a7f48213e7ff3bc3b7e48a5b2709b957ff44607006ad3bd7f1f64e75a"],"state_sha256":"d602d19bef12cffcc8b8af5cbc18fc1dfdaa81432b44bb65fa5b68588ab5c46a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m2RjBveAnA+n1Ja7kARpONGBU4n2NYWOHQCT22psYj7QzkuF/WeOWwaTP1yeWdeiW7INAt/mbyrMR23kCg1SBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:23:39.342014Z","bundle_sha256":"df66e2a74eef45f937767b9fddfdb7e5e3339047d67d4d4419187cf868a13a93"}}