{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NEPMNM5FKZ4VTMM6PJBDWR4GLW","short_pith_number":"pith:NEPMNM5F","canonical_record":{"source":{"id":"1110.4126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T21:18:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"10363a4b46a70d9e0129f0b0cc85d3a86191cf82f8b754e1a1a81811a2ba4e6a","abstract_canon_sha256":"68ad3fd94a0431951a8eeb09896bb4d9dc4516aac6d722a51a4d9f4a905cd051"},"schema_version":"1.0"},"canonical_sha256":"691ec6b3a5567959b19e7a423b47865d93901bd86ad4fe16c59d75543782c423","source":{"kind":"arxiv","id":"1110.4126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4126","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4126v1","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4126","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"NEPMNM5FKZ4V","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NEPMNM5FKZ4VTMM6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NEPMNM5F","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NEPMNM5FKZ4VTMM6PJBDWR4GLW","target":"record","payload":{"canonical_record":{"source":{"id":"1110.4126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T21:18:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"10363a4b46a70d9e0129f0b0cc85d3a86191cf82f8b754e1a1a81811a2ba4e6a","abstract_canon_sha256":"68ad3fd94a0431951a8eeb09896bb4d9dc4516aac6d722a51a4d9f4a905cd051"},"schema_version":"1.0"},"canonical_sha256":"691ec6b3a5567959b19e7a423b47865d93901bd86ad4fe16c59d75543782c423","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:46.687812Z","signature_b64":"Gle+0cA2ZLg3eNFsh/ABILpSC87cYY0ZCItVJVwcvClKpa2ApG0S0ANJqys4umrsGyfdQO1cO/TDYvbCDvfyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691ec6b3a5567959b19e7a423b47865d93901bd86ad4fe16c59d75543782c423","last_reissued_at":"2026-05-18T04:10:46.687323Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:46.687323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.4126","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-18T04:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"515ATWsflXPb7MGv7YNmmuj/9UbXclUOayt8znUeianureskwAFA4QUTnMX51CpQCJtcQsVRAux7PIm8eIabBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T00:46:50.197623Z"},"content_sha256":"e86eaf7194249aaf218f7f7ae102e15bdf21290109b1d6f91b827af3a1e34e1e","schema_version":"1.0","event_id":"sha256:e86eaf7194249aaf218f7f7ae102e15bdf21290109b1d6f91b827af3a1e34e1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NEPMNM5FKZ4VTMM6PJBDWR4GLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relay Selection and Performance Analysis in Multiple-User Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chintha Tellambura, Hai Jiang, Saman Atapattu, Yindi Jing","submitted_at":"2011-10-18T21:18:51Z","abstract_excerpt":"This paper investigates the relay selection (RS) problem in networks with multiple users and multiple common amplify-and-forward (AF) relays. Considering the overall quality-of-service of the network, we first specify our definition of optimal RS for multiple-user relay networks. Then an optimal RS (ORS) algorithm is provided, which is a straightforward extension of an RS scheme in the literature that maximizes the minimum end-to-end receive signal-to-noise ratio (SNR) of all users. The complexity of the ORS is quadratic in both the number of users and the number of relays. Then a suboptimal R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4126","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-18T04:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zINRVlrxjJlKPp0AYv8+4Q12YbMlPp2ba2N3pqUKKW96KI5e1iSeOsA2slPWaM6u4539lNpC8mtHhHsicBHeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T00:46:50.197962Z"},"content_sha256":"f8b1526556d5c71eb2ac42d78b30b1584e8f3554bf8372099f6fdc1c44d31488","schema_version":"1.0","event_id":"sha256:f8b1526556d5c71eb2ac42d78b30b1584e8f3554bf8372099f6fdc1c44d31488"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEPMNM5FKZ4VTMM6PJBDWR4GLW/bundle.json","state_url":"https://pith.science/pith/NEPMNM5FKZ4VTMM6PJBDWR4GLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEPMNM5FKZ4VTMM6PJBDWR4GLW/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-20T00:46:50Z","links":{"resolver":"https://pith.science/pith/NEPMNM5FKZ4VTMM6PJBDWR4GLW","bundle":"https://pith.science/pith/NEPMNM5FKZ4VTMM6PJBDWR4GLW/bundle.json","state":"https://pith.science/pith/NEPMNM5FKZ4VTMM6PJBDWR4GLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEPMNM5FKZ4VTMM6PJBDWR4GLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NEPMNM5FKZ4VTMM6PJBDWR4GLW","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":"68ad3fd94a0431951a8eeb09896bb4d9dc4516aac6d722a51a4d9f4a905cd051","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T21:18:51Z","title_canon_sha256":"10363a4b46a70d9e0129f0b0cc85d3a86191cf82f8b754e1a1a81811a2ba4e6a"},"schema_version":"1.0","source":{"id":"1110.4126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4126","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4126v1","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4126","created_at":"2026-05-18T04:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"NEPMNM5FKZ4V","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NEPMNM5FKZ4VTMM6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NEPMNM5F","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:f8b1526556d5c71eb2ac42d78b30b1584e8f3554bf8372099f6fdc1c44d31488","target":"graph","created_at":"2026-05-18T04:10:46Z","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":"This paper investigates the relay selection (RS) problem in networks with multiple users and multiple common amplify-and-forward (AF) relays. Considering the overall quality-of-service of the network, we first specify our definition of optimal RS for multiple-user relay networks. Then an optimal RS (ORS) algorithm is provided, which is a straightforward extension of an RS scheme in the literature that maximizes the minimum end-to-end receive signal-to-noise ratio (SNR) of all users. The complexity of the ORS is quadratic in both the number of users and the number of relays. Then a suboptimal R","authors_text":"Chintha Tellambura, Hai Jiang, Saman Atapattu, Yindi Jing","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T21:18:51Z","title":"Relay Selection and Performance Analysis in Multiple-User Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4126","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:e86eaf7194249aaf218f7f7ae102e15bdf21290109b1d6f91b827af3a1e34e1e","target":"record","created_at":"2026-05-18T04:10:46Z","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":"68ad3fd94a0431951a8eeb09896bb4d9dc4516aac6d722a51a4d9f4a905cd051","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-18T21:18:51Z","title_canon_sha256":"10363a4b46a70d9e0129f0b0cc85d3a86191cf82f8b754e1a1a81811a2ba4e6a"},"schema_version":"1.0","source":{"id":"1110.4126","kind":"arxiv","version":1}},"canonical_sha256":"691ec6b3a5567959b19e7a423b47865d93901bd86ad4fe16c59d75543782c423","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"691ec6b3a5567959b19e7a423b47865d93901bd86ad4fe16c59d75543782c423","first_computed_at":"2026-05-18T04:10:46.687323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:46.687323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gle+0cA2ZLg3eNFsh/ABILpSC87cYY0ZCItVJVwcvClKpa2ApG0S0ANJqys4umrsGyfdQO1cO/TDYvbCDvfyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:46.687812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e86eaf7194249aaf218f7f7ae102e15bdf21290109b1d6f91b827af3a1e34e1e","sha256:f8b1526556d5c71eb2ac42d78b30b1584e8f3554bf8372099f6fdc1c44d31488"],"state_sha256":"a536f4382d36ac7e39392671044df1531e2c79f7d81d929643c257bac34e2639"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Roq4OGJwGcf4udHbqiqLqMDJWEs+RiQxn64IrZS6utLBgMIygN9wpVVaRnqi+9g8qtjP4FnTRl1pPVwsRrJPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T00:46:50.199800Z","bundle_sha256":"72459be3d4740ba7f1b36231558137981da76bcf4bf80b728c812ec86f4951c8"}}