{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VXJPUS6R2TPZRGE2YBNPXUSLGL","short_pith_number":"pith:VXJPUS6R","schema_version":"1.0","canonical_sha256":"add2fa4bd1d4df98989ac05afbd24b32df24dafd8bf9f86ea96bf31922ededa6","source":{"kind":"arxiv","id":"1508.03167","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.03167","created_at":"2026-05-18T01:35:21.549390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03167v1","created_at":"2026-05-18T01:35:21.549390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03167","created_at":"2026-05-18T01:35:21.549390+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXJPUS6R2TPZ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXJPUS6R2TPZRGE2","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXJPUS6R","created_at":"2026-05-18T12:29:47.479230+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/VXJPUS6R2TPZRGE2YBNPXUSLGL","json":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL.json","graph_json":"https://pith.science/api/pith-number/VXJPUS6R2TPZRGE2YBNPXUSLGL/graph.json","events_json":"https://pith.science/api/pith-number/VXJPUS6R2TPZRGE2YBNPXUSLGL/events.json","paper":"https://pith.science/paper/VXJPUS6R"},"agent_actions":{"view_html":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL","download_json":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL.json","view_paper":"https://pith.science/paper/VXJPUS6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03167&json=true","fetch_graph":"https://pith.science/api/pith-number/VXJPUS6R2TPZRGE2YBNPXUSLGL/graph.json","fetch_events":"https://pith.science/api/pith-number/VXJPUS6R2TPZRGE2YBNPXUSLGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/action/storage_attestation","attest_author":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/action/author_attestation","sign_citation":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/action/citation_signature","submit_replication":"https://pith.science/pith/VXJPUS6R2TPZRGE2YBNPXUSLGL/action/replication_record"}},"created_at":"2026-05-18T01:35:21.549390+00:00","updated_at":"2026-05-18T01:35:21.549390+00:00"}