{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EMPOU5U7H5GHNQ3THDFZF62LCB","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":"b8d033cb4efb2a81adb0cdc8c406e6eeafe105945e086f0db07a21803b4f1fdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T03:23:38Z","title_canon_sha256":"20dd51c8c9e0f6943266cc16bde2a898d32d62ccaed910989805f0fdbfe67bde"},"schema_version":"1.0","source":{"id":"1611.05549","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05549","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05549v2","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05549","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"EMPOU5U7H5GH","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EMPOU5U7H5GHNQ3T","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EMPOU5U7","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:35795dfb9b59844392431945ccd7a21bd2a3038a4dd9f0e533dc56a2109724a4","target":"graph","created_at":"2026-05-18T00:57:43Z","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":"In this paper we present a deterministic parallel algorithm solving the multiple selection problem in congested clique model. In this problem for given set of elements S and a set of ranks $K = \\{k_1 , k_2 , ..., k_r \\}$ we are asking for the $k_i$-th smallest element of $S$ for $1 \\leq i \\leq r$. The presented algorithm is deterministic, time optimal , and needs $O(\\log^*_{r+1} (n))$ communication rounds, where $n$ is the size of the input set, and $r$ is the size of the rank set. This algorithm may be of theoretical interest, as for $r = 1$ (classic selection problem) it gives an improvement","authors_text":"Krzysztof Nowicki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T03:23:38Z","title":"Parallel multiple selection by regular sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05549","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:343a35bf533cd57f7c41a8b8931bdd707c2ee49564283b06e24f4d033fecdbb0","target":"record","created_at":"2026-05-18T00:57:43Z","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":"b8d033cb4efb2a81adb0cdc8c406e6eeafe105945e086f0db07a21803b4f1fdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T03:23:38Z","title_canon_sha256":"20dd51c8c9e0f6943266cc16bde2a898d32d62ccaed910989805f0fdbfe67bde"},"schema_version":"1.0","source":{"id":"1611.05549","kind":"arxiv","version":2}},"canonical_sha256":"231eea769f3f4c76c37338cb92fb4b10642c4f9efacf030d00bf1e7492a9bd17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"231eea769f3f4c76c37338cb92fb4b10642c4f9efacf030d00bf1e7492a9bd17","first_computed_at":"2026-05-18T00:57:43.588119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:43.588119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E/q/vNfR/ASMELRVCycgE/eQg61C5Mc9UPtTel+zZrrF7Wb74dTPQO7c+maVlDGR6w7GnT4QCFxUk8zjgrhsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:43.588607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05549","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:343a35bf533cd57f7c41a8b8931bdd707c2ee49564283b06e24f4d033fecdbb0","sha256:35795dfb9b59844392431945ccd7a21bd2a3038a4dd9f0e533dc56a2109724a4"],"state_sha256":"d16c4fd6181d508ed0555c0c49ae21b24e1de111597b457827f257e1e20d00a2"}