{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YNZNODS3YXLTHZJ35FSNRONAUA","short_pith_number":"pith:YNZNODS3","schema_version":"1.0","canonical_sha256":"c372d70e5bc5d733e53be964d8b9a0a00e6f8dc900462d4d3eaf7a13f5f3ee49","source":{"kind":"arxiv","id":"1001.1894","version":3},"attestation_state":"computed","paper":{"title":"Mixing times for random k-cycles and coalescence-fragmentation chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Nathana\\\"el Berestycki, Oded Schramm, Ofer Zeitouni","submitted_at":"2010-01-12T14:58:12Z","abstract_excerpt":"Let $\\mathcal{S}_n$ be the permutation group on $n$ elements, and consider a random walk on $\\mathcal{S}_n$ whose step distribution is uniform on $k$-cycles. We prove a well-known conjecture that the mixing time of this process is $(1/k)n\\log n$, with threshold of width linear in $n$. Our proofs are elementary and purely probabilistic, and do not appeal to the representation theory of $\\mathcal{S}_n$."},"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":"1001.1894","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-01-12T14:58:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fbc69146c572511a01430159ebc407bb6d2f8a1b28c5dbc44ea16ad2b17121b2","abstract_canon_sha256":"93354f471a817c0dfc7272328263f4d3b96174eb5f36e408c0efd60bdc119495"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:24.160620Z","signature_b64":"u2iFSoXeeKQF2s4EgTLD8LWuODDbgMJi6SA9k9yqVX5sWsA13dNVksHA1g+QfHA7ZJ34XvLLEHHq13bLt6a+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c372d70e5bc5d733e53be964d8b9a0a00e6f8dc900462d4d3eaf7a13f5f3ee49","last_reissued_at":"2026-05-18T01:09:24.159948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:24.159948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing times for random k-cycles and coalescence-fragmentation chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Nathana\\\"el Berestycki, Oded Schramm, Ofer Zeitouni","submitted_at":"2010-01-12T14:58:12Z","abstract_excerpt":"Let $\\mathcal{S}_n$ be the permutation group on $n$ elements, and consider a random walk on $\\mathcal{S}_n$ whose step distribution is uniform on $k$-cycles. We prove a well-known conjecture that the mixing time of this process is $(1/k)n\\log n$, with threshold of width linear in $n$. Our proofs are elementary and purely probabilistic, and do not appeal to the representation theory of $\\mathcal{S}_n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1894","kind":"arxiv","version":3},"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":"1001.1894","created_at":"2026-05-18T01:09:24.160045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.1894v3","created_at":"2026-05-18T01:09:24.160045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1894","created_at":"2026-05-18T01:09:24.160045+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNZNODS3YXLT","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNZNODS3YXLTHZJ3","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNZNODS3","created_at":"2026-05-18T12:26:17.028572+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/YNZNODS3YXLTHZJ35FSNRONAUA","json":"https://pith.science/pith/YNZNODS3YXLTHZJ35FSNRONAUA.json","graph_json":"https://pith.science/api/pith-number/YNZNODS3YXLTHZJ35FSNRONAUA/graph.json","events_json":"https://pith.science/api/pith-number/YNZNODS3YXLTHZJ35FSNRONAUA/events.json","paper":"https://pith.science/paper/YNZNODS3"},"agent_actions":{"view_html":"https://pith.science/pith/YNZNODS3YXLTHZJ35FSNRONAUA","download_json":"https://pith.science/pith/YNZNODS3YXLTHZJ35FSNRONAUA.json","view_paper":"https://pith.science/paper/YNZNODS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.1894&json=true","fetch_graph":"https://pith.science/api/pith-number/YNZNODS3YXLTHZJ35FSNRONAUA/graph.json","fetch_events":"https://pith.science/api/pith-number/YNZNODS3YXLTHZJ35FSNRONAUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNZNODS3YXLTHZJ35FSNRONAUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNZNODS3YXLTHZJ35FSNRONAUA/action/storage_attestation","attest_author":"https://pith.science/pith/YNZNODS3YXLTHZJ35FSNRONAUA/action/author_attestation","sign_citation":"https://pith.science/pith/YNZNODS3YXLTHZJ35FSNRONAUA/action/citation_signature","submit_replication":"https://pith.science/pith/YNZNODS3YXLTHZJ35FSNRONAUA/action/replication_record"}},"created_at":"2026-05-18T01:09:24.160045+00:00","updated_at":"2026-05-18T01:09:24.160045+00:00"}