{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DOUGSPFOZWHOADXY23TACETGZ3","short_pith_number":"pith:DOUGSPFO","schema_version":"1.0","canonical_sha256":"1ba8693caecd8ee00ef8d6e6011266ceec8a120f6fbe69a7aba495d9c0e14dc9","source":{"kind":"arxiv","id":"2502.05082","version":1},"attestation_state":"computed","paper":{"title":"A Randomised Approach to Distributed Sorting","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC","cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Sam Olesker-Taylor","submitted_at":"2025-02-07T16:57:48Z","abstract_excerpt":"We introduce and analyse a new, extremely simple, randomised sorting algorithm:\n  - choose a pair of indices $\\{i, j\\}$ according to some distribution $q$;\n  - sort the elements in positions $i$ and $j$ of the array in ascending order.\n  Choosing $q_{\\{i,j\\}} \\propto 1/|j - i|$ yields an order-$n (\\log n)^2$ sorting time. We call it the harmonic sorter.\n  The sorter trivially parallelises in the asynchronous setting, yielding a linear speed-up. We also exhibit a low-communication, synchronous version with a linear speed-up.\n  We compare and contrast this algorithm with other sorters, and discu"},"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":"2502.05082","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-07T16:57:48Z","cross_cats_sorted":["cs.DC","cs.DM","math.PR"],"title_canon_sha256":"44953c3b78a72fa4ea098bc493e0d864d79c16d6224f4f3cc4561a7da7a76207","abstract_canon_sha256":"2b1ba16ae46d0a617fc78fc6b2250d5e841000970177380430c564ab7a7421cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:02.934278Z","signature_b64":"va0oeX1+fhw/e1JAi0PQtbC7H11oJp9/TVDgvT2kA39QzvjCxGOgMaTfUGH1XoCfp9BKTFdtZgp18g3fucOoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba8693caecd8ee00ef8d6e6011266ceec8a120f6fbe69a7aba495d9c0e14dc9","last_reissued_at":"2026-07-05T10:11:02.933741Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:02.933741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Randomised Approach to Distributed Sorting","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC","cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Sam Olesker-Taylor","submitted_at":"2025-02-07T16:57:48Z","abstract_excerpt":"We introduce and analyse a new, extremely simple, randomised sorting algorithm:\n  - choose a pair of indices $\\{i, j\\}$ according to some distribution $q$;\n  - sort the elements in positions $i$ and $j$ of the array in ascending order.\n  Choosing $q_{\\{i,j\\}} \\propto 1/|j - i|$ yields an order-$n (\\log n)^2$ sorting time. We call it the harmonic sorter.\n  The sorter trivially parallelises in the asynchronous setting, yielding a linear speed-up. We also exhibit a low-communication, synchronous version with a linear speed-up.\n  We compare and contrast this algorithm with other sorters, and discu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05082","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.05082/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.05082","created_at":"2026-07-05T10:11:02.933802+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05082v1","created_at":"2026-07-05T10:11:02.933802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05082","created_at":"2026-07-05T10:11:02.933802+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOUGSPFOZWHO","created_at":"2026-07-05T10:11:02.933802+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOUGSPFOZWHOADXY","created_at":"2026-07-05T10:11:02.933802+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOUGSPFO","created_at":"2026-07-05T10:11:02.933802+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/DOUGSPFOZWHOADXY23TACETGZ3","json":"https://pith.science/pith/DOUGSPFOZWHOADXY23TACETGZ3.json","graph_json":"https://pith.science/api/pith-number/DOUGSPFOZWHOADXY23TACETGZ3/graph.json","events_json":"https://pith.science/api/pith-number/DOUGSPFOZWHOADXY23TACETGZ3/events.json","paper":"https://pith.science/paper/DOUGSPFO"},"agent_actions":{"view_html":"https://pith.science/pith/DOUGSPFOZWHOADXY23TACETGZ3","download_json":"https://pith.science/pith/DOUGSPFOZWHOADXY23TACETGZ3.json","view_paper":"https://pith.science/paper/DOUGSPFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05082&json=true","fetch_graph":"https://pith.science/api/pith-number/DOUGSPFOZWHOADXY23TACETGZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/DOUGSPFOZWHOADXY23TACETGZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOUGSPFOZWHOADXY23TACETGZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOUGSPFOZWHOADXY23TACETGZ3/action/storage_attestation","attest_author":"https://pith.science/pith/DOUGSPFOZWHOADXY23TACETGZ3/action/author_attestation","sign_citation":"https://pith.science/pith/DOUGSPFOZWHOADXY23TACETGZ3/action/citation_signature","submit_replication":"https://pith.science/pith/DOUGSPFOZWHOADXY23TACETGZ3/action/replication_record"}},"created_at":"2026-07-05T10:11:02.933802+00:00","updated_at":"2026-07-05T10:11:02.933802+00:00"}