{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XGT4VOOOPBNBYVG7U5POV2BSKU","short_pith_number":"pith:XGT4VOOO","schema_version":"1.0","canonical_sha256":"b9a7cab9ce785a1c54dfa75eeae832553d65408fabe75cbc5dda7aaa939b01e0","source":{"kind":"arxiv","id":"1908.05128","version":1},"attestation_state":"computed","paper":{"title":"Generalised shuffle groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Carmen Amarra, Cheryl E. Praeger, Luke Morgan","submitted_at":"2019-08-14T13:51:48Z","abstract_excerpt":"The mathematics of shuffling a deck of $2n$ cards with two \"perfect shuffles\" was brought into clarity by Diaconis, Graham and Kantor. Here we consider a generalisation of this problem, with a so-called \"many handed dealer\" shuffling $kn$ cards by cutting into $k$ piles with $n$ cards in each pile and using $k!$ shuffles. A conjecture of Medvedoff and Morrison suggests that all possible permutations of the deck of cards are achieved, so long as $k\\neq 4$ and $n$ is not a power of $k$. We confirm this conjecture for three doubly infinite families of integers: all $(k,n)$ with $k>n$; all $(k, n)"},"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":"1908.05128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-08-14T13:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"eb21d1d47d98341536d65bb2eb4bd26602582f3e5878384d65a1681e6d31c3b5","abstract_canon_sha256":"e3daa82d67c9f04749e47e20300db018a99a765a7c5433060aff39a2527a5ec1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:36.597796Z","signature_b64":"E2EW0dlhazhTSSvPZj2cZQHAkX+S/4YuaSZ/TBcKfuMgzkT+QR0MyZXsP6IEPEYVNTy0L2TIY5l6Wi6IKj0bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a7cab9ce785a1c54dfa75eeae832553d65408fabe75cbc5dda7aaa939b01e0","last_reissued_at":"2026-07-04T23:56:36.597294Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:36.597294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalised shuffle groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Carmen Amarra, Cheryl E. Praeger, Luke Morgan","submitted_at":"2019-08-14T13:51:48Z","abstract_excerpt":"The mathematics of shuffling a deck of $2n$ cards with two \"perfect shuffles\" was brought into clarity by Diaconis, Graham and Kantor. Here we consider a generalisation of this problem, with a so-called \"many handed dealer\" shuffling $kn$ cards by cutting into $k$ piles with $n$ cards in each pile and using $k!$ shuffles. A conjecture of Medvedoff and Morrison suggests that all possible permutations of the deck of cards are achieved, so long as $k\\neq 4$ and $n$ is not a power of $k$. We confirm this conjecture for three doubly infinite families of integers: all $(k,n)$ with $k>n$; all $(k, n)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05128","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05128/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.05128","created_at":"2026-07-04T23:56:36.597370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05128v1","created_at":"2026-07-04T23:56:36.597370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05128","created_at":"2026-07-04T23:56:36.597370+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGT4VOOOPBNB","created_at":"2026-07-04T23:56:36.597370+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGT4VOOOPBNBYVG7","created_at":"2026-07-04T23:56:36.597370+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGT4VOOO","created_at":"2026-07-04T23:56:36.597370+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/XGT4VOOOPBNBYVG7U5POV2BSKU","json":"https://pith.science/pith/XGT4VOOOPBNBYVG7U5POV2BSKU.json","graph_json":"https://pith.science/api/pith-number/XGT4VOOOPBNBYVG7U5POV2BSKU/graph.json","events_json":"https://pith.science/api/pith-number/XGT4VOOOPBNBYVG7U5POV2BSKU/events.json","paper":"https://pith.science/paper/XGT4VOOO"},"agent_actions":{"view_html":"https://pith.science/pith/XGT4VOOOPBNBYVG7U5POV2BSKU","download_json":"https://pith.science/pith/XGT4VOOOPBNBYVG7U5POV2BSKU.json","view_paper":"https://pith.science/paper/XGT4VOOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05128&json=true","fetch_graph":"https://pith.science/api/pith-number/XGT4VOOOPBNBYVG7U5POV2BSKU/graph.json","fetch_events":"https://pith.science/api/pith-number/XGT4VOOOPBNBYVG7U5POV2BSKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGT4VOOOPBNBYVG7U5POV2BSKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGT4VOOOPBNBYVG7U5POV2BSKU/action/storage_attestation","attest_author":"https://pith.science/pith/XGT4VOOOPBNBYVG7U5POV2BSKU/action/author_attestation","sign_citation":"https://pith.science/pith/XGT4VOOOPBNBYVG7U5POV2BSKU/action/citation_signature","submit_replication":"https://pith.science/pith/XGT4VOOOPBNBYVG7U5POV2BSKU/action/replication_record"}},"created_at":"2026-07-04T23:56:36.597370+00:00","updated_at":"2026-07-04T23:56:36.597370+00:00"}