{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CWCAKISDXCOGR4BMEVROOQ7RXT","short_pith_number":"pith:CWCAKISD","schema_version":"1.0","canonical_sha256":"1584052243b89c68f02c2562e743f1bcc40fab6729a4cdb2e7e619bb93dcfc24","source":{"kind":"arxiv","id":"2308.08433","version":1},"attestation_state":"computed","paper":{"title":"Performance Analysis of Relay Selection Schemes in Multi-Hop Decode-and-Forward 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":"2023-08-16T15:25:15Z","abstract_excerpt":"This paper analyses the data rate achieved by various relay selection schemes in a single-user multi-hop relay network with decode-and-forward (DF) relaying. While the single-user relay selection problem is well studied in the literature, research on achievable rate maximization is limited to dual-hop networks and multi-hop networks with a single relay per hop. We fill this important gap by focusing on achievable rate maximization in multi-hop, multi-relay networks. First, we consider optimal relay selection and obtain two approximations to the achievable rate. Next, we consider three existing"},"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":"2308.08433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-16T15:25:15Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"1a791e0fbeb442a30ab9a238fab4d00f27957079cf31f497166ac36392057f83","abstract_canon_sha256":"d2a50e3b0015713b487e1fe2865d96cfb63c4e585016ca17279a83e101c46c75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:59.122495Z","signature_b64":"xbBTu/oaBnX6aWBxsN1uDpVbJOsEREoAOIZ3LmauwSLcemHcfh2lcUoaayF0euvmwGWZvyDJwSb8U0lfNuTxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1584052243b89c68f02c2562e743f1bcc40fab6729a4cdb2e7e619bb93dcfc24","last_reissued_at":"2026-07-05T06:41:59.122064Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:59.122064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Analysis of Relay Selection Schemes in Multi-Hop Decode-and-Forward 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":"2023-08-16T15:25:15Z","abstract_excerpt":"This paper analyses the data rate achieved by various relay selection schemes in a single-user multi-hop relay network with decode-and-forward (DF) relaying. While the single-user relay selection problem is well studied in the literature, research on achievable rate maximization is limited to dual-hop networks and multi-hop networks with a single relay per hop. We fill this important gap by focusing on achievable rate maximization in multi-hop, multi-relay networks. First, we consider optimal relay selection and obtain two approximations to the achievable rate. Next, we consider three existing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.08433","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.08433/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":"2308.08433","created_at":"2026-07-05T06:41:59.122121+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.08433v1","created_at":"2026-07-05T06:41:59.122121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08433","created_at":"2026-07-05T06:41:59.122121+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWCAKISDXCOG","created_at":"2026-07-05T06:41:59.122121+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWCAKISDXCOGR4BM","created_at":"2026-07-05T06:41:59.122121+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWCAKISD","created_at":"2026-07-05T06:41:59.122121+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/CWCAKISDXCOGR4BMEVROOQ7RXT","json":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT.json","graph_json":"https://pith.science/api/pith-number/CWCAKISDXCOGR4BMEVROOQ7RXT/graph.json","events_json":"https://pith.science/api/pith-number/CWCAKISDXCOGR4BMEVROOQ7RXT/events.json","paper":"https://pith.science/paper/CWCAKISD"},"agent_actions":{"view_html":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT","download_json":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT.json","view_paper":"https://pith.science/paper/CWCAKISD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.08433&json=true","fetch_graph":"https://pith.science/api/pith-number/CWCAKISDXCOGR4BMEVROOQ7RXT/graph.json","fetch_events":"https://pith.science/api/pith-number/CWCAKISDXCOGR4BMEVROOQ7RXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/action/storage_attestation","attest_author":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/action/author_attestation","sign_citation":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/action/citation_signature","submit_replication":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/action/replication_record"}},"created_at":"2026-07-05T06:41:59.122121+00:00","updated_at":"2026-07-05T06:41:59.122121+00:00"}