{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EE2H73CAIILCMPLHFD3JNO5N7V","short_pith_number":"pith:EE2H73CA","schema_version":"1.0","canonical_sha256":"21347fec404216263d6728f696bbadfd62312d8f3fc9f3cc6499ec9c2d18c6b5","source":{"kind":"arxiv","id":"1709.03477","version":1},"attestation_state":"computed","paper":{"title":"Cutoff for biased transpositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Igor Pak, Megan Bernstein, Nayantara Bhatnagar","submitted_at":"2017-09-11T17:02:11Z","abstract_excerpt":"In this paper we study the mixing time of a biased transpositions shuffle on a set of $N$ cards with $N/2$ cards of two types. For a parameter $0<a \\le 1$, one type of card is chosen to transpose with a bias of $\\frac{a}{N}$ and the other type is chosen with probability $\\frac{2-a}{N}$. We show that there is cutoff for the mixing time of the chain at time $\\frac{1}{2a} N \\log N$. Our proof uses a modified marking scheme motivated by Matthews' proof of a strong uniform time for the unbiased shuffle."},"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":"1709.03477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-09-11T17:02:11Z","cross_cats_sorted":[],"title_canon_sha256":"47f154665a89830f1a4351ec8ef2c4165e80cebe6d27557a4df6c1d88e801384","abstract_canon_sha256":"d668425fb0723194500c31f7efab127ba89f1eb6f24e8409aaa0982a66cb0730"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:36.621970Z","signature_b64":"ZPb5nh97oYTAMMZQ30Jri3uCPr60aeoY2Ke1leTDLarn3G46bkudCPEhRTfk0FhUdRaSegod3XsMYZcg83nHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21347fec404216263d6728f696bbadfd62312d8f3fc9f3cc6499ec9c2d18c6b5","last_reissued_at":"2026-05-18T00:35:36.621400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:36.621400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutoff for biased transpositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Igor Pak, Megan Bernstein, Nayantara Bhatnagar","submitted_at":"2017-09-11T17:02:11Z","abstract_excerpt":"In this paper we study the mixing time of a biased transpositions shuffle on a set of $N$ cards with $N/2$ cards of two types. For a parameter $0<a \\le 1$, one type of card is chosen to transpose with a bias of $\\frac{a}{N}$ and the other type is chosen with probability $\\frac{2-a}{N}$. We show that there is cutoff for the mixing time of the chain at time $\\frac{1}{2a} N \\log N$. Our proof uses a modified marking scheme motivated by Matthews' proof of a strong uniform time for the unbiased shuffle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03477","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":""},"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":"1709.03477","created_at":"2026-05-18T00:35:36.621498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03477v1","created_at":"2026-05-18T00:35:36.621498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03477","created_at":"2026-05-18T00:35:36.621498+00:00"},{"alias_kind":"pith_short_12","alias_value":"EE2H73CAIILC","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EE2H73CAIILCMPLH","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EE2H73CA","created_at":"2026-05-18T12:31:12.930513+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/EE2H73CAIILCMPLHFD3JNO5N7V","json":"https://pith.science/pith/EE2H73CAIILCMPLHFD3JNO5N7V.json","graph_json":"https://pith.science/api/pith-number/EE2H73CAIILCMPLHFD3JNO5N7V/graph.json","events_json":"https://pith.science/api/pith-number/EE2H73CAIILCMPLHFD3JNO5N7V/events.json","paper":"https://pith.science/paper/EE2H73CA"},"agent_actions":{"view_html":"https://pith.science/pith/EE2H73CAIILCMPLHFD3JNO5N7V","download_json":"https://pith.science/pith/EE2H73CAIILCMPLHFD3JNO5N7V.json","view_paper":"https://pith.science/paper/EE2H73CA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03477&json=true","fetch_graph":"https://pith.science/api/pith-number/EE2H73CAIILCMPLHFD3JNO5N7V/graph.json","fetch_events":"https://pith.science/api/pith-number/EE2H73CAIILCMPLHFD3JNO5N7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EE2H73CAIILCMPLHFD3JNO5N7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EE2H73CAIILCMPLHFD3JNO5N7V/action/storage_attestation","attest_author":"https://pith.science/pith/EE2H73CAIILCMPLHFD3JNO5N7V/action/author_attestation","sign_citation":"https://pith.science/pith/EE2H73CAIILCMPLHFD3JNO5N7V/action/citation_signature","submit_replication":"https://pith.science/pith/EE2H73CAIILCMPLHFD3JNO5N7V/action/replication_record"}},"created_at":"2026-05-18T00:35:36.621498+00:00","updated_at":"2026-05-18T00:35:36.621498+00:00"}