{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:62ESXL6RQ7WG75UTKWN6KU5E4K","short_pith_number":"pith:62ESXL6R","schema_version":"1.0","canonical_sha256":"f6892bafd187ec6ff693559be553a4e289231a6c8fe211345f4149b62aca261b","source":{"kind":"arxiv","id":"1502.03942","version":2},"attestation_state":"computed","paper":{"title":"Communication Efficient Algorithms for Top-k Selection Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Ingo M\\\"uller, Lorenz H\\\"ubschle-Schneider, Peter Sanders","submitted_at":"2015-02-13T11:01:29Z","abstract_excerpt":"We present scalable parallel algorithms with sublinear per-processor communication volume and low latency for several fundamental problems related to finding the most relevant elements in a set, for various notions of relevance: We begin with the classical selection problem with unsorted input. We present generalizations with locally sorted inputs, dynamic content (bulk-parallel priority queues), and multiple criteria. Then we move on to finding frequent objects and top-k sum aggregation. Since it is unavoidable that the output of these algorithms might be unevenly distributed over the process"},"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":"1502.03942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T11:01:29Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0ca823c7528241b94b68994a812055049ece03f021084ee7603314e61f1d3796","abstract_canon_sha256":"0520bc79ed62eb6e3342aa4f16ad771deaec60495470cb6caefd666c930b2f36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:54.576881Z","signature_b64":"7eRwaIQGJRJIekTAqWJvN+gsB9JH1T7M641+5WLDCn7msaV7gpv2R4giIidjvdO0Wr8gP0qCWuf4QQJikhhCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6892bafd187ec6ff693559be553a4e289231a6c8fe211345f4149b62aca261b","last_reissued_at":"2026-05-18T01:29:54.576330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:54.576330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Efficient Algorithms for Top-k Selection Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Ingo M\\\"uller, Lorenz H\\\"ubschle-Schneider, Peter Sanders","submitted_at":"2015-02-13T11:01:29Z","abstract_excerpt":"We present scalable parallel algorithms with sublinear per-processor communication volume and low latency for several fundamental problems related to finding the most relevant elements in a set, for various notions of relevance: We begin with the classical selection problem with unsorted input. We present generalizations with locally sorted inputs, dynamic content (bulk-parallel priority queues), and multiple criteria. Then we move on to finding frequent objects and top-k sum aggregation. Since it is unavoidable that the output of these algorithms might be unevenly distributed over the process"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03942","kind":"arxiv","version":2},"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":"1502.03942","created_at":"2026-05-18T01:29:54.576426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03942v2","created_at":"2026-05-18T01:29:54.576426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03942","created_at":"2026-05-18T01:29:54.576426+00:00"},{"alias_kind":"pith_short_12","alias_value":"62ESXL6RQ7WG","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"62ESXL6RQ7WG75UT","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"62ESXL6R","created_at":"2026-05-18T12:29:07.941421+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/62ESXL6RQ7WG75UTKWN6KU5E4K","json":"https://pith.science/pith/62ESXL6RQ7WG75UTKWN6KU5E4K.json","graph_json":"https://pith.science/api/pith-number/62ESXL6RQ7WG75UTKWN6KU5E4K/graph.json","events_json":"https://pith.science/api/pith-number/62ESXL6RQ7WG75UTKWN6KU5E4K/events.json","paper":"https://pith.science/paper/62ESXL6R"},"agent_actions":{"view_html":"https://pith.science/pith/62ESXL6RQ7WG75UTKWN6KU5E4K","download_json":"https://pith.science/pith/62ESXL6RQ7WG75UTKWN6KU5E4K.json","view_paper":"https://pith.science/paper/62ESXL6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03942&json=true","fetch_graph":"https://pith.science/api/pith-number/62ESXL6RQ7WG75UTKWN6KU5E4K/graph.json","fetch_events":"https://pith.science/api/pith-number/62ESXL6RQ7WG75UTKWN6KU5E4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62ESXL6RQ7WG75UTKWN6KU5E4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62ESXL6RQ7WG75UTKWN6KU5E4K/action/storage_attestation","attest_author":"https://pith.science/pith/62ESXL6RQ7WG75UTKWN6KU5E4K/action/author_attestation","sign_citation":"https://pith.science/pith/62ESXL6RQ7WG75UTKWN6KU5E4K/action/citation_signature","submit_replication":"https://pith.science/pith/62ESXL6RQ7WG75UTKWN6KU5E4K/action/replication_record"}},"created_at":"2026-05-18T01:29:54.576426+00:00","updated_at":"2026-05-18T01:29:54.576426+00:00"}