{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:O5G52BDDD63C2SYH3CMU5OTSFO","short_pith_number":"pith:O5G52BDD","schema_version":"1.0","canonical_sha256":"774ddd04631fb62d4b07d8994eba722bb91b061ade99b93228fcd92b4d40fdcb","source":{"kind":"arxiv","id":"2205.09378","version":3},"attestation_state":"computed","paper":{"title":"Joint Relay Selection and Power Control that aims to Maximize Sum-Rate in Multi-Hop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jamie Evans, Rajitha Senanayake, Shalanika Dayarathna","submitted_at":"2022-05-19T08:20:53Z","abstract_excerpt":"Focusing on the joint relay selection and power control problem with a view to maximizing the sum-rate, we propose a novel sub-optimal algorithm that iterates between relay selection and power control. The relay selection is performed by maximizing the minimum signal-to-interference-plus-noise-ratio (as opposed to maximizing the sum-rate) and the power control is performed using a successive convex approximation. By comparing the proposed algorithm with existing solutions via extensive simulations, we show that the proposed algorithm results in significant sum-rate gains. Finally, we analyze t"},"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":"2205.09378","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-05-19T08:20:53Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"606562974235af3219d24539a910c99005cbaeb44089b6064c0c0b112f53b1f4","abstract_canon_sha256":"8e2d2d79cf608b09c096b4aa720adfea5239c89f343a08e3b1251a8b5c4977db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:47.099024Z","signature_b64":"JK/9eHRt8laB1dxYich5ltcpQ2sCo6L9gG6q8/Kj/jqa8PsNYQ6fUhFRpFUyBBwvULfpi0CvmIHpThrJoq2mCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"774ddd04631fb62d4b07d8994eba722bb91b061ade99b93228fcd92b4d40fdcb","last_reissued_at":"2026-07-05T07:33:47.098267Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:47.098267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Relay Selection and Power Control that aims to Maximize Sum-Rate in Multi-Hop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jamie Evans, Rajitha Senanayake, Shalanika Dayarathna","submitted_at":"2022-05-19T08:20:53Z","abstract_excerpt":"Focusing on the joint relay selection and power control problem with a view to maximizing the sum-rate, we propose a novel sub-optimal algorithm that iterates between relay selection and power control. The relay selection is performed by maximizing the minimum signal-to-interference-plus-noise-ratio (as opposed to maximizing the sum-rate) and the power control is performed using a successive convex approximation. By comparing the proposed algorithm with existing solutions via extensive simulations, we show that the proposed algorithm results in significant sum-rate gains. Finally, we analyze t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.09378","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.09378/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.09378","created_at":"2026-07-05T07:33:47.098381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.09378v3","created_at":"2026-07-05T07:33:47.098381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.09378","created_at":"2026-07-05T07:33:47.098381+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5G52BDDD63C","created_at":"2026-07-05T07:33:47.098381+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5G52BDDD63C2SYH","created_at":"2026-07-05T07:33:47.098381+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5G52BDD","created_at":"2026-07-05T07:33:47.098381+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/O5G52BDDD63C2SYH3CMU5OTSFO","json":"https://pith.science/pith/O5G52BDDD63C2SYH3CMU5OTSFO.json","graph_json":"https://pith.science/api/pith-number/O5G52BDDD63C2SYH3CMU5OTSFO/graph.json","events_json":"https://pith.science/api/pith-number/O5G52BDDD63C2SYH3CMU5OTSFO/events.json","paper":"https://pith.science/paper/O5G52BDD"},"agent_actions":{"view_html":"https://pith.science/pith/O5G52BDDD63C2SYH3CMU5OTSFO","download_json":"https://pith.science/pith/O5G52BDDD63C2SYH3CMU5OTSFO.json","view_paper":"https://pith.science/paper/O5G52BDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.09378&json=true","fetch_graph":"https://pith.science/api/pith-number/O5G52BDDD63C2SYH3CMU5OTSFO/graph.json","fetch_events":"https://pith.science/api/pith-number/O5G52BDDD63C2SYH3CMU5OTSFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5G52BDDD63C2SYH3CMU5OTSFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5G52BDDD63C2SYH3CMU5OTSFO/action/storage_attestation","attest_author":"https://pith.science/pith/O5G52BDDD63C2SYH3CMU5OTSFO/action/author_attestation","sign_citation":"https://pith.science/pith/O5G52BDDD63C2SYH3CMU5OTSFO/action/citation_signature","submit_replication":"https://pith.science/pith/O5G52BDDD63C2SYH3CMU5OTSFO/action/replication_record"}},"created_at":"2026-07-05T07:33:47.098381+00:00","updated_at":"2026-07-05T07:33:47.098381+00:00"}