{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:73IFZW4776NTB5KJ4ZSRPHVZSP","short_pith_number":"pith:73IFZW47","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"},"canonical_sha256":"fed05cdb9fff9b30f549e665179eb993c79c9ff9e0d3352d9b48c89f7614f0cf","source":{"kind":"arxiv","id":"1511.00715","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00715","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00715v4","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00715","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"73IFZW4776NT","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"73IFZW4776NTB5KJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"73IFZW47","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:73IFZW4776NTB5KJ4ZSRPHVZSP","target":"record","payload":{"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"},"canonical_sha256":"fed05cdb9fff9b30f549e665179eb993c79c9ff9e0d3352d9b48c89f7614f0cf","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"},"source_kind":"arxiv","source_id":"1511.00715","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNmu/pwgYkiyQiaILFQBFiDEjfjFMhxVSV79b6vEx5Ap1+Ws1gjex3OolGfhuewT5acd7hBrKtxATKC9YjV3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:11:16.591470Z"},"content_sha256":"28d988e7ac58d55eefa6bc82852f01615a021ea4fe7efa7e25af5ef3262248ed","schema_version":"1.0","event_id":"sha256:28d988e7ac58d55eefa6bc82852f01615a021ea4fe7efa7e25af5ef3262248ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:73IFZW4776NTB5KJ4ZSRPHVZSP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrlNyJnoiMlc09wZcOGUFvHjThG6DYg/3QZNxtMR0wgGWpCMsNqgZHLEBpClBNIi0Xbfx4t3/7wNOioUxzG1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:11:16.592216Z"},"content_sha256":"3cc3c0f07bdff616d57e727b8ebc337295421ab323c15e6a2d341de1e125a9f1","schema_version":"1.0","event_id":"sha256:3cc3c0f07bdff616d57e727b8ebc337295421ab323c15e6a2d341de1e125a9f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/bundle.json","state_url":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T04:11:16Z","links":{"resolver":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP","bundle":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/bundle.json","state":"https://pith.science/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73IFZW4776NTB5KJ4ZSRPHVZSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:73IFZW4776NTB5KJ4ZSRPHVZSP","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":"5b4f7d561b8a214d82eb177dfc516376b303aee1ac627eeba740bd43917e9f03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-02T21:30:12Z","title_canon_sha256":"475f33dd51ac7ccc5a3db179684528c850b7c9202c1621a243a0aedc023f5ecf"},"schema_version":"1.0","source":{"id":"1511.00715","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00715","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00715v4","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00715","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"73IFZW4776NT","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"73IFZW4776NTB5KJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"73IFZW47","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:3cc3c0f07bdff616d57e727b8ebc337295421ab323c15e6a2d341de1e125a9f1","target":"graph","created_at":"2026-05-18T00:28:19Z","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 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","authors_text":"Junichiro Fukuyama, Piotr Berman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-02T21:30:12Z","title":"Distributed Selection in $O ( \\log n )$ Time with $O ( n \\log \\log n )$ Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00715","kind":"arxiv","version":4},"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:28d988e7ac58d55eefa6bc82852f01615a021ea4fe7efa7e25af5ef3262248ed","target":"record","created_at":"2026-05-18T00:28:19Z","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":"5b4f7d561b8a214d82eb177dfc516376b303aee1ac627eeba740bd43917e9f03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-02T21:30:12Z","title_canon_sha256":"475f33dd51ac7ccc5a3db179684528c850b7c9202c1621a243a0aedc023f5ecf"},"schema_version":"1.0","source":{"id":"1511.00715","kind":"arxiv","version":4}},"canonical_sha256":"fed05cdb9fff9b30f549e665179eb993c79c9ff9e0d3352d9b48c89f7614f0cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fed05cdb9fff9b30f549e665179eb993c79c9ff9e0d3352d9b48c89f7614f0cf","first_computed_at":"2026-05-18T00:28:19.134036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:19.134036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KQkA6oTILwjeKBDP7A8Sr3l00JrAD9Zbvu/ZZELIEaP1JX45hIX6/zZM/uoD3urgNYtb5GrVbceYZwTOgUPiBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:19.134742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.00715","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28d988e7ac58d55eefa6bc82852f01615a021ea4fe7efa7e25af5ef3262248ed","sha256:3cc3c0f07bdff616d57e727b8ebc337295421ab323c15e6a2d341de1e125a9f1"],"state_sha256":"76e49004a1faa64d659c06c1ef9cef41db511428ebd3cd8dd0a20eb7751ea7ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyrU9j+UFddLrcsmS+LCdpu0FjnRBs8t8lbfGua/0oi6cPOX2oPEqUw9XJQJW2Dtmf+CHNKOc2nP3j4t8MizDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:11:16.596498Z","bundle_sha256":"edeed8ba2c55085fe857eaaf9918be2ceabe7ce4bb0d4d34a95d658b04573672"}}