{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U55PIC6XPCDXR4GVHJN5CADV7W","short_pith_number":"pith:U55PIC6X","schema_version":"1.0","canonical_sha256":"a77af40bd7788778f0d53a5bd10075fdbe766ecb2ad800c033a1dde8257787ab","source":{"kind":"arxiv","id":"1406.3911","version":1},"attestation_state":"computed","paper":{"title":"Inversions and Longest Increasing Subsequence for $k$-Card-Minimum Random Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Nicholas F. Travers","submitted_at":"2014-06-16T06:02:24Z","abstract_excerpt":"A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \\{1,...,n\\}$. The permutation $\\sigma$ is simply the sequence of cards in the order they are removed. This permutation is itself uniformly random, as long as each random card $C_t$ is drawn uniformly from the remaining set at time $t$. We consider, here, a variant of this simple procedure in which one is given a choice between $k$ random cards from the remaining set at each step, and selects the lowest numbered of these for removal. This induces a bias towards selecting lowe"},"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":"1406.3911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-06-16T06:02:24Z","cross_cats_sorted":[],"title_canon_sha256":"ecd126966ae6f49f68a2d67551a82b40a44b89891998492f5de56083b5ac3c3d","abstract_canon_sha256":"3931d3183aac5e08190b0cde7c2bff75b26cc28abf3f11645c1b0054c8bed6c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.514357Z","signature_b64":"30drp57G7Ly9BN4C2bdbl6pCHLRsZoSmTvToCeuq21ciZwKWZcaMmeQwnMuPul+aBfrF+IRPPBI3bwn6fD87DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a77af40bd7788778f0d53a5bd10075fdbe766ecb2ad800c033a1dde8257787ab","last_reissued_at":"2026-05-18T02:49:39.514036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.514036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inversions and Longest Increasing Subsequence for $k$-Card-Minimum Random Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Nicholas F. Travers","submitted_at":"2014-06-16T06:02:24Z","abstract_excerpt":"A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \\{1,...,n\\}$. The permutation $\\sigma$ is simply the sequence of cards in the order they are removed. This permutation is itself uniformly random, as long as each random card $C_t$ is drawn uniformly from the remaining set at time $t$. We consider, here, a variant of this simple procedure in which one is given a choice between $k$ random cards from the remaining set at each step, and selects the lowest numbered of these for removal. This induces a bias towards selecting lowe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3911","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":"1406.3911","created_at":"2026-05-18T02:49:39.514085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3911v1","created_at":"2026-05-18T02:49:39.514085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3911","created_at":"2026-05-18T02:49:39.514085+00:00"},{"alias_kind":"pith_short_12","alias_value":"U55PIC6XPCDX","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U55PIC6XPCDXR4GV","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U55PIC6X","created_at":"2026-05-18T12:28:52.271510+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/U55PIC6XPCDXR4GVHJN5CADV7W","json":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W.json","graph_json":"https://pith.science/api/pith-number/U55PIC6XPCDXR4GVHJN5CADV7W/graph.json","events_json":"https://pith.science/api/pith-number/U55PIC6XPCDXR4GVHJN5CADV7W/events.json","paper":"https://pith.science/paper/U55PIC6X"},"agent_actions":{"view_html":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W","download_json":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W.json","view_paper":"https://pith.science/paper/U55PIC6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3911&json=true","fetch_graph":"https://pith.science/api/pith-number/U55PIC6XPCDXR4GVHJN5CADV7W/graph.json","fetch_events":"https://pith.science/api/pith-number/U55PIC6XPCDXR4GVHJN5CADV7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W/action/storage_attestation","attest_author":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W/action/author_attestation","sign_citation":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W/action/citation_signature","submit_replication":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W/action/replication_record"}},"created_at":"2026-05-18T02:49:39.514085+00:00","updated_at":"2026-05-18T02:49:39.514085+00:00"}