{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J7JBAT475B73V5SZ5FH7XEKJLN","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":"64d70b7f15ded03287f5bd42c03089f35801b15e71eaa253286e3f71c43735cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-29T04:37:16Z","title_canon_sha256":"9a44bc34c8cb50b16cf3f232bec981a539a2b4385fd60e00384a1bb4b09d8d9d"},"schema_version":"1.0","source":{"id":"1412.0070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0070","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0070v1","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0070","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"J7JBAT475B73","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J7JBAT475B73V5SZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J7JBAT47","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:70e61395612750fcd814f94998488971cf1101c8733e9ff6815a2d599ac5c35e","target":"graph","created_at":"2026-05-18T02:32:31Z","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 an upper bound of $1.5324 n \\log n$ for the mixing time of the random-to-random insertion shuffle, improving on the best known upper bound of $2 n \\log n$. Our proof is based on the analysis of a non-Markovian coupling.","authors_text":"Ben Morris, Chuan Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-29T04:37:16Z","title":"Improved bounds for the mixing time of the random-to-random insertion shuffle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0070","kind":"arxiv","version":1},"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:550c46c8c83b65b2c3ba82689ad5ff686a693521460b79b07ea12f42ecb48a1a","target":"record","created_at":"2026-05-18T02:32:31Z","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":"64d70b7f15ded03287f5bd42c03089f35801b15e71eaa253286e3f71c43735cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-29T04:37:16Z","title_canon_sha256":"9a44bc34c8cb50b16cf3f232bec981a539a2b4385fd60e00384a1bb4b09d8d9d"},"schema_version":"1.0","source":{"id":"1412.0070","kind":"arxiv","version":1}},"canonical_sha256":"4fd2104f9fe87fbaf659e94ffb91495b69c15f9a3c68bdf79df6e93d803d0c9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fd2104f9fe87fbaf659e94ffb91495b69c15f9a3c68bdf79df6e93d803d0c9a","first_computed_at":"2026-05-18T02:32:31.431176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:31.431176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HvzM1fqNSi5At1u0yzX7QqIXXvqmHQMeJSBdnzr9cxsWOCvvPkP14+zkMeA0pZb3kr6Es2+QkEl3lU8Q/ivuCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:31.431532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:550c46c8c83b65b2c3ba82689ad5ff686a693521460b79b07ea12f42ecb48a1a","sha256:70e61395612750fcd814f94998488971cf1101c8733e9ff6815a2d599ac5c35e"],"state_sha256":"d26e6431c8ad913a15494ff688c11826ea7a278cd41f59a6b5f931ff32975e28"}