{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:73IFZW4776NTB5KJ4ZSRPHVZSP","short_pith_number":"pith:73IFZW47","schema_version":"1.0","canonical_sha256":"fed05cdb9fff9b30f549e665179eb993c79c9ff9e0d3352d9b48c89f7614f0cf","source":{"kind":"arxiv","id":"1511.00715","version":4},"attestation_state":"computed","paper":{"title":"Distributed Selection in $O ( \\log n )$ Time with $O ( n \\log \\log n )$ Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junichiro Fukuyama, Piotr Berman","submitted_at":"2015-11-02T21:30:12Z","abstract_excerpt":"We consider the selection problem on a completely connected network of $n$ processors with no shared memory. Each processor initially holds a given numeric item of $b$ bits allowed to send a message of $\\max ( b, \\lg n )$ bits to another processor at a time. On such a communication network ${\\cal G}$, we show that the $k$th smallest of the $n$ inputs can be detected in $O ( \\log n )$ time with $O ( n \\log \\log n )$ messages. The possibility of such a parallel algorithm for this distributed $k$-selection problem has been unknown despite the intensive investigation on many variations of the sele"},"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":"1511.00715","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-02T21:30:12Z","cross_cats_sorted":[],"title_canon_sha256":"475f33dd51ac7ccc5a3db179684528c850b7c9202c1621a243a0aedc023f5ecf","abstract_canon_sha256":"5b4f7d561b8a214d82eb177dfc516376b303aee1ac627eeba740bd43917e9f03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:19.134742Z","signature_b64":"KQkA6oTILwjeKBDP7A8Sr3l00JrAD9Zbvu/ZZELIEaP1JX45hIX6/zZM/uoD3urgNYtb5GrVbceYZwTOgUPiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fed05cdb9fff9b30f549e665179eb993c79c9ff9e0d3352d9b48c89f7614f0cf","last_reissued_at":"2026-05-18T00:28:19.134036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:19.134036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Selection in $O ( \\log n )$ Time with $O ( n \\log \\log n )$ Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junichiro Fukuyama, Piotr Berman","submitted_at":"2015-11-02T21:30:12Z","abstract_excerpt":"We consider the selection problem on a completely connected network of $n$ processors with no shared memory. Each processor initially holds a given numeric item of $b$ bits allowed to send a message of $\\max ( b, \\lg n )$ bits to another processor at a time. On such a communication network ${\\cal G}$, we show that the $k$th smallest of the $n$ inputs can be detected in $O ( \\log n )$ time with $O ( n \\log \\log n )$ messages. The possibility of such a parallel algorithm for this distributed $k$-selection problem has been unknown despite the intensive investigation on many variations of the sele"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00715","kind":"arxiv","version":4},"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":"1511.00715","created_at":"2026-05-18T00:28:19.134133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00715v4","created_at":"2026-05-18T00:28:19.134133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00715","created_at":"2026-05-18T00:28:19.134133+00:00"},{"alias_kind":"pith_short_12","alias_value":"73IFZW4776NT","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"73IFZW4776NTB5KJ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"73IFZW47","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/73IFZW4776NTB5KJ4ZSRPHVZSP","json":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP.json","graph_json":"https://pith.science/api/pith-number/73IFZW4776NTB5KJ4ZSRPHVZSP/graph.json","events_json":"https://pith.science/api/pith-number/73IFZW4776NTB5KJ4ZSRPHVZSP/events.json","paper":"https://pith.science/paper/73IFZW47"},"agent_actions":{"view_html":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP","download_json":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP.json","view_paper":"https://pith.science/paper/73IFZW47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00715&json=true","fetch_graph":"https://pith.science/api/pith-number/73IFZW4776NTB5KJ4ZSRPHVZSP/graph.json","fetch_events":"https://pith.science/api/pith-number/73IFZW4776NTB5KJ4ZSRPHVZSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/action/storage_attestation","attest_author":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/action/author_attestation","sign_citation":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/action/citation_signature","submit_replication":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/action/replication_record"}},"created_at":"2026-05-18T00:28:19.134133+00:00","updated_at":"2026-05-18T00:28:19.134133+00:00"}