{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VXJPUS6R2TPZRGE2YBNPXUSLGL","short_pith_number":"pith:VXJPUS6R","canonical_record":{"source":{"id":"1508.03167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-13T10:37:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e1cd968917bad10daaf859672a983cff9d733dd6e3af4aeab88825099f874585","abstract_canon_sha256":"7fedb3b21e53a2e3f1638080747c7a11bb36e99a162dcc3105a1361fdbb68d88"},"schema_version":"1.0"},"canonical_sha256":"add2fa4bd1d4df98989ac05afbd24b32df24dafd8bf9f86ea96bf31922ededa6","source":{"kind":"arxiv","id":"1508.03167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03167","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03167v1","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03167","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"pith_short_12","alias_value":"VXJPUS6R2TPZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VXJPUS6R2TPZRGE2","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VXJPUS6R","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VXJPUS6R2TPZRGE2YBNPXUSLGL","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-13T10:37:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e1cd968917bad10daaf859672a983cff9d733dd6e3af4aeab88825099f874585","abstract_canon_sha256":"7fedb3b21e53a2e3f1638080747c7a11bb36e99a162dcc3105a1361fdbb68d88"},"schema_version":"1.0"},"canonical_sha256":"add2fa4bd1d4df98989ac05afbd24b32df24dafd8bf9f86ea96bf31922ededa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:21.549965Z","signature_b64":"A4N+LtvBYxQ1lDR7YSbwIvrdm7nwVMXl+f1XZg8YIxc6dkF2o0NdxX74vBBkQOhe07/dTiLAjnQtArfz906nAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add2fa4bd1d4df98989ac05afbd24b32df24dafd8bf9f86ea96bf31922ededa6","last_reissued_at":"2026-05-18T01:35:21.549279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:21.549279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03167","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-18T01:35:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nn8L+HsW/jb/O90xBYLxaBdAY26uudoWnq9EvZ/eIJfqWu4UWLYPJh/wmQP+B/TaF4MWBq8m5j61bAqydnh5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:24:15.305457Z"},"content_sha256":"636b97082aadb29993d6491cb1e63064b5487f70624987ccf6e88d8c9bf76b9e","schema_version":"1.0","event_id":"sha256:636b97082aadb29993d6491cb1e63064b5487f70624987ccf6e88d8c9bf76b9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VXJPUS6R2TPZRGE2YBNPXUSLGL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Alexandros Hollender, Axel Bacher, J\\'er\\'emie Lumbroso, Olivier Bodini","submitted_at":"2015-08-13T10:37:54Z","abstract_excerpt":"This article introduces an algorithm, MergeShuffle, which is an extremely efficient algorithm to generate random permutations (or to randomly permute an existing array). It is easy to implement, runs in $n\\log_2 n + O(1)$ time, is in-place, uses $n\\log_2 n + \\Theta(n)$ random bits, and can be parallelized accross any number of processes, in a shared-memory PRAM model. Finally, our preliminary simulations using OpenMP suggest it is more efficient than the Rao-Sandelius algorithm, one of the fastest existing random permutation algorithms.\n  We also show how it is possible to further reduce the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03167","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-18T01:35:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCq3nopY27vviPgfw9X5zbpq2p8Fa/TJpDpZEpn0E75IwwZMv4QGoD1RIMtoaBXuu2kLGvUPRzXCScpZn2AkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:24:15.306145Z"},"content_sha256":"531183a70a5af49a096e1ce541d8b721937a41e0792f65d14bd8cd772e072e9e","schema_version":"1.0","event_id":"sha256:531183a70a5af49a096e1ce541d8b721937a41e0792f65d14bd8cd772e072e9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/bundle.json","state_url":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/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-09T07:24:15Z","links":{"resolver":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL","bundle":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/bundle.json","state":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VXJPUS6R2TPZRGE2YBNPXUSLGL","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":"7fedb3b21e53a2e3f1638080747c7a11bb36e99a162dcc3105a1361fdbb68d88","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-13T10:37:54Z","title_canon_sha256":"e1cd968917bad10daaf859672a983cff9d733dd6e3af4aeab88825099f874585"},"schema_version":"1.0","source":{"id":"1508.03167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03167","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03167v1","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03167","created_at":"2026-05-18T01:35:21Z"},{"alias_kind":"pith_short_12","alias_value":"VXJPUS6R2TPZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VXJPUS6R2TPZRGE2","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VXJPUS6R","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:531183a70a5af49a096e1ce541d8b721937a41e0792f65d14bd8cd772e072e9e","target":"graph","created_at":"2026-05-18T01:35:21Z","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":"This article introduces an algorithm, MergeShuffle, which is an extremely efficient algorithm to generate random permutations (or to randomly permute an existing array). It is easy to implement, runs in $n\\log_2 n + O(1)$ time, is in-place, uses $n\\log_2 n + \\Theta(n)$ random bits, and can be parallelized accross any number of processes, in a shared-memory PRAM model. Finally, our preliminary simulations using OpenMP suggest it is more efficient than the Rao-Sandelius algorithm, one of the fastest existing random permutation algorithms.\n  We also show how it is possible to further reduce the n","authors_text":"Alexandros Hollender, Axel Bacher, J\\'er\\'emie Lumbroso, Olivier Bodini","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-13T10:37:54Z","title":"MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03167","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:636b97082aadb29993d6491cb1e63064b5487f70624987ccf6e88d8c9bf76b9e","target":"record","created_at":"2026-05-18T01:35:21Z","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":"7fedb3b21e53a2e3f1638080747c7a11bb36e99a162dcc3105a1361fdbb68d88","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-13T10:37:54Z","title_canon_sha256":"e1cd968917bad10daaf859672a983cff9d733dd6e3af4aeab88825099f874585"},"schema_version":"1.0","source":{"id":"1508.03167","kind":"arxiv","version":1}},"canonical_sha256":"add2fa4bd1d4df98989ac05afbd24b32df24dafd8bf9f86ea96bf31922ededa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"add2fa4bd1d4df98989ac05afbd24b32df24dafd8bf9f86ea96bf31922ededa6","first_computed_at":"2026-05-18T01:35:21.549279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:21.549279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A4N+LtvBYxQ1lDR7YSbwIvrdm7nwVMXl+f1XZg8YIxc6dkF2o0NdxX74vBBkQOhe07/dTiLAjnQtArfz906nAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:21.549965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:636b97082aadb29993d6491cb1e63064b5487f70624987ccf6e88d8c9bf76b9e","sha256:531183a70a5af49a096e1ce541d8b721937a41e0792f65d14bd8cd772e072e9e"],"state_sha256":"7af8759dd5b66e0d79603e85cd7e74ec0a27cbefd82629a7d7c3b5652e14fde9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHZmWEimwf62Ntm7Da4WALsGBcsXjqg4XqhvgdFRS+kMHwgYc4EdURc0R2L287/perRO3pWnu1ZbbTFLxBxfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:24:15.310357Z","bundle_sha256":"d2f233ea5dfef5370330a06b471a2e4e01391c09aeed954c25492e87bf77d55e"}}