{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PWMHZ7467KRFFJX6YEYYUR2DIQ","short_pith_number":"pith:PWMHZ746","schema_version":"1.0","canonical_sha256":"7d987cff9efaa252a6fec1318a47434438db802ddf0c9074a9bdd7ccd407e834","source":{"kind":"arxiv","id":"1703.06210","version":2},"attestation_state":"computed","paper":{"title":"Cutoff for random to random card shuffle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Evita Nestoridi, Megan Bernstein","submitted_at":"2017-03-17T21:58:12Z","abstract_excerpt":"In this paper, we use the eigenvalues of the random to random card shuffle to prove a sharp upper bound for the total variation mixing time. Combined with the lower bound due to Subag, we prove that this walk exhibits cutoff at $\\frac{3}{4} n \\log n - \\frac{1}{4}n\\log\\log{n}$ with window of order $n$, answering a conjecture of Diaconis."},"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":"1703.06210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-17T21:58:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"efd6fcc38e29947e2f825591d01cbbb5cb7f136839ae8521684bc193fc7242fe","abstract_canon_sha256":"81fd0c351cd032a2bae0b372498a8c481d7596071041cf439fb9eb9af15e1efe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:31.298182Z","signature_b64":"+Ss+aPPMuCfZ2eEC6KoK8E2VSe4DC3/eeK3Vlx/3dQAQ5/r/JCpDnanuUD2epPLs1izgxXuFrrDu/E4RhojABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d987cff9efaa252a6fec1318a47434438db802ddf0c9074a9bdd7ccd407e834","last_reissued_at":"2026-05-17T23:58:31.297392Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:31.297392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutoff for random to random card shuffle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Evita Nestoridi, Megan Bernstein","submitted_at":"2017-03-17T21:58:12Z","abstract_excerpt":"In this paper, we use the eigenvalues of the random to random card shuffle to prove a sharp upper bound for the total variation mixing time. Combined with the lower bound due to Subag, we prove that this walk exhibits cutoff at $\\frac{3}{4} n \\log n - \\frac{1}{4}n\\log\\log{n}$ with window of order $n$, answering a conjecture of Diaconis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06210","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.06210","created_at":"2026-05-17T23:58:31.297525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06210v2","created_at":"2026-05-17T23:58:31.297525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06210","created_at":"2026-05-17T23:58:31.297525+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWMHZ7467KRF","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWMHZ7467KRFFJX6","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWMHZ746","created_at":"2026-05-18T12:31:37.085036+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/PWMHZ7467KRFFJX6YEYYUR2DIQ","json":"https://pith.science/pith/PWMHZ7467KRFFJX6YEYYUR2DIQ.json","graph_json":"https://pith.science/api/pith-number/PWMHZ7467KRFFJX6YEYYUR2DIQ/graph.json","events_json":"https://pith.science/api/pith-number/PWMHZ7467KRFFJX6YEYYUR2DIQ/events.json","paper":"https://pith.science/paper/PWMHZ746"},"agent_actions":{"view_html":"https://pith.science/pith/PWMHZ7467KRFFJX6YEYYUR2DIQ","download_json":"https://pith.science/pith/PWMHZ7467KRFFJX6YEYYUR2DIQ.json","view_paper":"https://pith.science/paper/PWMHZ746","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06210&json=true","fetch_graph":"https://pith.science/api/pith-number/PWMHZ7467KRFFJX6YEYYUR2DIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PWMHZ7467KRFFJX6YEYYUR2DIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWMHZ7467KRFFJX6YEYYUR2DIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWMHZ7467KRFFJX6YEYYUR2DIQ/action/storage_attestation","attest_author":"https://pith.science/pith/PWMHZ7467KRFFJX6YEYYUR2DIQ/action/author_attestation","sign_citation":"https://pith.science/pith/PWMHZ7467KRFFJX6YEYYUR2DIQ/action/citation_signature","submit_replication":"https://pith.science/pith/PWMHZ7467KRFFJX6YEYYUR2DIQ/action/replication_record"}},"created_at":"2026-05-17T23:58:31.297525+00:00","updated_at":"2026-05-17T23:58:31.297525+00:00"}