{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:O6OR64OCB4NPQFUKYJJ7ZWJG3O","short_pith_number":"pith:O6OR64OC","canonical_record":{"source":{"id":"1901.09901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T00:31:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a21efeb5fc789a82ef33489d74a8e5c00296082454e8cea48849b31ba35a3653","abstract_canon_sha256":"177b5123dceb0728a99906e858323f344afeab2affebb056b1fc7c3202356e6b"},"schema_version":"1.0"},"canonical_sha256":"779d1f71c20f1af8168ac253fcd926dbb816299f9e27773cc8beba5d5d5f1214","source":{"kind":"arxiv","id":"1901.09901","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09901","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09901v2","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09901","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"O6OR64OCB4NP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O6OR64OCB4NPQFUK","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O6OR64OC","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:O6OR64OCB4NPQFUKYJJ7ZWJG3O","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T00:31:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a21efeb5fc789a82ef33489d74a8e5c00296082454e8cea48849b31ba35a3653","abstract_canon_sha256":"177b5123dceb0728a99906e858323f344afeab2affebb056b1fc7c3202356e6b"},"schema_version":"1.0"},"canonical_sha256":"779d1f71c20f1af8168ac253fcd926dbb816299f9e27773cc8beba5d5d5f1214","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:32.862523Z","signature_b64":"ADmO1oRQbL71nJmKa/cIp8jgHMxr8aYanjzazd9QdL+0Lm2xzxwFfAOj2cObTDyHPTtz8Blz/ZIWhvZwwQCgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"779d1f71c20f1af8168ac253fcd926dbb816299f9e27773cc8beba5d5d5f1214","last_reissued_at":"2026-05-17T23:43:32.862140Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:32.862140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09901","source_version":2,"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-17T23:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HoD76Xis+bSHmsynk3/0hWdNoTYScSVRPZBniI78Ac48wQSJ+YC6wmogR0jVjFI2sTHm+omQ3fDOH0/SzEGEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:17:12.562924Z"},"content_sha256":"fcfac2ffe08b74962b6ed142c60eae42d22a5d413e95dfd889653492d58dc847","schema_version":"1.0","event_id":"sha256:fcfac2ffe08b74962b6ed142c60eae42d22a5d413e95dfd889653492d58dc847"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:O6OR64OCB4NPQFUKYJJ7ZWJG3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Performance Analysis of Generalized User Selection for Interference-Limited Multiuser Secondary Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Costas N. Georghiades, Mohamed-Slim Alouini, Yazan H. Al-Badarneh","submitted_at":"2019-01-28T00:31:47Z","abstract_excerpt":"We analyze the asymptotic performance of a generalized multiuser diversity scheme for an interference-limited secondary multiuser network of underlay cognitive radio systems. Assuming a large number of secondary users and that the noise at each secondary user's receiver is negligible compared to the interference from the primary transmitter, the secondary transmitter transmits information to the $k$-th best secondary user, namely, the one with the $k$-th highest signal-to-interference ratio (SIR). We use extreme value theory to show that the $k$-th highest SIR converges uniformly in distributi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09901","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"},"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-17T23:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PT9VO9ARCA4egBHJGHpWjbF7NRinhlqGIMAKrTahmRxSYLX3PCGAi8EOLWHgPBH4YIkhBr6XMOvN3VTvHWMVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:17:12.563572Z"},"content_sha256":"74c188e01de13a101aead7f52b60b41b06cc1ab54a6f902075ff701b73c47482","schema_version":"1.0","event_id":"sha256:74c188e01de13a101aead7f52b60b41b06cc1ab54a6f902075ff701b73c47482"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6OR64OCB4NPQFUKYJJ7ZWJG3O/bundle.json","state_url":"https://pith.science/pith/O6OR64OCB4NPQFUKYJJ7ZWJG3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6OR64OCB4NPQFUKYJJ7ZWJG3O/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-05-30T11:17:12Z","links":{"resolver":"https://pith.science/pith/O6OR64OCB4NPQFUKYJJ7ZWJG3O","bundle":"https://pith.science/pith/O6OR64OCB4NPQFUKYJJ7ZWJG3O/bundle.json","state":"https://pith.science/pith/O6OR64OCB4NPQFUKYJJ7ZWJG3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6OR64OCB4NPQFUKYJJ7ZWJG3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:O6OR64OCB4NPQFUKYJJ7ZWJG3O","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":"177b5123dceb0728a99906e858323f344afeab2affebb056b1fc7c3202356e6b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T00:31:47Z","title_canon_sha256":"a21efeb5fc789a82ef33489d74a8e5c00296082454e8cea48849b31ba35a3653"},"schema_version":"1.0","source":{"id":"1901.09901","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09901","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09901v2","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09901","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"O6OR64OCB4NP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O6OR64OCB4NPQFUK","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O6OR64OC","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:74c188e01de13a101aead7f52b60b41b06cc1ab54a6f902075ff701b73c47482","target":"graph","created_at":"2026-05-17T23:43:32Z","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 analyze the asymptotic performance of a generalized multiuser diversity scheme for an interference-limited secondary multiuser network of underlay cognitive radio systems. Assuming a large number of secondary users and that the noise at each secondary user's receiver is negligible compared to the interference from the primary transmitter, the secondary transmitter transmits information to the $k$-th best secondary user, namely, the one with the $k$-th highest signal-to-interference ratio (SIR). We use extreme value theory to show that the $k$-th highest SIR converges uniformly in distributi","authors_text":"Costas N. Georghiades, Mohamed-Slim Alouini, Yazan H. Al-Badarneh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T00:31:47Z","title":"Asymptotic Performance Analysis of Generalized User Selection for Interference-Limited Multiuser Secondary Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09901","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:fcfac2ffe08b74962b6ed142c60eae42d22a5d413e95dfd889653492d58dc847","target":"record","created_at":"2026-05-17T23:43:32Z","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":"177b5123dceb0728a99906e858323f344afeab2affebb056b1fc7c3202356e6b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T00:31:47Z","title_canon_sha256":"a21efeb5fc789a82ef33489d74a8e5c00296082454e8cea48849b31ba35a3653"},"schema_version":"1.0","source":{"id":"1901.09901","kind":"arxiv","version":2}},"canonical_sha256":"779d1f71c20f1af8168ac253fcd926dbb816299f9e27773cc8beba5d5d5f1214","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"779d1f71c20f1af8168ac253fcd926dbb816299f9e27773cc8beba5d5d5f1214","first_computed_at":"2026-05-17T23:43:32.862140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:32.862140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ADmO1oRQbL71nJmKa/cIp8jgHMxr8aYanjzazd9QdL+0Lm2xzxwFfAOj2cObTDyHPTtz8Blz/ZIWhvZwwQCgAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:32.862523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09901","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcfac2ffe08b74962b6ed142c60eae42d22a5d413e95dfd889653492d58dc847","sha256:74c188e01de13a101aead7f52b60b41b06cc1ab54a6f902075ff701b73c47482"],"state_sha256":"ed0f8d7905093abcd47f3519baaf755779b965f8d40585fc4b6b11262c303f71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6Aapczy5qlJcvXl5ob5ueThUssGBV62ia2UOOvjYqCODDbuW8Ps8h7PnLHN1uFR74ZmqVYSJlQmutNan9KiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:17:12.566800Z","bundle_sha256":"537e2a03614dbd72dc42b2afa7dcb13bd8a6f603463e24cf2a3802c50e52207a"}}