{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:P3XMM5JBZKEYMUVPXOYBODTZCT","short_pith_number":"pith:P3XMM5JB","schema_version":"1.0","canonical_sha256":"7eeec67521ca898652afbbb0170e7914ef668554cd233a59478e7540ca4cdd79","source":{"kind":"arxiv","id":"1210.6916","version":1},"attestation_state":"computed","paper":{"title":"Mixing times for the interchange process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Johan Jonasson","submitted_at":"2012-10-25T17:23:01Z","abstract_excerpt":"Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at random and switching the two cards at the end vertices of the edge with probability 1/2. Well known special cases are the random transpositions shuffle, where $G$ is the complete graph, and the transposing neighbors shuffle, where $G$ is the $n$-path. Other cases that have been studied are the $d$-dimensional grid, the hypercube, lollipop graphs and Erd\\H o"},"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":"1210.6916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-25T17:23:01Z","cross_cats_sorted":[],"title_canon_sha256":"9afbfd77ab73bd28cb14d654ce086cf6da17ad1c5dd4c86ddead8e2c5c75de99","abstract_canon_sha256":"41cb1acdc6f21a2962b5ca14b485e2598a624fefd152665206cad1648e79ef7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:22.853739Z","signature_b64":"BCbzZAE/EA6eIa+xsTWqg55uo9NE/2YJBRMjssBIz0fx/fTMPEEY2bQkbqioPN1EqAfH4dvSWz1b726hPdepBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eeec67521ca898652afbbb0170e7914ef668554cd233a59478e7540ca4cdd79","last_reissued_at":"2026-05-18T03:42:22.853112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:22.853112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing times for the interchange process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Johan Jonasson","submitted_at":"2012-10-25T17:23:01Z","abstract_excerpt":"Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at random and switching the two cards at the end vertices of the edge with probability 1/2. Well known special cases are the random transpositions shuffle, where $G$ is the complete graph, and the transposing neighbors shuffle, where $G$ is the $n$-path. Other cases that have been studied are the $d$-dimensional grid, the hypercube, lollipop graphs and Erd\\H o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6916","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":"1210.6916","created_at":"2026-05-18T03:42:22.853196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6916v1","created_at":"2026-05-18T03:42:22.853196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6916","created_at":"2026-05-18T03:42:22.853196+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3XMM5JBZKEY","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3XMM5JBZKEYMUVP","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3XMM5JB","created_at":"2026-05-18T12:27:18.751474+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/P3XMM5JBZKEYMUVPXOYBODTZCT","json":"https://pith.science/pith/P3XMM5JBZKEYMUVPXOYBODTZCT.json","graph_json":"https://pith.science/api/pith-number/P3XMM5JBZKEYMUVPXOYBODTZCT/graph.json","events_json":"https://pith.science/api/pith-number/P3XMM5JBZKEYMUVPXOYBODTZCT/events.json","paper":"https://pith.science/paper/P3XMM5JB"},"agent_actions":{"view_html":"https://pith.science/pith/P3XMM5JBZKEYMUVPXOYBODTZCT","download_json":"https://pith.science/pith/P3XMM5JBZKEYMUVPXOYBODTZCT.json","view_paper":"https://pith.science/paper/P3XMM5JB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6916&json=true","fetch_graph":"https://pith.science/api/pith-number/P3XMM5JBZKEYMUVPXOYBODTZCT/graph.json","fetch_events":"https://pith.science/api/pith-number/P3XMM5JBZKEYMUVPXOYBODTZCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3XMM5JBZKEYMUVPXOYBODTZCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3XMM5JBZKEYMUVPXOYBODTZCT/action/storage_attestation","attest_author":"https://pith.science/pith/P3XMM5JBZKEYMUVPXOYBODTZCT/action/author_attestation","sign_citation":"https://pith.science/pith/P3XMM5JBZKEYMUVPXOYBODTZCT/action/citation_signature","submit_replication":"https://pith.science/pith/P3XMM5JBZKEYMUVPXOYBODTZCT/action/replication_record"}},"created_at":"2026-05-18T03:42:22.853196+00:00","updated_at":"2026-05-18T03:42:22.853196+00:00"}