{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7RDTI4QGA67IZPVAX36EUUME4E","short_pith_number":"pith:7RDTI4QG","canonical_record":{"source":{"id":"1202.1120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T12:40:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d54e1a8d0e790706dd6cd8dd0c922dcf1e48a041a9ff1ed718c6ec2d6ac698b5","abstract_canon_sha256":"799e0c10cf26071d9ee5cdf989ee6af4179b276e09ea11ae792c0a2b27e58157"},"schema_version":"1.0"},"canonical_sha256":"fc4734720607be8cbea0befc4a5184e12915c290a430c747376d9fba46c7415b","source":{"kind":"arxiv","id":"1202.1120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1120","created_at":"2026-05-18T04:03:04Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1120v1","created_at":"2026-05-18T04:03:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1120","created_at":"2026-05-18T04:03:04Z"},{"alias_kind":"pith_short_12","alias_value":"7RDTI4QGA67I","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7RDTI4QGA67IZPVA","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7RDTI4QG","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7RDTI4QGA67IZPVAX36EUUME4E","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T12:40:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d54e1a8d0e790706dd6cd8dd0c922dcf1e48a041a9ff1ed718c6ec2d6ac698b5","abstract_canon_sha256":"799e0c10cf26071d9ee5cdf989ee6af4179b276e09ea11ae792c0a2b27e58157"},"schema_version":"1.0"},"canonical_sha256":"fc4734720607be8cbea0befc4a5184e12915c290a430c747376d9fba46c7415b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:04.968610Z","signature_b64":"yNZc68TQNjcqcdR5Tz77JDcwgzAVU7d+8IcoaenxzuKs7QdsemInkOuzEUa19WUOrBBH1tQd0ZAafdogOG98Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4734720607be8cbea0befc4a5184e12915c290a430c747376d9fba46c7415b","last_reissued_at":"2026-05-18T04:03:04.967833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:04.967833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1120","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:03:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"weDf65+JrWIniAZxuC+XwPUxQZm/M3khzFi5lrI0huc5S/A0E2ZT/nMvB3GMY0prGA7GDz8AXD9rdhmVfe2nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:04.484076Z"},"content_sha256":"4542bc058a26d84f734b87a77832e61777295ce9c316fbe0b617f4c0c913c401","schema_version":"1.0","event_id":"sha256:4542bc058a26d84f734b87a77832e61777295ce9c316fbe0b617f4c0c913c401"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7RDTI4QGA67IZPVAX36EUUME4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimum Power Allocations for Fading Decode-and-Forward Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Gholami Davoodi, Mohammad Javad Emadi, Mohammad Reza Aref","submitted_at":"2012-02-06T12:40:09Z","abstract_excerpt":"In this paper, for a fading decode-and-forward full-duplex relay channel, we analytically derive optimum power allocations. Individual power constraints for the source and the relay are assumed and the related optimization problem is analyzed for two scenarios. First, optimization is taken over the source power, the relay power, and the correlation coefficient between the transmitted signals of the source and the relay. Then, for a fixed value of correlation coefficient, the optimization problem is analyzed. It is also proven that the optimization problems are convex for these two scenarios. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1120","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:03:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWzk1hEEPpw5dpFc9hnJZ3QnbPowf7AMYCO3NtkjjceABFY0Ard/T23ZYmcUMtnbrwHrbwC+MVXhhpZvpEwuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:04.484774Z"},"content_sha256":"de717e85e34c150a04017cf9ca02f011e8056adc026df88ed0713b6636693d8d","schema_version":"1.0","event_id":"sha256:de717e85e34c150a04017cf9ca02f011e8056adc026df88ed0713b6636693d8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RDTI4QGA67IZPVAX36EUUME4E/bundle.json","state_url":"https://pith.science/pith/7RDTI4QGA67IZPVAX36EUUME4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RDTI4QGA67IZPVAX36EUUME4E/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-28T23:36:04Z","links":{"resolver":"https://pith.science/pith/7RDTI4QGA67IZPVAX36EUUME4E","bundle":"https://pith.science/pith/7RDTI4QGA67IZPVAX36EUUME4E/bundle.json","state":"https://pith.science/pith/7RDTI4QGA67IZPVAX36EUUME4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RDTI4QGA67IZPVAX36EUUME4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7RDTI4QGA67IZPVAX36EUUME4E","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":"799e0c10cf26071d9ee5cdf989ee6af4179b276e09ea11ae792c0a2b27e58157","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T12:40:09Z","title_canon_sha256":"d54e1a8d0e790706dd6cd8dd0c922dcf1e48a041a9ff1ed718c6ec2d6ac698b5"},"schema_version":"1.0","source":{"id":"1202.1120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1120","created_at":"2026-05-18T04:03:04Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1120v1","created_at":"2026-05-18T04:03:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1120","created_at":"2026-05-18T04:03:04Z"},{"alias_kind":"pith_short_12","alias_value":"7RDTI4QGA67I","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7RDTI4QGA67IZPVA","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7RDTI4QG","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:de717e85e34c150a04017cf9ca02f011e8056adc026df88ed0713b6636693d8d","target":"graph","created_at":"2026-05-18T04:03: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":"In this paper, for a fading decode-and-forward full-duplex relay channel, we analytically derive optimum power allocations. Individual power constraints for the source and the relay are assumed and the related optimization problem is analyzed for two scenarios. First, optimization is taken over the source power, the relay power, and the correlation coefficient between the transmitted signals of the source and the relay. Then, for a fixed value of correlation coefficient, the optimization problem is analyzed. It is also proven that the optimization problems are convex for these two scenarios. F","authors_text":"Arash Gholami Davoodi, Mohammad Javad Emadi, Mohammad Reza Aref","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T12:40:09Z","title":"Optimum Power Allocations for Fading Decode-and-Forward Relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1120","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:4542bc058a26d84f734b87a77832e61777295ce9c316fbe0b617f4c0c913c401","target":"record","created_at":"2026-05-18T04:03: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":"799e0c10cf26071d9ee5cdf989ee6af4179b276e09ea11ae792c0a2b27e58157","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T12:40:09Z","title_canon_sha256":"d54e1a8d0e790706dd6cd8dd0c922dcf1e48a041a9ff1ed718c6ec2d6ac698b5"},"schema_version":"1.0","source":{"id":"1202.1120","kind":"arxiv","version":1}},"canonical_sha256":"fc4734720607be8cbea0befc4a5184e12915c290a430c747376d9fba46c7415b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4734720607be8cbea0befc4a5184e12915c290a430c747376d9fba46c7415b","first_computed_at":"2026-05-18T04:03:04.967833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:04.967833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yNZc68TQNjcqcdR5Tz77JDcwgzAVU7d+8IcoaenxzuKs7QdsemInkOuzEUa19WUOrBBH1tQd0ZAafdogOG98Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:04.968610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4542bc058a26d84f734b87a77832e61777295ce9c316fbe0b617f4c0c913c401","sha256:de717e85e34c150a04017cf9ca02f011e8056adc026df88ed0713b6636693d8d"],"state_sha256":"ca21aa3916d271732e3afb155ff53bb0bb42c011ec7dccb761764611e1ae471d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4+gt7ChzLeji3AJcUSAKyrN/SETIK0hYyU6Mgo+NbdYcih66oz7T+PLwvUEfzXipW3ObsiVITM7ON3ttDbADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:36:04.488447Z","bundle_sha256":"36ddda526a02c56e79351e11ef2d2e6a2b7d32357c21d13b98bf40eed52ddf40"}}