{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VVLSKJWOCVZU5N6KHBY6TOWLMF","short_pith_number":"pith:VVLSKJWO","schema_version":"1.0","canonical_sha256":"ad572526ce15734eb7ca3871e9bacb617f9752fd4a00183fa6e0f098ba81c3f4","source":{"kind":"arxiv","id":"1010.4920","version":4},"attestation_state":"computed","paper":{"title":"Jointly Optimal Channel Pairing and Power Allocation for Multichannel Multihop Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Ben Liang, Mahdi Hajiaghayi, Min Dong","submitted_at":"2010-10-24T00:30:15Z","abstract_excerpt":"We study the problem of channel pairing and power allocation in a multichannel multihop relay network to enhance the end-to-end data rate. Both amplify-and-forward (AF) and decode-and-forward (DF) relaying strategies are considered. Given fixed power allocation to the channels, we show that channel pairing over multiple hops can be decomposed into independent pairing problems at each relay, and a sorted-SNR channel pairing strategy is sum-rate optimal, where each relay pairs its incoming and outgoing channels by their SNR order. For the joint optimization of channel pairing and power allocatio"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1010.4920","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-24T00:30:15Z","cross_cats_sorted":["cs.NI","cs.PF","math.IT"],"title_canon_sha256":"2b3b792fd76e06985fe4b331982d6eae1fc96e99f01f0117dcc5be4a4a04a20a","abstract_canon_sha256":"33c1df69c7003fb6867b8b24bbee41986c445f7542084f680453912e3bdc6c95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:37.219624Z","signature_b64":"Xpq8qqoUhTX6FbFj9kp7ypWOlsfHaO7PH777HDnoB/BuDV+ruEdbchSXX+dr4/4sh8G0q647uFo4zyzFcfhuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad572526ce15734eb7ca3871e9bacb617f9752fd4a00183fa6e0f098ba81c3f4","last_reissued_at":"2026-05-18T01:24:37.219131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:37.219131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jointly Optimal Channel Pairing and Power Allocation for Multichannel Multihop Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Ben Liang, Mahdi Hajiaghayi, Min Dong","submitted_at":"2010-10-24T00:30:15Z","abstract_excerpt":"We study the problem of channel pairing and power allocation in a multichannel multihop relay network to enhance the end-to-end data rate. Both amplify-and-forward (AF) and decode-and-forward (DF) relaying strategies are considered. Given fixed power allocation to the channels, we show that channel pairing over multiple hops can be decomposed into independent pairing problems at each relay, and a sorted-SNR channel pairing strategy is sum-rate optimal, where each relay pairs its incoming and outgoing channels by their SNR order. For the joint optimization of channel pairing and power allocatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4920","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.4920","created_at":"2026-05-18T01:24:37.219206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.4920v4","created_at":"2026-05-18T01:24:37.219206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4920","created_at":"2026-05-18T01:24:37.219206+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVLSKJWOCVZU","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVLSKJWOCVZU5N6K","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVLSKJWO","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VVLSKJWOCVZU5N6KHBY6TOWLMF","json":"https://pith.science/pith/VVLSKJWOCVZU5N6KHBY6TOWLMF.json","graph_json":"https://pith.science/api/pith-number/VVLSKJWOCVZU5N6KHBY6TOWLMF/graph.json","events_json":"https://pith.science/api/pith-number/VVLSKJWOCVZU5N6KHBY6TOWLMF/events.json","paper":"https://pith.science/paper/VVLSKJWO"},"agent_actions":{"view_html":"https://pith.science/pith/VVLSKJWOCVZU5N6KHBY6TOWLMF","download_json":"https://pith.science/pith/VVLSKJWOCVZU5N6KHBY6TOWLMF.json","view_paper":"https://pith.science/paper/VVLSKJWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.4920&json=true","fetch_graph":"https://pith.science/api/pith-number/VVLSKJWOCVZU5N6KHBY6TOWLMF/graph.json","fetch_events":"https://pith.science/api/pith-number/VVLSKJWOCVZU5N6KHBY6TOWLMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVLSKJWOCVZU5N6KHBY6TOWLMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVLSKJWOCVZU5N6KHBY6TOWLMF/action/storage_attestation","attest_author":"https://pith.science/pith/VVLSKJWOCVZU5N6KHBY6TOWLMF/action/author_attestation","sign_citation":"https://pith.science/pith/VVLSKJWOCVZU5N6KHBY6TOWLMF/action/citation_signature","submit_replication":"https://pith.science/pith/VVLSKJWOCVZU5N6KHBY6TOWLMF/action/replication_record"}},"created_at":"2026-05-18T01:24:37.219206+00:00","updated_at":"2026-05-18T01:24:37.219206+00:00"}