{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EMPOU5U7H5GHNQ3THDFZF62LCB","short_pith_number":"pith:EMPOU5U7","schema_version":"1.0","canonical_sha256":"231eea769f3f4c76c37338cb92fb4b10642c4f9efacf030d00bf1e7492a9bd17","source":{"kind":"arxiv","id":"1611.05549","version":2},"attestation_state":"computed","paper":{"title":"Parallel multiple selection by regular sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Krzysztof Nowicki","submitted_at":"2016-11-17T03:23:38Z","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"},"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":"1611.05549","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T03:23:38Z","cross_cats_sorted":[],"title_canon_sha256":"20dd51c8c9e0f6943266cc16bde2a898d32d62ccaed910989805f0fdbfe67bde","abstract_canon_sha256":"b8d033cb4efb2a81adb0cdc8c406e6eeafe105945e086f0db07a21803b4f1fdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:43.588607Z","signature_b64":"E/q/vNfR/ASMELRVCycgE/eQg61C5Mc9UPtTel+zZrrF7Wb74dTPQO7c+maVlDGR6w7GnT4QCFxUk8zjgrhsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"231eea769f3f4c76c37338cb92fb4b10642c4f9efacf030d00bf1e7492a9bd17","last_reissued_at":"2026-05-18T00:57:43.588119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:43.588119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel multiple selection by regular sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Krzysztof Nowicki","submitted_at":"2016-11-17T03:23:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05549","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":"1611.05549","created_at":"2026-05-18T00:57:43.588199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05549v2","created_at":"2026-05-18T00:57:43.588199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05549","created_at":"2026-05-18T00:57:43.588199+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMPOU5U7H5GH","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMPOU5U7H5GHNQ3T","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMPOU5U7","created_at":"2026-05-18T12:30:12.583610+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/EMPOU5U7H5GHNQ3THDFZF62LCB","json":"https://pith.science/pith/EMPOU5U7H5GHNQ3THDFZF62LCB.json","graph_json":"https://pith.science/api/pith-number/EMPOU5U7H5GHNQ3THDFZF62LCB/graph.json","events_json":"https://pith.science/api/pith-number/EMPOU5U7H5GHNQ3THDFZF62LCB/events.json","paper":"https://pith.science/paper/EMPOU5U7"},"agent_actions":{"view_html":"https://pith.science/pith/EMPOU5U7H5GHNQ3THDFZF62LCB","download_json":"https://pith.science/pith/EMPOU5U7H5GHNQ3THDFZF62LCB.json","view_paper":"https://pith.science/paper/EMPOU5U7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05549&json=true","fetch_graph":"https://pith.science/api/pith-number/EMPOU5U7H5GHNQ3THDFZF62LCB/graph.json","fetch_events":"https://pith.science/api/pith-number/EMPOU5U7H5GHNQ3THDFZF62LCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMPOU5U7H5GHNQ3THDFZF62LCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMPOU5U7H5GHNQ3THDFZF62LCB/action/storage_attestation","attest_author":"https://pith.science/pith/EMPOU5U7H5GHNQ3THDFZF62LCB/action/author_attestation","sign_citation":"https://pith.science/pith/EMPOU5U7H5GHNQ3THDFZF62LCB/action/citation_signature","submit_replication":"https://pith.science/pith/EMPOU5U7H5GHNQ3THDFZF62LCB/action/replication_record"}},"created_at":"2026-05-18T00:57:43.588199+00:00","updated_at":"2026-05-18T00:57:43.588199+00:00"}