{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D4D3DIZ4QCFH2MYEXZUU755P5A","short_pith_number":"pith:D4D3DIZ4","schema_version":"1.0","canonical_sha256":"1f07b1a33c808a7d3304be694ff7afe804c647781059246e18a72ed043eeaf4c","source":{"kind":"arxiv","id":"1604.00870","version":2},"attestation_state":"computed","paper":{"title":"Mixing Time for Some Adjacent Transposition Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peter Winkler, Shahrzad Haddadan","submitted_at":"2016-04-04T14:23:50Z","abstract_excerpt":"We prove rapid mixing for certain Markov chains on the set $S_n$ of permutations on $1,2,\\dots,n$ in which adjacent transpositions are made with probabilities that depend on the items being transposed. Typically, when in state $\\sigma$, a position $i<n$ is chosen uniformly at random, and $\\sigma(i)$ and $\\sigma(i{+}1)$ are swapped with probability depending on $\\sigma(i)$ and $\\sigma(i{+}1)$. The stationary distributions of such chains appear in various fields of theoretical computer science, and rapid mixing established in the uniform case.\n  Recently, there has been progress in cases with bi"},"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":"1604.00870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T14:23:50Z","cross_cats_sorted":[],"title_canon_sha256":"2d91d3de545afbe0991dacc7deafef209f7fc8ac1bfdde930debcb5bb3d13014","abstract_canon_sha256":"80beed652482428b71fd0f54b35c505662002579dd9a896955ec10414a3a20e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:16.718575Z","signature_b64":"dTxCGo5cx+n8xaHE6m1rLpnk2kZVzr/V9Arhua++cEaiTFnF+0na+bh7H7SU9k+vtcQlNXcY8s5A9Oz3U8k3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f07b1a33c808a7d3304be694ff7afe804c647781059246e18a72ed043eeaf4c","last_reissued_at":"2026-05-18T00:26:16.718043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:16.718043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing Time for Some Adjacent Transposition Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peter Winkler, Shahrzad Haddadan","submitted_at":"2016-04-04T14:23:50Z","abstract_excerpt":"We prove rapid mixing for certain Markov chains on the set $S_n$ of permutations on $1,2,\\dots,n$ in which adjacent transpositions are made with probabilities that depend on the items being transposed. Typically, when in state $\\sigma$, a position $i<n$ is chosen uniformly at random, and $\\sigma(i)$ and $\\sigma(i{+}1)$ are swapped with probability depending on $\\sigma(i)$ and $\\sigma(i{+}1)$. The stationary distributions of such chains appear in various fields of theoretical computer science, and rapid mixing established in the uniform case.\n  Recently, there has been progress in cases with bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00870","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":"1604.00870","created_at":"2026-05-18T00:26:16.718145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00870v2","created_at":"2026-05-18T00:26:16.718145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00870","created_at":"2026-05-18T00:26:16.718145+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4D3DIZ4QCFH","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4D3DIZ4QCFH2MYE","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4D3DIZ4","created_at":"2026-05-18T12:30:09.641336+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/D4D3DIZ4QCFH2MYEXZUU755P5A","json":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A.json","graph_json":"https://pith.science/api/pith-number/D4D3DIZ4QCFH2MYEXZUU755P5A/graph.json","events_json":"https://pith.science/api/pith-number/D4D3DIZ4QCFH2MYEXZUU755P5A/events.json","paper":"https://pith.science/paper/D4D3DIZ4"},"agent_actions":{"view_html":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A","download_json":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A.json","view_paper":"https://pith.science/paper/D4D3DIZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00870&json=true","fetch_graph":"https://pith.science/api/pith-number/D4D3DIZ4QCFH2MYEXZUU755P5A/graph.json","fetch_events":"https://pith.science/api/pith-number/D4D3DIZ4QCFH2MYEXZUU755P5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/action/storage_attestation","attest_author":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/action/author_attestation","sign_citation":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/action/citation_signature","submit_replication":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/action/replication_record"}},"created_at":"2026-05-18T00:26:16.718145+00:00","updated_at":"2026-05-18T00:26:16.718145+00:00"}