{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GLSUAV7XIY2LIVHTWUGXIOIWUX","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":"e75b3936ac308e16b047bcc7f99e139d9d1222162ee3eaefc50363ef1e98001c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-08T01:36:54Z","title_canon_sha256":"6e2a4443c832c9831c13eaa624a4396d01d77c71c726000ccef53d912880846e"},"schema_version":"1.0","source":{"id":"1511.02425","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02425","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02425v2","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02425","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"GLSUAV7XIY2L","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GLSUAV7XIY2LIVHT","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GLSUAV7X","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:c5189a89b24c778fb2671b805bb635b2df219f9b4df981c9049dd6f39516017b","target":"graph","created_at":"2026-05-18T01:13:04Z","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 propose a low complexity antenna selection algorithm for low target rate users in cloud radio access networks. The algorithm consists of two phases: In the first phase, each remote radio head (RRH) determines whether to be included in a candidate set by using a predefined selection threshold. In the second phase, RRHs are randomly selected within the candidate set made in the first phase. To analyze the performance of the proposed algorithm, we model RRHs and users locations by a homogeneous Poisson point process, whereby the signal-to-interference ratio (SIR) complementary cumulative distr","authors_text":"Jeonghun Park, Robert W. Heath Jr","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-08T01:36:54Z","title":"Low Complexity Antenna Selection for Low Target Rate Users in Dense Cloud Radio Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02425","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:6f74db39baef177869834cc5f28bc9b47cc5574bb8756ca0b69d2e1015477721","target":"record","created_at":"2026-05-18T01:13:04Z","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":"e75b3936ac308e16b047bcc7f99e139d9d1222162ee3eaefc50363ef1e98001c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-08T01:36:54Z","title_canon_sha256":"6e2a4443c832c9831c13eaa624a4396d01d77c71c726000ccef53d912880846e"},"schema_version":"1.0","source":{"id":"1511.02425","kind":"arxiv","version":2}},"canonical_sha256":"32e54057f74634b454f3b50d743916a5d91c77f72fc7d2fa059091c6a7ec6b57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32e54057f74634b454f3b50d743916a5d91c77f72fc7d2fa059091c6a7ec6b57","first_computed_at":"2026-05-18T01:13:04.874250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:04.874250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/5v2Mn6PVrAJeOkloseerrAwoDqE7hAFBc84iUZdmhJRNihY0pLZjWsj4kGbmQmlhOUMJO+Pj+Cm2h8ldzTkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:04.874753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02425","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f74db39baef177869834cc5f28bc9b47cc5574bb8756ca0b69d2e1015477721","sha256:c5189a89b24c778fb2671b805bb635b2df219f9b4df981c9049dd6f39516017b"],"state_sha256":"a2c43a6c118ca9c9b1b249f6c3074afbfaf45cc21951ba038214b4c4d2b7efbc"}