{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZS57KDO3WIGI3UUAD7M2BHGQU7","short_pith_number":"pith:ZS57KDO3","canonical_record":{"source":{"id":"1108.2829","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T22:35:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5b2f0a45a3f583736bce2cca5f66092cc2e65e88ac633ced03b2d863aa48d82","abstract_canon_sha256":"7e1c488e8f1d2317b2cd0a2a0e4ccb741a5ff755f6170620e8c288cd64e1e37f"},"schema_version":"1.0"},"canonical_sha256":"ccbbf50ddbb20c8dd2801fd9a09cd0a7ce41b9da2c7635818cafd3ea051b6653","source":{"kind":"arxiv","id":"1108.2829","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2829","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2829v3","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2829","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZS57KDO3WIGI","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZS57KDO3WIGI3UUA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZS57KDO3","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZS57KDO3WIGI3UUAD7M2BHGQU7","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2829","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T22:35:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5b2f0a45a3f583736bce2cca5f66092cc2e65e88ac633ced03b2d863aa48d82","abstract_canon_sha256":"7e1c488e8f1d2317b2cd0a2a0e4ccb741a5ff755f6170620e8c288cd64e1e37f"},"schema_version":"1.0"},"canonical_sha256":"ccbbf50ddbb20c8dd2801fd9a09cd0a7ce41b9da2c7635818cafd3ea051b6653","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.273905Z","signature_b64":"hq2Fh0GEyTVUR18ItkpjqTb6GpFZWFAwnaI7vXvuOCk4Jx7ARmZHz56+/7lKbV56kUAnlDUcraVVnS9CHSHiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccbbf50ddbb20c8dd2801fd9a09cd0a7ce41b9da2c7635818cafd3ea051b6653","last_reissued_at":"2026-05-18T00:57:57.273324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.273324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2829","source_version":3,"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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7HZPv5sSeIx6fNPxt8whIdtveuO/+VmrhQMUdFum/QnNXV0YXiSICxmNDH20qpYb22HlTkz281j4U0dARUZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:22:56.715525Z"},"content_sha256":"587cb9610870ce07b9d6e01fe4a7637a10ae6a693a6953ca86cdeb5fb5c0ec57","schema_version":"1.0","event_id":"sha256:587cb9610870ce07b9d6e01fe4a7637a10ae6a693a6953ca86cdeb5fb5c0ec57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZS57KDO3WIGI3UUAD7M2BHGQU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy Minimization for the Half-Duplex Relay Channel with Decode-Forward Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fanny Parzysz, Fran\\c{c}ois Gagnon, Mai Vu","submitted_at":"2011-08-13T22:35:51Z","abstract_excerpt":"We analyze coding for energy efficiency in relay channels at a fixed source rate. We first propose a half-duplex decode-forward coding scheme for the Gaussian relay channel. We then derive three optimal sets of power allocation, which respectively minimize the network, the relay and the source energy consumption. These optimal power allocations are given in closed-form, which have so far remained implicit for maximum-rate schemes. Moreover, analysis shows that minimizing the network energy consumption at a given rate is not equivalent to maximizing the rate given energy, since it only covers p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2829","kind":"arxiv","version":3},"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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnSpwcwL4dGH6mk7vvbOYv8/9VxfUnF13XzC7yZmSdYpWZozYqe8xWZVcwvlZFs3O2MzQQKq2/vvAwNeJVKgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:22:56.715889Z"},"content_sha256":"26dd0eda9e44a3d7f3492d29e6d0364ebc6518b0e3bfd0ae995682cf310b15d2","schema_version":"1.0","event_id":"sha256:26dd0eda9e44a3d7f3492d29e6d0364ebc6518b0e3bfd0ae995682cf310b15d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZS57KDO3WIGI3UUAD7M2BHGQU7/bundle.json","state_url":"https://pith.science/pith/ZS57KDO3WIGI3UUAD7M2BHGQU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZS57KDO3WIGI3UUAD7M2BHGQU7/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-22T09:22:56Z","links":{"resolver":"https://pith.science/pith/ZS57KDO3WIGI3UUAD7M2BHGQU7","bundle":"https://pith.science/pith/ZS57KDO3WIGI3UUAD7M2BHGQU7/bundle.json","state":"https://pith.science/pith/ZS57KDO3WIGI3UUAD7M2BHGQU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZS57KDO3WIGI3UUAD7M2BHGQU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZS57KDO3WIGI3UUAD7M2BHGQU7","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":"7e1c488e8f1d2317b2cd0a2a0e4ccb741a5ff755f6170620e8c288cd64e1e37f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T22:35:51Z","title_canon_sha256":"e5b2f0a45a3f583736bce2cca5f66092cc2e65e88ac633ced03b2d863aa48d82"},"schema_version":"1.0","source":{"id":"1108.2829","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2829","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2829v3","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2829","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZS57KDO3WIGI","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZS57KDO3WIGI3UUA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZS57KDO3","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:26dd0eda9e44a3d7f3492d29e6d0364ebc6518b0e3bfd0ae995682cf310b15d2","target":"graph","created_at":"2026-05-18T00:57:57Z","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 coding for energy efficiency in relay channels at a fixed source rate. We first propose a half-duplex decode-forward coding scheme for the Gaussian relay channel. We then derive three optimal sets of power allocation, which respectively minimize the network, the relay and the source energy consumption. These optimal power allocations are given in closed-form, which have so far remained implicit for maximum-rate schemes. Moreover, analysis shows that minimizing the network energy consumption at a given rate is not equivalent to maximizing the rate given energy, since it only covers p","authors_text":"Fanny Parzysz, Fran\\c{c}ois Gagnon, Mai Vu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T22:35:51Z","title":"Energy Minimization for the Half-Duplex Relay Channel with Decode-Forward Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2829","kind":"arxiv","version":3},"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:587cb9610870ce07b9d6e01fe4a7637a10ae6a693a6953ca86cdeb5fb5c0ec57","target":"record","created_at":"2026-05-18T00:57:57Z","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":"7e1c488e8f1d2317b2cd0a2a0e4ccb741a5ff755f6170620e8c288cd64e1e37f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T22:35:51Z","title_canon_sha256":"e5b2f0a45a3f583736bce2cca5f66092cc2e65e88ac633ced03b2d863aa48d82"},"schema_version":"1.0","source":{"id":"1108.2829","kind":"arxiv","version":3}},"canonical_sha256":"ccbbf50ddbb20c8dd2801fd9a09cd0a7ce41b9da2c7635818cafd3ea051b6653","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccbbf50ddbb20c8dd2801fd9a09cd0a7ce41b9da2c7635818cafd3ea051b6653","first_computed_at":"2026-05-18T00:57:57.273324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.273324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hq2Fh0GEyTVUR18ItkpjqTb6GpFZWFAwnaI7vXvuOCk4Jx7ARmZHz56+/7lKbV56kUAnlDUcraVVnS9CHSHiAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.273905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2829","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:587cb9610870ce07b9d6e01fe4a7637a10ae6a693a6953ca86cdeb5fb5c0ec57","sha256:26dd0eda9e44a3d7f3492d29e6d0364ebc6518b0e3bfd0ae995682cf310b15d2"],"state_sha256":"b37597f8843e7c7878155cfa2b73cf1a56b924d51c10ea145c265c85552b4eb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dghQerjCROrnxCp4093d9IM3YTi6Y+5COevkO63gZhlsZuhKSYzoSRtEq2dQT13LGRNwl3lbNVeGncp5vInGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:22:56.717890Z","bundle_sha256":"b5697d204c2abc7f3a63d8ec8ebb1417fe66001e5d4afc1786b7891e95314f2d"}}