{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JP4FLHWQOWP4AQ5XHLF2Y5GOFM","short_pith_number":"pith:JP4FLHWQ","canonical_record":{"source":{"id":"1104.4154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T01:42:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"886afc9e984e07db7395c2762eeee8f275ed03d30375779d7b8afab6f4a5b356","abstract_canon_sha256":"e9ef4020aefd0a6a95603a0295136f0e0a967a0531236f76cdfb6031b2568722"},"schema_version":"1.0"},"canonical_sha256":"4bf8559ed0759fc043b73acbac74ce2b2f738de777d715a843b5f89672025e29","source":{"kind":"arxiv","id":"1104.4154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4154","created_at":"2026-05-18T02:02:17Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4154v1","created_at":"2026-05-18T02:02:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4154","created_at":"2026-05-18T02:02:17Z"},{"alias_kind":"pith_short_12","alias_value":"JP4FLHWQOWP4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JP4FLHWQOWP4AQ5X","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JP4FLHWQ","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JP4FLHWQOWP4AQ5XHLF2Y5GOFM","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T01:42:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"886afc9e984e07db7395c2762eeee8f275ed03d30375779d7b8afab6f4a5b356","abstract_canon_sha256":"e9ef4020aefd0a6a95603a0295136f0e0a967a0531236f76cdfb6031b2568722"},"schema_version":"1.0"},"canonical_sha256":"4bf8559ed0759fc043b73acbac74ce2b2f738de777d715a843b5f89672025e29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:17.064441Z","signature_b64":"USPrUzG6Z8Zw3lOO/9+SzRmF8oRQ122Yj7yxk3ydytshaucT3O5R6mtIWUZpjarilgwBsPjQkYgAs2lrBhTFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bf8559ed0759fc043b73acbac74ce2b2f738de777d715a843b5f89672025e29","last_reissued_at":"2026-05-18T02:02:17.063577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:17.063577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4154","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-18T02:02:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcYUnVdPwmmEsj0cBXxy6I/sFWmWqBJtGVsh/RDWrki9g2xYl2HnUzJvWqytskPx8ZFDwwBpoU7Uw5lNOimQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:32:59.744715Z"},"content_sha256":"e14927ffad0d70ea43107e71ea8ee9d59a177970c9b313cb0de0d989f3d2b9f4","schema_version":"1.0","event_id":"sha256:e14927ffad0d70ea43107e71ea8ee9d59a177970c9b313cb0de0d989f3d2b9f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JP4FLHWQOWP4AQ5XHLF2Y5GOFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Khabbazibasmenj, Sergiy A. Vorobyov","submitted_at":"2011-04-21T01:42:20Z","abstract_excerpt":"The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is assumed that only the relays that decode the source message correctly contribute in data transmission. Moreover, only the knowledge of statistical channel state information is available. A new simple closed-form expression for the average symbol error probability is derived. Based on this expression, a new power allocation method that minimizes the average symbol error probability and takes into account the constraints"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4154","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-18T02:02:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oCyU3i2BnV/tePzvmrZdEAmPT3MvgNku5YAOQqr8bt9wamXi3DCzBiG7OOVhmKbAev1jVEcYQhPliglluC0BCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:32:59.745455Z"},"content_sha256":"45ad7b24064990477f839b1481b19911b74f7265e4168c21fd849db751c523da","schema_version":"1.0","event_id":"sha256:45ad7b24064990477f839b1481b19911b74f7265e4168c21fd849db751c523da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JP4FLHWQOWP4AQ5XHLF2Y5GOFM/bundle.json","state_url":"https://pith.science/pith/JP4FLHWQOWP4AQ5XHLF2Y5GOFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JP4FLHWQOWP4AQ5XHLF2Y5GOFM/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-09T10:32:59Z","links":{"resolver":"https://pith.science/pith/JP4FLHWQOWP4AQ5XHLF2Y5GOFM","bundle":"https://pith.science/pith/JP4FLHWQOWP4AQ5XHLF2Y5GOFM/bundle.json","state":"https://pith.science/pith/JP4FLHWQOWP4AQ5XHLF2Y5GOFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JP4FLHWQOWP4AQ5XHLF2Y5GOFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JP4FLHWQOWP4AQ5XHLF2Y5GOFM","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":"e9ef4020aefd0a6a95603a0295136f0e0a967a0531236f76cdfb6031b2568722","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T01:42:20Z","title_canon_sha256":"886afc9e984e07db7395c2762eeee8f275ed03d30375779d7b8afab6f4a5b356"},"schema_version":"1.0","source":{"id":"1104.4154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4154","created_at":"2026-05-18T02:02:17Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4154v1","created_at":"2026-05-18T02:02:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4154","created_at":"2026-05-18T02:02:17Z"},{"alias_kind":"pith_short_12","alias_value":"JP4FLHWQOWP4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JP4FLHWQOWP4AQ5X","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JP4FLHWQ","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:45ad7b24064990477f839b1481b19911b74f7265e4168c21fd849db751c523da","target":"graph","created_at":"2026-05-18T02:02:17Z","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":"The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is assumed that only the relays that decode the source message correctly contribute in data transmission. Moreover, only the knowledge of statistical channel state information is available. A new simple closed-form expression for the average symbol error probability is derived. Based on this expression, a new power allocation method that minimizes the average symbol error probability and takes into account the constraints","authors_text":"Arash Khabbazibasmenj, Sergiy A. Vorobyov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T01:42:20Z","title":"Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4154","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:e14927ffad0d70ea43107e71ea8ee9d59a177970c9b313cb0de0d989f3d2b9f4","target":"record","created_at":"2026-05-18T02:02:17Z","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":"e9ef4020aefd0a6a95603a0295136f0e0a967a0531236f76cdfb6031b2568722","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T01:42:20Z","title_canon_sha256":"886afc9e984e07db7395c2762eeee8f275ed03d30375779d7b8afab6f4a5b356"},"schema_version":"1.0","source":{"id":"1104.4154","kind":"arxiv","version":1}},"canonical_sha256":"4bf8559ed0759fc043b73acbac74ce2b2f738de777d715a843b5f89672025e29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bf8559ed0759fc043b73acbac74ce2b2f738de777d715a843b5f89672025e29","first_computed_at":"2026-05-18T02:02:17.063577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:17.063577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"USPrUzG6Z8Zw3lOO/9+SzRmF8oRQ122Yj7yxk3ydytshaucT3O5R6mtIWUZpjarilgwBsPjQkYgAs2lrBhTFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:17.064441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e14927ffad0d70ea43107e71ea8ee9d59a177970c9b313cb0de0d989f3d2b9f4","sha256:45ad7b24064990477f839b1481b19911b74f7265e4168c21fd849db751c523da"],"state_sha256":"be2dd4284e2e9763b74d16635aaeadc99a680880889b7e83fcf5d3dfcfecb998"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qwWKQJ/FGfdaFOgmMesJrVqRmRZNTmAwaLOXPPwBtv/5BJtn59S7WXMpdmwE8d55HYKoFgp1t2+CzixWYJCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:32:59.749250Z","bundle_sha256":"0f8d02be813085d2a1afd9769f364a3f3af60c99a4555a6920b36dde93fd1c3e"}}