{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T6YAEJA46BVS5S6FA5NE5JWMEO","short_pith_number":"pith:T6YAEJA4","schema_version":"1.0","canonical_sha256":"9fb002241cf06b2ecbc5075a4ea6cc23828355c7334d966b29e9b060346e5d53","source":{"kind":"arxiv","id":"1805.10508","version":1},"attestation_state":"computed","paper":{"title":"Cutoff for the cyclic adjacent transposition shuffle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Danny Nam, Evita Nestoridi","submitted_at":"2018-05-26T17:17:36Z","abstract_excerpt":"We study the cyclic adjacent transposition (CAT) shuffle of $n$ cards, which is a systematic scan version of the random adjacent transposition (AT) card shuffle. In this paper, we prove that the CAT shuffle exhibits cutoff at $\\frac{n^3}{2 \\pi^2} \\log n$, which concludes that it is twice as fast as the AT shuffle."},"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":"1805.10508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-26T17:17:36Z","cross_cats_sorted":[],"title_canon_sha256":"174bc1fed270ad8290c5391dc53590539b522471327ee624b3e8c3fa8218abe2","abstract_canon_sha256":"e4cb54ed279bda5c8f9f97caf09dd73f647c1213bd41ba835b02fd1e83ca7522"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:52.324269Z","signature_b64":"sWjwE3iNYWQCC3qPldMABX5IerSTrACF1h52CD6POpWIb2FOmCW1HGrtkor1+1vZ/U0ZZ0FsBu77JvNd9YXLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb002241cf06b2ecbc5075a4ea6cc23828355c7334d966b29e9b060346e5d53","last_reissued_at":"2026-05-18T00:14:52.323516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:52.323516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutoff for the cyclic adjacent transposition shuffle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Danny Nam, Evita Nestoridi","submitted_at":"2018-05-26T17:17:36Z","abstract_excerpt":"We study the cyclic adjacent transposition (CAT) shuffle of $n$ cards, which is a systematic scan version of the random adjacent transposition (AT) card shuffle. In this paper, we prove that the CAT shuffle exhibits cutoff at $\\frac{n^3}{2 \\pi^2} \\log n$, which concludes that it is twice as fast as the AT shuffle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10508","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":"1805.10508","created_at":"2026-05-18T00:14:52.323611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10508v1","created_at":"2026-05-18T00:14:52.323611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10508","created_at":"2026-05-18T00:14:52.323611+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6YAEJA46BVS","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6YAEJA46BVS5S6F","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6YAEJA4","created_at":"2026-05-18T12:32:53.628368+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/T6YAEJA46BVS5S6FA5NE5JWMEO","json":"https://pith.science/pith/T6YAEJA46BVS5S6FA5NE5JWMEO.json","graph_json":"https://pith.science/api/pith-number/T6YAEJA46BVS5S6FA5NE5JWMEO/graph.json","events_json":"https://pith.science/api/pith-number/T6YAEJA46BVS5S6FA5NE5JWMEO/events.json","paper":"https://pith.science/paper/T6YAEJA4"},"agent_actions":{"view_html":"https://pith.science/pith/T6YAEJA46BVS5S6FA5NE5JWMEO","download_json":"https://pith.science/pith/T6YAEJA46BVS5S6FA5NE5JWMEO.json","view_paper":"https://pith.science/paper/T6YAEJA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10508&json=true","fetch_graph":"https://pith.science/api/pith-number/T6YAEJA46BVS5S6FA5NE5JWMEO/graph.json","fetch_events":"https://pith.science/api/pith-number/T6YAEJA46BVS5S6FA5NE5JWMEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6YAEJA46BVS5S6FA5NE5JWMEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6YAEJA46BVS5S6FA5NE5JWMEO/action/storage_attestation","attest_author":"https://pith.science/pith/T6YAEJA46BVS5S6FA5NE5JWMEO/action/author_attestation","sign_citation":"https://pith.science/pith/T6YAEJA46BVS5S6FA5NE5JWMEO/action/citation_signature","submit_replication":"https://pith.science/pith/T6YAEJA46BVS5S6FA5NE5JWMEO/action/replication_record"}},"created_at":"2026-05-18T00:14:52.323611+00:00","updated_at":"2026-05-18T00:14:52.323611+00:00"}