{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D4D3DIZ4QCFH2MYEXZUU755P5A","short_pith_number":"pith:D4D3DIZ4","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"},"canonical_sha256":"1f07b1a33c808a7d3304be694ff7afe804c647781059246e18a72ed043eeaf4c","source":{"kind":"arxiv","id":"1604.00870","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00870","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00870v2","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00870","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"pith_short_12","alias_value":"D4D3DIZ4QCFH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D4D3DIZ4QCFH2MYE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D4D3DIZ4","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D4D3DIZ4QCFH2MYEXZUU755P5A","target":"record","payload":{"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"},"canonical_sha256":"1f07b1a33c808a7d3304be694ff7afe804c647781059246e18a72ed043eeaf4c","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"},"source_kind":"arxiv","source_id":"1604.00870","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-18T00:26:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxY9q2goJVbNBNfkO5QknRcBsK4KZ1w46F2b5E9PYTQlFT6Jk1Ij2UMSrl8qyo16dU00r5IAkr4R4NALx6zXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:11:42.558307Z"},"content_sha256":"39fe5c3490c32180bca28831da143a2613497aff4fbe5e587a75ab03be7cf920","schema_version":"1.0","event_id":"sha256:39fe5c3490c32180bca28831da143a2613497aff4fbe5e587a75ab03be7cf920"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D4D3DIZ4QCFH2MYEXZUU755P5A","target":"graph","payload":{"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"},"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-18T00:26:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMFITxO68ixVvqwl2z4JN9tGYOLzZLN/28HVhVWTnia2NaQsX50e3TMIN1hBrDpbcirRwrGaPGiNe4gaabbdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:11:42.558874Z"},"content_sha256":"5b9ea6c21cae66fdd4d29dfea4fbd38bc1aeeab83616d494560a96d17da1284a","schema_version":"1.0","event_id":"sha256:5b9ea6c21cae66fdd4d29dfea4fbd38bc1aeeab83616d494560a96d17da1284a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/bundle.json","state_url":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/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-06T20:11:42Z","links":{"resolver":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A","bundle":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/bundle.json","state":"https://pith.science/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4D3DIZ4QCFH2MYEXZUU755P5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D4D3DIZ4QCFH2MYEXZUU755P5A","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":"80beed652482428b71fd0f54b35c505662002579dd9a896955ec10414a3a20e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T14:23:50Z","title_canon_sha256":"2d91d3de545afbe0991dacc7deafef209f7fc8ac1bfdde930debcb5bb3d13014"},"schema_version":"1.0","source":{"id":"1604.00870","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00870","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00870v2","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00870","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"pith_short_12","alias_value":"D4D3DIZ4QCFH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D4D3DIZ4QCFH2MYE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D4D3DIZ4","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:5b9ea6c21cae66fdd4d29dfea4fbd38bc1aeeab83616d494560a96d17da1284a","target":"graph","created_at":"2026-05-18T00:26:16Z","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 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","authors_text":"Peter Winkler, Shahrzad Haddadan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T14:23:50Z","title":"Mixing Time for Some Adjacent Transposition Markov Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00870","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:39fe5c3490c32180bca28831da143a2613497aff4fbe5e587a75ab03be7cf920","target":"record","created_at":"2026-05-18T00:26:16Z","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":"80beed652482428b71fd0f54b35c505662002579dd9a896955ec10414a3a20e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T14:23:50Z","title_canon_sha256":"2d91d3de545afbe0991dacc7deafef209f7fc8ac1bfdde930debcb5bb3d13014"},"schema_version":"1.0","source":{"id":"1604.00870","kind":"arxiv","version":2}},"canonical_sha256":"1f07b1a33c808a7d3304be694ff7afe804c647781059246e18a72ed043eeaf4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f07b1a33c808a7d3304be694ff7afe804c647781059246e18a72ed043eeaf4c","first_computed_at":"2026-05-18T00:26:16.718043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:16.718043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dTxCGo5cx+n8xaHE6m1rLpnk2kZVzr/V9Arhua++cEaiTFnF+0na+bh7H7SU9k+vtcQlNXcY8s5A9Oz3U8k3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:16.718575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00870","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39fe5c3490c32180bca28831da143a2613497aff4fbe5e587a75ab03be7cf920","sha256:5b9ea6c21cae66fdd4d29dfea4fbd38bc1aeeab83616d494560a96d17da1284a"],"state_sha256":"42f1562d4bb3c4bf22781c5d87faeef367b5f85df0f0caeafa25a6fde9ccf278"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNsnQYNvmAap4qkfAV3GLYRUfN8ycDZxMZ/Eb3ZJ+yJrItys3Fidkj0O8rDARQAAK3L1v+3YO8pigkwp0wBcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:11:42.561492Z","bundle_sha256":"4b32c69c2dd178ab35544c68dae3ff363a983538e4230c56bb45576145f17fe4"}}