{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:644O4P6BL7HCTB3HQYNPYFX4RX","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":"e34897c77f58cab0509286c573cf0c10652a88661f755f590e2683d3023d2e8f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-19T07:41:05Z","title_canon_sha256":"4c0f15e7db28318301b92e60c327c945f937d6e52d981c2c21d96c45e3b23c9d"},"schema_version":"1.0","source":{"id":"1411.5132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5132","created_at":"2026-05-18T02:34:44Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5132v1","created_at":"2026-05-18T02:34:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5132","created_at":"2026-05-18T02:34:44Z"},{"alias_kind":"pith_short_12","alias_value":"644O4P6BL7HC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"644O4P6BL7HCTB3H","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"644O4P6B","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:da260ddf11f5fd8671973a5e1b80f574255c357dde4d3293b81f9292e7a0a39d","target":"graph","created_at":"2026-05-18T02:34:44Z","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, the energy efficiency of multihop relaying over Nakagami-$m$ fading channels is investigated. The \"consumption factor\" is used as a metric to evaluate the energy efficiency, and it is derived in closed-form for both amplify-and-forward and decode-and-forward relaying. Then, based on the obtained expressions, we propose a power allocation strategy maximizing the consumption factor. In addition, two sub-optimal, low complexity, power allocation algorithms are proposed and analyzed, and the obtained power allocation schemes are compared, in terms of energy efficiency as well as oth","authors_text":"Itsikiantsoa Randrianantenaina, Mohamed-Slim Alouini, Mustapha Benjillali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-19T07:41:05Z","title":"Consumption Factor Optimization for Multihop Relaying over Nakagami-m Fading channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5132","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:1e2becbda371c54f4aa9d35510a0b939ac94ed25328f93f00549611ef806e2ec","target":"record","created_at":"2026-05-18T02:34:44Z","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":"e34897c77f58cab0509286c573cf0c10652a88661f755f590e2683d3023d2e8f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-19T07:41:05Z","title_canon_sha256":"4c0f15e7db28318301b92e60c327c945f937d6e52d981c2c21d96c45e3b23c9d"},"schema_version":"1.0","source":{"id":"1411.5132","kind":"arxiv","version":1}},"canonical_sha256":"f738ee3fc15fce298767861afc16fc8dfa0bbf5b62a15abfc83c6e31e04773d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f738ee3fc15fce298767861afc16fc8dfa0bbf5b62a15abfc83c6e31e04773d5","first_computed_at":"2026-05-18T02:34:44.314505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:44.314505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8tCkM4xrY0erbs3+839scA362arnL8QKrlbvukarSmPpgneWdAfUvDtm7rwMubinkdxp3VYSETDEm896S8OFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:44.315018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e2becbda371c54f4aa9d35510a0b939ac94ed25328f93f00549611ef806e2ec","sha256:da260ddf11f5fd8671973a5e1b80f574255c357dde4d3293b81f9292e7a0a39d"],"state_sha256":"66722bdef353a6191f832837d5b7aefde5ff248ba2de91997ec117e5ac0e0dde"}