{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Z2H4FK7ZRWWBYKKHJMT4UK4VKC","short_pith_number":"pith:Z2H4FK7Z","canonical_record":{"source":{"id":"1112.5847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-26T11:49:34Z","cross_cats_sorted":[],"title_canon_sha256":"525730308710d2010e063c9517e0d3a5d7a5aeb460a293c57b9b8997ca6545ea","abstract_canon_sha256":"bfccc50d69c2f0a13210bfd9277c82931819c0543f3588c994ba56c2a70132b7"},"schema_version":"1.0"},"canonical_sha256":"ce8fc2abf98dac1c29474b27ca2b9550a9ec9eb3f61e2ba20cdb9c091d83fc2e","source":{"kind":"arxiv","id":"1112.5847","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Z2H4FK7ZRWWBYKKHJMT4UK4VKC","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-12-26T11:49:34Z","cross_cats_sorted":[],"title_canon_sha256":"525730308710d2010e063c9517e0d3a5d7a5aeb460a293c57b9b8997ca6545ea","abstract_canon_sha256":"bfccc50d69c2f0a13210bfd9277c82931819c0543f3588c994ba56c2a70132b7"},"schema_version":"1.0"},"canonical_sha256":"ce8fc2abf98dac1c29474b27ca2b9550a9ec9eb3f61e2ba20cdb9c091d83fc2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:26.937742Z","signature_b64":"+zcVjtx202kUKcZGEGU4zXo/wFRfJ+WifXyTZKzMR20DsL0tFD2609zra1nkJ9xRDBLTPDbOh6SRIFxCDkb5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce8fc2abf98dac1c29474b27ca2b9550a9ec9eb3f61e2ba20cdb9c091d83fc2e","last_reissued_at":"2026-05-18T02:21:26.937021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:26.937021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5847","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-18T02:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwOAwNp/dE2VbfHtkRg1PkZyfjR0FlNyZuJBKkP/7pOFqx9ywdmkSPFlR6XNjU+IuFf9s70SEv+rI3tcbpbaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:35:06.253247Z"},"content_sha256":"b29de3cbe30c174fdafebdf711c44cd88ca2fa584b6df9205883140e112e3ef4","schema_version":"1.0","event_id":"sha256:b29de3cbe30c174fdafebdf711c44cd88ca2fa584b6df9205883140e112e3ef4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Z2H4FK7ZRWWBYKKHJMT4UK4VKC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lower Bound for the Mixing Time of the Random-to-Random Insertions Shuffle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eliran Subag","submitted_at":"2011-12-26T11:49:34Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5847","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-18T02:21:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sha0vzZJWfMrvGqYpjE5V/AdnMqFlf4QWsU4QBH8QGyy7CBWBx3KM/AakVxjRFFGOtBgGblq1KC9ARTAkx7sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:35:06.253616Z"},"content_sha256":"c7cbe0b0bace3b79059842184459fac6ee917ab67cc8baf66824df7dbd022b0f","schema_version":"1.0","event_id":"sha256:c7cbe0b0bace3b79059842184459fac6ee917ab67cc8baf66824df7dbd022b0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2H4FK7ZRWWBYKKHJMT4UK4VKC/bundle.json","state_url":"https://pith.science/pith/Z2H4FK7ZRWWBYKKHJMT4UK4VKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2H4FK7ZRWWBYKKHJMT4UK4VKC/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-03T06:35:06Z","links":{"resolver":"https://pith.science/pith/Z2H4FK7ZRWWBYKKHJMT4UK4VKC","bundle":"https://pith.science/pith/Z2H4FK7ZRWWBYKKHJMT4UK4VKC/bundle.json","state":"https://pith.science/pith/Z2H4FK7ZRWWBYKKHJMT4UK4VKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2H4FK7ZRWWBYKKHJMT4UK4VKC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WvpxCwM5z4fheoCYZlBp7Ltiy6Iq+n6NhWZltMQdudOu3rv4BZUuybD8KgKYDB35b5FYkU38FJ019E1a0+dlAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:35:06.255588Z","bundle_sha256":"1259969eba8ea94011e3a5beaf8f2854e6a63dab4d95ea7fdcef3df9a4a79bba"}}