{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U2NY3ER34S5FICJ3AMUU22ZOEW","short_pith_number":"pith:U2NY3ER3","schema_version":"1.0","canonical_sha256":"a69b8d923be4ba54093b03294d6b2e25b18ca012cbba475b26747d9e09fd7073","source":{"kind":"arxiv","id":"1204.3239","version":1},"attestation_state":"computed","paper":{"title":"Mixing Times of Self-Organizing Lists and Biased Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Amanda Pascoe Streib, Dana Randall, Prateek Bhakta, Sarah Miracle","submitted_at":"2012-04-15T06:21:46Z","abstract_excerpt":"Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \\cal{M}}_{nn} is known to converge in time \\Theta(n^3 \\log n) in the uniform case and time \\Theta(n^2) in the constant bias case, in which we put adjacent elements in order with probability p \\neq 1/2 and out of order with probability 1-p. Here we consider the variable bias case where we put adjacent elements x<y in order with probability p{x,y} and out of order with probability 1-p_{x,y}. The problem of bounding the mixing rate of M_{nn} was posed by Fill and was motivated"},"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":"1204.3239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-15T06:21:46Z","cross_cats_sorted":[],"title_canon_sha256":"a1053504ada0d550958394682103ad119741080451a0b564242753b08858e3c8","abstract_canon_sha256":"4e0f2ff682d08e607cce4e5d6d4fc07e9a15f25a4ad706d05921e83a516da60c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:52.146655Z","signature_b64":"VmK1wD9a0T6BjumZjMEWOghKm53wW5ukl7hT78cYliknQG8941sZKLwbxtnJKfPkGlryHbYONn8j8S8/gNo1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a69b8d923be4ba54093b03294d6b2e25b18ca012cbba475b26747d9e09fd7073","last_reissued_at":"2026-05-18T03:57:52.146122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:52.146122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing Times of Self-Organizing Lists and Biased Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Amanda Pascoe Streib, Dana Randall, Prateek Bhakta, Sarah Miracle","submitted_at":"2012-04-15T06:21:46Z","abstract_excerpt":"Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \\cal{M}}_{nn} is known to converge in time \\Theta(n^3 \\log n) in the uniform case and time \\Theta(n^2) in the constant bias case, in which we put adjacent elements in order with probability p \\neq 1/2 and out of order with probability 1-p. Here we consider the variable bias case where we put adjacent elements x<y in order with probability p{x,y} and out of order with probability 1-p_{x,y}. The problem of bounding the mixing rate of M_{nn} was posed by Fill and was motivated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3239","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":"1204.3239","created_at":"2026-05-18T03:57:52.146216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3239v1","created_at":"2026-05-18T03:57:52.146216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3239","created_at":"2026-05-18T03:57:52.146216+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2NY3ER34S5F","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2NY3ER34S5FICJ3","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2NY3ER3","created_at":"2026-05-18T12:27:23.164592+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/U2NY3ER34S5FICJ3AMUU22ZOEW","json":"https://pith.science/pith/U2NY3ER34S5FICJ3AMUU22ZOEW.json","graph_json":"https://pith.science/api/pith-number/U2NY3ER34S5FICJ3AMUU22ZOEW/graph.json","events_json":"https://pith.science/api/pith-number/U2NY3ER34S5FICJ3AMUU22ZOEW/events.json","paper":"https://pith.science/paper/U2NY3ER3"},"agent_actions":{"view_html":"https://pith.science/pith/U2NY3ER34S5FICJ3AMUU22ZOEW","download_json":"https://pith.science/pith/U2NY3ER34S5FICJ3AMUU22ZOEW.json","view_paper":"https://pith.science/paper/U2NY3ER3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3239&json=true","fetch_graph":"https://pith.science/api/pith-number/U2NY3ER34S5FICJ3AMUU22ZOEW/graph.json","fetch_events":"https://pith.science/api/pith-number/U2NY3ER34S5FICJ3AMUU22ZOEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2NY3ER34S5FICJ3AMUU22ZOEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2NY3ER34S5FICJ3AMUU22ZOEW/action/storage_attestation","attest_author":"https://pith.science/pith/U2NY3ER34S5FICJ3AMUU22ZOEW/action/author_attestation","sign_citation":"https://pith.science/pith/U2NY3ER34S5FICJ3AMUU22ZOEW/action/citation_signature","submit_replication":"https://pith.science/pith/U2NY3ER34S5FICJ3AMUU22ZOEW/action/replication_record"}},"created_at":"2026-05-18T03:57:52.146216+00:00","updated_at":"2026-05-18T03:57:52.146216+00:00"}