{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:62ESXL6RQ7WG75UTKWN6KU5E4K","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":"0520bc79ed62eb6e3342aa4f16ad771deaec60495470cb6caefd666c930b2f36","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T11:01:29Z","title_canon_sha256":"0ca823c7528241b94b68994a812055049ece03f021084ee7603314e61f1d3796"},"schema_version":"1.0","source":{"id":"1502.03942","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03942","created_at":"2026-05-18T01:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03942v2","created_at":"2026-05-18T01:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03942","created_at":"2026-05-18T01:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"62ESXL6RQ7WG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"62ESXL6RQ7WG75UT","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"62ESXL6R","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:1ad64e13f4568bedb34b1de1f203df91885b198c7d421a93ce78503fbd850b3d","target":"graph","created_at":"2026-05-18T01:29:54Z","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":"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","authors_text":"Ingo M\\\"uller, Lorenz H\\\"ubschle-Schneider, Peter Sanders","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T11:01:29Z","title":"Communication Efficient Algorithms for Top-k Selection Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03942","kind":"arxiv","version":2},"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:f3f9c42c468e4091d0a13bf1aeb307d17ec423cf7793cfed7920c3855362b7a2","target":"record","created_at":"2026-05-18T01:29:54Z","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":"0520bc79ed62eb6e3342aa4f16ad771deaec60495470cb6caefd666c930b2f36","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T11:01:29Z","title_canon_sha256":"0ca823c7528241b94b68994a812055049ece03f021084ee7603314e61f1d3796"},"schema_version":"1.0","source":{"id":"1502.03942","kind":"arxiv","version":2}},"canonical_sha256":"f6892bafd187ec6ff693559be553a4e289231a6c8fe211345f4149b62aca261b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6892bafd187ec6ff693559be553a4e289231a6c8fe211345f4149b62aca261b","first_computed_at":"2026-05-18T01:29:54.576330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:54.576330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7eRwaIQGJRJIekTAqWJvN+gsB9JH1T7M641+5WLDCn7msaV7gpv2R4giIidjvdO0Wr8gP0qCWuf4QQJikhhCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:54.576881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03942","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3f9c42c468e4091d0a13bf1aeb307d17ec423cf7793cfed7920c3855362b7a2","sha256:1ad64e13f4568bedb34b1de1f203df91885b198c7d421a93ce78503fbd850b3d"],"state_sha256":"602e875eacae5513987614210ae58393cc90d8360ac590b78c8decc6747f24c2"}