{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GDDGHD5QVH3YS4MFWX5OO566EX","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":"d9903d0ac4a1ad0c317021c1c1f38b2b140eac857ba4d3df37fe40e741e95d73","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-16T15:15:49Z","title_canon_sha256":"fa9a81d130a0f5d47c7eb0e1dc93b30c48098eb88bd9a7030a41c8afc39c6996"},"schema_version":"1.0","source":{"id":"2606.18039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18039","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18039v1","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18039","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"GDDGHD5QVH3Y","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_16","alias_value":"GDDGHD5QVH3YS4MF","created_at":"2026-06-19T16:10:46Z"},{"alias_kind":"pith_short_8","alias_value":"GDDGHD5Q","created_at":"2026-06-19T16:10:46Z"}],"graph_snapshots":[{"event_id":"sha256:fe3bf9c015d2e7f85e751bda6c68012c9a87e7fda97fcf4e8268002c06ff13ad","target":"graph","created_at":"2026-06-19T16:10:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.18039/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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. ","authors_text":"Raghavendra Tripathi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-16T15:15:49Z","title":"Cutoff for asymmetric shelf shuffle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18039","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:0871126e2febf309c0e8e80099eb7f5fa7ec54fc37bd9b8ac96d193bd802e54d","target":"record","created_at":"2026-06-19T16:10:46Z","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":"d9903d0ac4a1ad0c317021c1c1f38b2b140eac857ba4d3df37fe40e741e95d73","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-16T15:15:49Z","title_canon_sha256":"fa9a81d130a0f5d47c7eb0e1dc93b30c48098eb88bd9a7030a41c8afc39c6996"},"schema_version":"1.0","source":{"id":"2606.18039","kind":"arxiv","version":1}},"canonical_sha256":"30c6638fb0a9f7897185b5fae777de25ca12d4a6e49ccc166f93cbf2e829a20d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30c6638fb0a9f7897185b5fae777de25ca12d4a6e49ccc166f93cbf2e829a20d","first_computed_at":"2026-06-19T16:10:46.583422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:46.583422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SjCPX4ILvjU0gXKuddFuUmsrvE1aaEAJSCV12brRESvCKquNYLmTwSiHq9VzvTbyXgkAvQlbmi2wdrqM3glKBg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:46.583760Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0871126e2febf309c0e8e80099eb7f5fa7ec54fc37bd9b8ac96d193bd802e54d","sha256:fe3bf9c015d2e7f85e751bda6c68012c9a87e7fda97fcf4e8268002c06ff13ad"],"state_sha256":"9ab81732e6c93ee6fed4be345ebcba7d12b9ab578ec2ada05ac41ff9c1e1bc00"}