{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Z2H4FK7ZRWWBYKKHJMT4UK4VKC","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":"bfccc50d69c2f0a13210bfd9277c82931819c0543f3588c994ba56c2a70132b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-26T11:49:34Z","title_canon_sha256":"525730308710d2010e063c9517e0d3a5d7a5aeb460a293c57b9b8997ca6545ea"},"schema_version":"1.0","source":{"id":"1112.5847","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5847","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5847v2","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5847","created_at":"2026-05-18T02:21:26Z"},{"alias_kind":"pith_short_12","alias_value":"Z2H4FK7ZRWWB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z2H4FK7ZRWWBYKKH","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z2H4FK7Z","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:c7cbe0b0bace3b79059842184459fac6ee917ab67cc8baf66824df7dbd022b0f","target":"graph","created_at":"2026-05-18T02:21:26Z","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":"The best known lower and upper bounds on the mixing time for the random-to-random insertions shuffle are $(1/2-o(1))n\\log n$ and $(2+o(1))n\\log n$. A long standing open problem is to prove that the mixing time exhibits a cutoff. In particular, Diaconis conjectured that the cutoff occurs at $3/4n\\log n$. Our main result is a lower bound of $t_n = (3/4-o(1))n\\log n$, corresponding to this conjecture.\n  Our method is based on analysis of the positions of cards yet-to-be-removed. We show that for large $n$ and $t_n$ as above, there exists $f(n)=\\Theta(\\sqrt{n\\log n})$ such that, with high probabil","authors_text":"Eliran Subag","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-26T11:49:34Z","title":"A Lower Bound for the Mixing Time of the Random-to-Random Insertions Shuffle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5847","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:b29de3cbe30c174fdafebdf711c44cd88ca2fa584b6df9205883140e112e3ef4","target":"record","created_at":"2026-05-18T02:21:26Z","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":"bfccc50d69c2f0a13210bfd9277c82931819c0543f3588c994ba56c2a70132b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-26T11:49:34Z","title_canon_sha256":"525730308710d2010e063c9517e0d3a5d7a5aeb460a293c57b9b8997ca6545ea"},"schema_version":"1.0","source":{"id":"1112.5847","kind":"arxiv","version":2}},"canonical_sha256":"ce8fc2abf98dac1c29474b27ca2b9550a9ec9eb3f61e2ba20cdb9c091d83fc2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce8fc2abf98dac1c29474b27ca2b9550a9ec9eb3f61e2ba20cdb9c091d83fc2e","first_computed_at":"2026-05-18T02:21:26.937021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:26.937021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+zcVjtx202kUKcZGEGU4zXo/wFRfJ+WifXyTZKzMR20DsL0tFD2609zra1nkJ9xRDBLTPDbOh6SRIFxCDkb5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:26.937742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5847","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b29de3cbe30c174fdafebdf711c44cd88ca2fa584b6df9205883140e112e3ef4","sha256:c7cbe0b0bace3b79059842184459fac6ee917ab67cc8baf66824df7dbd022b0f"],"state_sha256":"6b1d17472ee63b5317c8909dfd75cb185b8a8ac2495b5e0194203dd1f394086b"}