{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GDDGHD5QVH3YS4MFWX5OO566EX","short_pith_number":"pith:GDDGHD5Q","schema_version":"1.0","canonical_sha256":"30c6638fb0a9f7897185b5fae777de25ca12d4a6e49ccc166f93cbf2e829a20d","source":{"kind":"arxiv","id":"2606.18039","version":1},"attestation_state":"computed","paper":{"title":"Cutoff for asymmetric shelf shuffle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Raghavendra Tripathi","submitted_at":"2026-06-16T15:15:49Z","abstract_excerpt":"A mechanical shuffler consists of $m$ shelves. A deck of $n$ cards, arranged in increasing order, is dealt from the bottom sequentially. Each card is assigned a shelf uniformly at random and placed on the top (bottom) of the existing pile with probability $p$ ($1-p$) independently. We refer to this as asymmetric shelf-shuffle. We find the law $\\nu_{n, m}^{(p)}$ of the permutation induced by the asymmetric shelf-shuffle and show that the pair consisting of the number of descents and the number of valleys is a sufficient statistic. This generalizes a result of Diaconis, Fulman, and Holmes (Ann. "},"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":"2606.18039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-16T15:15:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fa9a81d130a0f5d47c7eb0e1dc93b30c48098eb88bd9a7030a41c8afc39c6996","abstract_canon_sha256":"d9903d0ac4a1ad0c317021c1c1f38b2b140eac857ba4d3df37fe40e741e95d73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:46.583760Z","signature_b64":"SjCPX4ILvjU0gXKuddFuUmsrvE1aaEAJSCV12brRESvCKquNYLmTwSiHq9VzvTbyXgkAvQlbmi2wdrqM3glKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c6638fb0a9f7897185b5fae777de25ca12d4a6e49ccc166f93cbf2e829a20d","last_reissued_at":"2026-06-19T16:10:46.583422Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:46.583422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutoff for asymmetric shelf shuffle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Raghavendra Tripathi","submitted_at":"2026-06-16T15:15:49Z","abstract_excerpt":"A mechanical shuffler consists of $m$ shelves. A deck of $n$ cards, arranged in increasing order, is dealt from the bottom sequentially. Each card is assigned a shelf uniformly at random and placed on the top (bottom) of the existing pile with probability $p$ ($1-p$) independently. We refer to this as asymmetric shelf-shuffle. We find the law $\\nu_{n, m}^{(p)}$ of the permutation induced by the asymmetric shelf-shuffle and show that the pair consisting of the number of descents and the number of valleys is a sufficient statistic. This generalizes a result of Diaconis, Fulman, and Holmes (Ann. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18039","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/2606.18039/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":"2606.18039","created_at":"2026-06-19T16:10:46.583486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18039v1","created_at":"2026-06-19T16:10:46.583486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18039","created_at":"2026-06-19T16:10:46.583486+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDDGHD5QVH3Y","created_at":"2026-06-19T16:10:46.583486+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDDGHD5QVH3YS4MF","created_at":"2026-06-19T16:10:46.583486+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDDGHD5Q","created_at":"2026-06-19T16:10:46.583486+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/GDDGHD5QVH3YS4MFWX5OO566EX","json":"https://pith.science/pith/GDDGHD5QVH3YS4MFWX5OO566EX.json","graph_json":"https://pith.science/api/pith-number/GDDGHD5QVH3YS4MFWX5OO566EX/graph.json","events_json":"https://pith.science/api/pith-number/GDDGHD5QVH3YS4MFWX5OO566EX/events.json","paper":"https://pith.science/paper/GDDGHD5Q"},"agent_actions":{"view_html":"https://pith.science/pith/GDDGHD5QVH3YS4MFWX5OO566EX","download_json":"https://pith.science/pith/GDDGHD5QVH3YS4MFWX5OO566EX.json","view_paper":"https://pith.science/paper/GDDGHD5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18039&json=true","fetch_graph":"https://pith.science/api/pith-number/GDDGHD5QVH3YS4MFWX5OO566EX/graph.json","fetch_events":"https://pith.science/api/pith-number/GDDGHD5QVH3YS4MFWX5OO566EX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDDGHD5QVH3YS4MFWX5OO566EX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDDGHD5QVH3YS4MFWX5OO566EX/action/storage_attestation","attest_author":"https://pith.science/pith/GDDGHD5QVH3YS4MFWX5OO566EX/action/author_attestation","sign_citation":"https://pith.science/pith/GDDGHD5QVH3YS4MFWX5OO566EX/action/citation_signature","submit_replication":"https://pith.science/pith/GDDGHD5QVH3YS4MFWX5OO566EX/action/replication_record"}},"created_at":"2026-06-19T16:10:46.583486+00:00","updated_at":"2026-06-19T16:10:46.583486+00:00"}