{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MXZO4CDQ5H26KQOXBI4FAGTK3K","short_pith_number":"pith:MXZO4CDQ","schema_version":"1.0","canonical_sha256":"65f2ee0870e9f5e541d70a38501a6adaac25a2d80de5b1107e32670a74735c19","source":{"kind":"arxiv","id":"1908.02898","version":1},"attestation_state":"computed","paper":{"title":"Cutoff for random lifts of weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Guillaume Conchon--Kerjan","submitted_at":"2019-08-08T01:39:55Z","abstract_excerpt":"We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\\log n$, where $h$ is a constant associated to $\\mathcal{G}$, namely the entropy of its universal cover. Moreover, this mixing time is the smallest possible among all $n$-lifts of $\\mathcal{G}$. In the particular case where the base graph is a vertex with $d/2$ loops, $d$ even, we obtain a cutoff for a $d$-regular random graph (as did Lubetzky and Sly in \\cite{cutoffregular} with a "},"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":"1908.02898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-08-08T01:39:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bc3aabf810c33362802a73fb98be946f028a5b7e53fe121eb214262ba9517603","abstract_canon_sha256":"b1b0472ce2f13e5eb1c5480602def8a6192bbcd3209c5b835b4ceac949999aec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:24.546020Z","signature_b64":"xg3yjOt+cFMPQhiI7c7zfvTZLl6DHso9kNHSMdO3QPwNs1l805qrjDNNiV2/Q3CXiAvxURUh5kaJij0O4sE0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f2ee0870e9f5e541d70a38501a6adaac25a2d80de5b1107e32670a74735c19","last_reissued_at":"2026-07-04T23:52:24.545254Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:24.545254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutoff for random lifts of weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Guillaume Conchon--Kerjan","submitted_at":"2019-08-08T01:39:55Z","abstract_excerpt":"We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\\log n$, where $h$ is a constant associated to $\\mathcal{G}$, namely the entropy of its universal cover. Moreover, this mixing time is the smallest possible among all $n$-lifts of $\\mathcal{G}$. In the particular case where the base graph is a vertex with $d/2$ loops, $d$ even, we obtain a cutoff for a $d$-regular random graph (as did Lubetzky and Sly in \\cite{cutoffregular} with a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02898","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02898/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.02898","created_at":"2026-07-04T23:52:24.545336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02898v1","created_at":"2026-07-04T23:52:24.545336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02898","created_at":"2026-07-04T23:52:24.545336+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXZO4CDQ5H26","created_at":"2026-07-04T23:52:24.545336+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXZO4CDQ5H26KQOX","created_at":"2026-07-04T23:52:24.545336+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXZO4CDQ","created_at":"2026-07-04T23:52:24.545336+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/MXZO4CDQ5H26KQOXBI4FAGTK3K","json":"https://pith.science/pith/MXZO4CDQ5H26KQOXBI4FAGTK3K.json","graph_json":"https://pith.science/api/pith-number/MXZO4CDQ5H26KQOXBI4FAGTK3K/graph.json","events_json":"https://pith.science/api/pith-number/MXZO4CDQ5H26KQOXBI4FAGTK3K/events.json","paper":"https://pith.science/paper/MXZO4CDQ"},"agent_actions":{"view_html":"https://pith.science/pith/MXZO4CDQ5H26KQOXBI4FAGTK3K","download_json":"https://pith.science/pith/MXZO4CDQ5H26KQOXBI4FAGTK3K.json","view_paper":"https://pith.science/paper/MXZO4CDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02898&json=true","fetch_graph":"https://pith.science/api/pith-number/MXZO4CDQ5H26KQOXBI4FAGTK3K/graph.json","fetch_events":"https://pith.science/api/pith-number/MXZO4CDQ5H26KQOXBI4FAGTK3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXZO4CDQ5H26KQOXBI4FAGTK3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXZO4CDQ5H26KQOXBI4FAGTK3K/action/storage_attestation","attest_author":"https://pith.science/pith/MXZO4CDQ5H26KQOXBI4FAGTK3K/action/author_attestation","sign_citation":"https://pith.science/pith/MXZO4CDQ5H26KQOXBI4FAGTK3K/action/citation_signature","submit_replication":"https://pith.science/pith/MXZO4CDQ5H26KQOXBI4FAGTK3K/action/replication_record"}},"created_at":"2026-07-04T23:52:24.545336+00:00","updated_at":"2026-07-04T23:52:24.545336+00:00"}