{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:RXYJCE6TF5TO5R4BQTZCNQMS32","short_pith_number":"pith:RXYJCE6T","canonical_record":{"source":{"id":"0911.4357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-11-23T11:20:27Z","cross_cats_sorted":[],"title_canon_sha256":"ebfb9b2e51a31f4e024af75a83a9fbcb47df06ffb036d1d428d13d83084f83c3","abstract_canon_sha256":"0108324de12f9e2be6f9ec3623a4f79a0ede5606c9d7497ce0335e39ebe24025"},"schema_version":"1.0"},"canonical_sha256":"8df09113d32f66eec78184f226c192de931a1467aa17e5d45eacd6fd66089bc2","source":{"kind":"arxiv","id":"0911.4357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4357","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4357v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4357","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"RXYJCE6TF5TO","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RXYJCE6TF5TO5R4B","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RXYJCE6T","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:RXYJCE6TF5TO5R4BQTZCNQMS32","target":"record","payload":{"canonical_record":{"source":{"id":"0911.4357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-11-23T11:20:27Z","cross_cats_sorted":[],"title_canon_sha256":"ebfb9b2e51a31f4e024af75a83a9fbcb47df06ffb036d1d428d13d83084f83c3","abstract_canon_sha256":"0108324de12f9e2be6f9ec3623a4f79a0ede5606c9d7497ce0335e39ebe24025"},"schema_version":"1.0"},"canonical_sha256":"8df09113d32f66eec78184f226c192de931a1467aa17e5d45eacd6fd66089bc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.876790Z","signature_b64":"9HZVstvI6deSBm1zOnpF+PUu4N8k+ucghhj48rWnAHBB+gHR8HT/9RVq9bJZJ4gzigkbm5OmwHYNXHIM8bc5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8df09113d32f66eec78184f226c192de931a1467aa17e5d45eacd6fd66089bc2","last_reissued_at":"2026-05-18T00:58:19.876043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.876043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.4357","source_version":1,"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:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TNNvY0ClAYyO1twlaWWXw3zQnS+9JE/2a1F2bGdf+WL+0PFxuGqMlQBjPj8KJH4fuy/wNgNFVMwtkiSN7TLyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T00:51:18.850188Z"},"content_sha256":"172ab09989231724f8961ce680f65734666043cfc5b5603e838c2ef164f51537","schema_version":"1.0","event_id":"sha256:172ab09989231724f8961ce680f65734666043cfc5b5603e838c2ef164f51537"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:RXYJCE6TF5TO5R4BQTZCNQMS32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Neelesh B. Mehta, Raymond Yim, Virag Shah","submitted_at":"2009-11-23T11:20:27Z","abstract_excerpt":"Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introdu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4357","kind":"arxiv","version":1},"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:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUZx2ycmxUv9yuNWDjBBwKnabzMAl1GL3FNNfLdlmFtpC3fSCIoAkJItp6bVspAvqJYzGLpO43cj8DzuUO8YAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T00:51:18.850549Z"},"content_sha256":"48dc0391e80c6a4c83c3f8df8c6fec30cc7ae12d8c57a42d5f81c1c6d8965045","schema_version":"1.0","event_id":"sha256:48dc0391e80c6a4c83c3f8df8c6fec30cc7ae12d8c57a42d5f81c1c6d8965045"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXYJCE6TF5TO5R4BQTZCNQMS32/bundle.json","state_url":"https://pith.science/pith/RXYJCE6TF5TO5R4BQTZCNQMS32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXYJCE6TF5TO5R4BQTZCNQMS32/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-29T00:51:18Z","links":{"resolver":"https://pith.science/pith/RXYJCE6TF5TO5R4BQTZCNQMS32","bundle":"https://pith.science/pith/RXYJCE6TF5TO5R4BQTZCNQMS32/bundle.json","state":"https://pith.science/pith/RXYJCE6TF5TO5R4BQTZCNQMS32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXYJCE6TF5TO5R4BQTZCNQMS32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:RXYJCE6TF5TO5R4BQTZCNQMS32","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":"0108324de12f9e2be6f9ec3623a4f79a0ede5606c9d7497ce0335e39ebe24025","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-11-23T11:20:27Z","title_canon_sha256":"ebfb9b2e51a31f4e024af75a83a9fbcb47df06ffb036d1d428d13d83084f83c3"},"schema_version":"1.0","source":{"id":"0911.4357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4357","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4357v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4357","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"RXYJCE6TF5TO","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RXYJCE6TF5TO5R4B","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RXYJCE6T","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:48dc0391e80c6a4c83c3f8df8c6fec30cc7ae12d8c57a42d5f81c1c6d8965045","target":"graph","created_at":"2026-05-18T00:58: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":"Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introdu","authors_text":"Neelesh B. Mehta, Raymond Yim, Virag Shah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-11-23T11:20:27Z","title":"Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4357","kind":"arxiv","version":1},"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:172ab09989231724f8961ce680f65734666043cfc5b5603e838c2ef164f51537","target":"record","created_at":"2026-05-18T00:58: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":"0108324de12f9e2be6f9ec3623a4f79a0ede5606c9d7497ce0335e39ebe24025","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-11-23T11:20:27Z","title_canon_sha256":"ebfb9b2e51a31f4e024af75a83a9fbcb47df06ffb036d1d428d13d83084f83c3"},"schema_version":"1.0","source":{"id":"0911.4357","kind":"arxiv","version":1}},"canonical_sha256":"8df09113d32f66eec78184f226c192de931a1467aa17e5d45eacd6fd66089bc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8df09113d32f66eec78184f226c192de931a1467aa17e5d45eacd6fd66089bc2","first_computed_at":"2026-05-18T00:58:19.876043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.876043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9HZVstvI6deSBm1zOnpF+PUu4N8k+ucghhj48rWnAHBB+gHR8HT/9RVq9bJZJ4gzigkbm5OmwHYNXHIM8bc5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.876790Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:172ab09989231724f8961ce680f65734666043cfc5b5603e838c2ef164f51537","sha256:48dc0391e80c6a4c83c3f8df8c6fec30cc7ae12d8c57a42d5f81c1c6d8965045"],"state_sha256":"b7343814e09e5276f27407e7e651428d513675a9b10cd31882c3bdd3c27e5b6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DiBo4zSZfGoKArv+s5QcWqehDvQ0FKTx/4qIlP8hlv5l97OkhDz+EQXVQRKQlTVaTsrmWjXHcUeKPykKvOLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T00:51:18.852535Z","bundle_sha256":"239a30b7186e32ea4f44594c195e684aade594ca6991533208f56a9b6ca1ffeb"}}