{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5GFG7LQ3PEVBSQRCCKJG5354JG","short_pith_number":"pith:5GFG7LQ3","canonical_record":{"source":{"id":"1211.5931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-26T12:31:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e59f03c32ffc1e729d84842b6dccad073ad2ec92a880af2cbb9a8010c035b6cc","abstract_canon_sha256":"a86d540ec909b46a18edd088bc7a06063bb6cc0a23c26668141a4296212e5038"},"schema_version":"1.0"},"canonical_sha256":"e98a6fae1b792a19422212926eefbc49b0b251958f78f5c0b65f0acd7f02963c","source":{"kind":"arxiv","id":"1211.5931","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5931","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5931v2","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5931","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"5GFG7LQ3PEVB","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5GFG7LQ3PEVBSQRC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5GFG7LQ3","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5GFG7LQ3PEVBSQRCCKJG5354JG","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-26T12:31:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e59f03c32ffc1e729d84842b6dccad073ad2ec92a880af2cbb9a8010c035b6cc","abstract_canon_sha256":"a86d540ec909b46a18edd088bc7a06063bb6cc0a23c26668141a4296212e5038"},"schema_version":"1.0"},"canonical_sha256":"e98a6fae1b792a19422212926eefbc49b0b251958f78f5c0b65f0acd7f02963c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:22.930774Z","signature_b64":"F8Kmx0gP+UHs+dz4+7OEMgzbXlZeu7UYe5y12YU55dDcOo6JSn+ZaJzYepO2e1vYUQxHBgAM3gEfANipf19nBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e98a6fae1b792a19422212926eefbc49b0b251958f78f5c0b65f0acd7f02963c","last_reissued_at":"2026-05-18T03:38:22.930326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:22.930326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5931","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-18T03:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XK8hP8YGSjv1g/Ljl79ZWCvlgQW4oEMQUWYp99RbgFPK7mG6FDpahl/vTGqWI2KtS27zeGwk+rCZz3fejcCVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:02:14.137542Z"},"content_sha256":"b9c55832d56de4803e8f98fed9fe511a11ec5b43add6a97460876829481bc5f2","schema_version":"1.0","event_id":"sha256:b9c55832d56de4803e8f98fed9fe511a11ec5b43add6a97460876829481bc5f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5GFG7LQ3PEVBSQRCCKJG5354JG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power Allocation Strategies for Fixed-Gain Half-Duplex Amplify-and-Forward Relaying in Nakagami-m Fading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ammar Zafar, Mohamed-Slim Alouini, Redha M. Radaydeh, Yunfei Chen","submitted_at":"2012-11-26T12:31:47Z","abstract_excerpt":"In this paper, we study power allocation strategies for a fixed-gain amplify-and-forward relay network employing multiple relays. We consider two optimization problems for the relay network: 1) optimal power allocation to maximize the end-to-end signal-to-noise ratio (SNR) and 2) minimizing the total consumed power while maintaining the end-to-end SNR over a threshold value. We investigate these two problems for two relaying protocols of all-participate relaying and selective relaying and multiple cases of available channel state information (CSI) at the relays. We show that the SNR maximizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5931","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-18T03:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGucRRMAxDqd5gCUqfs6AcJft7GwSY6oQlb3Kwjw+uWHMDM2ySrM2VtFD56OQX6YPe7NedaP4wxP/Owp3rwbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:02:14.138215Z"},"content_sha256":"6ac27d5d6cbe4f42bb88a58ee1d91b8f2acf17dd013f19c65d0a3f042b1b25bb","schema_version":"1.0","event_id":"sha256:6ac27d5d6cbe4f42bb88a58ee1d91b8f2acf17dd013f19c65d0a3f042b1b25bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GFG7LQ3PEVBSQRCCKJG5354JG/bundle.json","state_url":"https://pith.science/pith/5GFG7LQ3PEVBSQRCCKJG5354JG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GFG7LQ3PEVBSQRCCKJG5354JG/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-26T08:02:14Z","links":{"resolver":"https://pith.science/pith/5GFG7LQ3PEVBSQRCCKJG5354JG","bundle":"https://pith.science/pith/5GFG7LQ3PEVBSQRCCKJG5354JG/bundle.json","state":"https://pith.science/pith/5GFG7LQ3PEVBSQRCCKJG5354JG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GFG7LQ3PEVBSQRCCKJG5354JG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5GFG7LQ3PEVBSQRCCKJG5354JG","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":"a86d540ec909b46a18edd088bc7a06063bb6cc0a23c26668141a4296212e5038","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-26T12:31:47Z","title_canon_sha256":"e59f03c32ffc1e729d84842b6dccad073ad2ec92a880af2cbb9a8010c035b6cc"},"schema_version":"1.0","source":{"id":"1211.5931","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5931","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5931v2","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5931","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"5GFG7LQ3PEVB","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5GFG7LQ3PEVBSQRC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5GFG7LQ3","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:6ac27d5d6cbe4f42bb88a58ee1d91b8f2acf17dd013f19c65d0a3f042b1b25bb","target":"graph","created_at":"2026-05-18T03:38:22Z","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":"In this paper, we study power allocation strategies for a fixed-gain amplify-and-forward relay network employing multiple relays. We consider two optimization problems for the relay network: 1) optimal power allocation to maximize the end-to-end signal-to-noise ratio (SNR) and 2) minimizing the total consumed power while maintaining the end-to-end SNR over a threshold value. We investigate these two problems for two relaying protocols of all-participate relaying and selective relaying and multiple cases of available channel state information (CSI) at the relays. We show that the SNR maximizati","authors_text":"Ammar Zafar, Mohamed-Slim Alouini, Redha M. Radaydeh, Yunfei Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-26T12:31:47Z","title":"Power Allocation Strategies for Fixed-Gain Half-Duplex Amplify-and-Forward Relaying in Nakagami-m Fading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5931","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:b9c55832d56de4803e8f98fed9fe511a11ec5b43add6a97460876829481bc5f2","target":"record","created_at":"2026-05-18T03:38:22Z","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":"a86d540ec909b46a18edd088bc7a06063bb6cc0a23c26668141a4296212e5038","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-26T12:31:47Z","title_canon_sha256":"e59f03c32ffc1e729d84842b6dccad073ad2ec92a880af2cbb9a8010c035b6cc"},"schema_version":"1.0","source":{"id":"1211.5931","kind":"arxiv","version":2}},"canonical_sha256":"e98a6fae1b792a19422212926eefbc49b0b251958f78f5c0b65f0acd7f02963c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e98a6fae1b792a19422212926eefbc49b0b251958f78f5c0b65f0acd7f02963c","first_computed_at":"2026-05-18T03:38:22.930326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:22.930326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F8Kmx0gP+UHs+dz4+7OEMgzbXlZeu7UYe5y12YU55dDcOo6JSn+ZaJzYepO2e1vYUQxHBgAM3gEfANipf19nBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:22.930774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5931","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9c55832d56de4803e8f98fed9fe511a11ec5b43add6a97460876829481bc5f2","sha256:6ac27d5d6cbe4f42bb88a58ee1d91b8f2acf17dd013f19c65d0a3f042b1b25bb"],"state_sha256":"6c0ea2bfb09ea05ac74800541062e533836816462b9d9833b2ac92176d0a43e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kn8R8gxGMOb1njVnkH4jeRGPfAaBTF83H0XEABQXmGLjEybVzdQCpH0cu7ecpC9RAZoSTdT4j3XviBPHod87BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:02:14.141866Z","bundle_sha256":"052b78e3c333897006fbcb06ff6f41e9f583c6d3ac952a99a4e6dfe9e91f4b74"}}