{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U55PIC6XPCDXR4GVHJN5CADV7W","short_pith_number":"pith:U55PIC6X","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"},"canonical_sha256":"a77af40bd7788778f0d53a5bd10075fdbe766ecb2ad800c033a1dde8257787ab","source":{"kind":"arxiv","id":"1406.3911","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3911","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3911v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3911","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"U55PIC6XPCDX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U55PIC6XPCDXR4GV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U55PIC6X","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U55PIC6XPCDXR4GVHJN5CADV7W","target":"record","payload":{"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"},"canonical_sha256":"a77af40bd7788778f0d53a5bd10075fdbe766ecb2ad800c033a1dde8257787ab","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"},"source_kind":"arxiv","source_id":"1406.3911","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwlGmNXLTE9TxGCiA7rtwv1qE7aArqz5RBBQe7q8omraFaxkBkst+1y5JcdDS7tfcWGzW25PKUjNWzEtGdiuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:53:53.358941Z"},"content_sha256":"05bd4f449c40537dd2cdd17bb43b168c71c7ce3f15ec1956d20b3ad5b0a83633","schema_version":"1.0","event_id":"sha256:05bd4f449c40537dd2cdd17bb43b168c71c7ce3f15ec1956d20b3ad5b0a83633"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U55PIC6XPCDXR4GVHJN5CADV7W","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jV2yidyBxzgHAok4NgkQcYkDQDfGdj4BaW2C0r6Vax581D4bT5ylDSifi8THRImaZe3tpvD3aMIfAS1NOYbHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:53:53.359695Z"},"content_sha256":"15293cfc98034c40c78b263a40885ddf0a3efd7006c2e063ed81f898ebb4e8b5","schema_version":"1.0","event_id":"sha256:15293cfc98034c40c78b263a40885ddf0a3efd7006c2e063ed81f898ebb4e8b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W/bundle.json","state_url":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U55PIC6XPCDXR4GVHJN5CADV7W/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T15:53:53Z","links":{"resolver":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W","bundle":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W/bundle.json","state":"https://pith.science/pith/U55PIC6XPCDXR4GVHJN5CADV7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U55PIC6XPCDXR4GVHJN5CADV7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U55PIC6XPCDXR4GVHJN5CADV7W","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":"3931d3183aac5e08190b0cde7c2bff75b26cc28abf3f11645c1b0054c8bed6c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-06-16T06:02:24Z","title_canon_sha256":"ecd126966ae6f49f68a2d67551a82b40a44b89891998492f5de56083b5ac3c3d"},"schema_version":"1.0","source":{"id":"1406.3911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3911","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3911v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3911","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"U55PIC6XPCDX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U55PIC6XPCDXR4GV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U55PIC6X","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:15293cfc98034c40c78b263a40885ddf0a3efd7006c2e063ed81f898ebb4e8b5","target":"graph","created_at":"2026-05-18T02:49:39Z","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"},"paper":{"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","authors_text":"Nicholas F. Travers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-06-16T06:02:24Z","title":"Inversions and Longest Increasing Subsequence for $k$-Card-Minimum Random Permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3911","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:05bd4f449c40537dd2cdd17bb43b168c71c7ce3f15ec1956d20b3ad5b0a83633","target":"record","created_at":"2026-05-18T02:49:39Z","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":"3931d3183aac5e08190b0cde7c2bff75b26cc28abf3f11645c1b0054c8bed6c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-06-16T06:02:24Z","title_canon_sha256":"ecd126966ae6f49f68a2d67551a82b40a44b89891998492f5de56083b5ac3c3d"},"schema_version":"1.0","source":{"id":"1406.3911","kind":"arxiv","version":1}},"canonical_sha256":"a77af40bd7788778f0d53a5bd10075fdbe766ecb2ad800c033a1dde8257787ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a77af40bd7788778f0d53a5bd10075fdbe766ecb2ad800c033a1dde8257787ab","first_computed_at":"2026-05-18T02:49:39.514036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.514036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"30drp57G7Ly9BN4C2bdbl6pCHLRsZoSmTvToCeuq21ciZwKWZcaMmeQwnMuPul+aBfrF+IRPPBI3bwn6fD87DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.514357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05bd4f449c40537dd2cdd17bb43b168c71c7ce3f15ec1956d20b3ad5b0a83633","sha256:15293cfc98034c40c78b263a40885ddf0a3efd7006c2e063ed81f898ebb4e8b5"],"state_sha256":"a64368d0220c3ec91f2d6d96cec82b7de16ff8866cb1a800fa4d7a101e426e2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cd/JQF7LmD/n7125GMMtleuRMTTh382GXamgSYzoi6lWrA/EC4lWQFlGIod6NEIxGFNPMxRz7I0XB1FtSMP5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:53:53.363910Z","bundle_sha256":"7020204b034a3009eb17f72c76a23b9f5c494e1247548bc68a0fc3a012c17915"}}