{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CWCAKISDXCOGR4BMEVROOQ7RXT","short_pith_number":"pith:CWCAKISD","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"},"canonical_sha256":"1584052243b89c68f02c2562e743f1bcc40fab6729a4cdb2e7e619bb93dcfc24","source":{"kind":"arxiv","id":"2308.08433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.08433","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"2308.08433v1","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08433","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"CWCAKISDXCOG","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"pith_short_16","alias_value":"CWCAKISDXCOGR4BM","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"pith_short_8","alias_value":"CWCAKISD","created_at":"2026-07-05T06:41:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CWCAKISDXCOGR4BMEVROOQ7RXT","target":"record","payload":{"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"},"canonical_sha256":"1584052243b89c68f02c2562e743f1bcc40fab6729a4cdb2e7e619bb93dcfc24","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"},"source_kind":"arxiv","source_id":"2308.08433","source_version":1,"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-07-05T06:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"irgaIwjkIpkSGAFpFpt8gAn7FEpZxeei3/mEBhwQdjDrUFT6XFzj/zj725/CtP81CkQyim6gK8Hum7m20WzoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:35:06.947120Z"},"content_sha256":"6307c574825026297dbea8417093dd97c735627bef7c078afc37374c7cb45d99","schema_version":"1.0","event_id":"sha256:6307c574825026297dbea8417093dd97c735627bef7c078afc37374c7cb45d99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CWCAKISDXCOGR4BMEVROOQ7RXT","target":"graph","payload":{"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"},"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-07-05T06:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cRGi0oWGnChZmSX86ab8QlSPL4Komo/IR5IcDdGzTv9CEO+Zm6YAbY3q6PDf52POXoIQW3aSBI88AMws7RkcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:35:06.947506Z"},"content_sha256":"8a57db5f9e17df52db8ce46c4edce62cc07527dbb5e53b5726e15489b8950a82","schema_version":"1.0","event_id":"sha256:8a57db5f9e17df52db8ce46c4edce62cc07527dbb5e53b5726e15489b8950a82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/bundle.json","state_url":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/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-07-09T03:35:06Z","links":{"resolver":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT","bundle":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/bundle.json","state":"https://pith.science/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWCAKISDXCOGR4BMEVROOQ7RXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CWCAKISDXCOGR4BMEVROOQ7RXT","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":"d2a50e3b0015713b487e1fe2865d96cfb63c4e585016ca17279a83e101c46c75","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-16T15:25:15Z","title_canon_sha256":"1a791e0fbeb442a30ab9a238fab4d00f27957079cf31f497166ac36392057f83"},"schema_version":"1.0","source":{"id":"2308.08433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.08433","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"2308.08433v1","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08433","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"CWCAKISDXCOG","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"pith_short_16","alias_value":"CWCAKISDXCOGR4BM","created_at":"2026-07-05T06:41:59Z"},{"alias_kind":"pith_short_8","alias_value":"CWCAKISD","created_at":"2026-07-05T06:41:59Z"}],"graph_snapshots":[{"event_id":"sha256:8a57db5f9e17df52db8ce46c4edce62cc07527dbb5e53b5726e15489b8950a82","target":"graph","created_at":"2026-07-05T06:41:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.08433/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jamie Evans, Rajitha Senanayake, Shalanika Dayarathna","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-16T15:25:15Z","title":"Performance Analysis of Relay Selection Schemes in Multi-Hop Decode-and-Forward Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.08433","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:6307c574825026297dbea8417093dd97c735627bef7c078afc37374c7cb45d99","target":"record","created_at":"2026-07-05T06:41:59Z","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":"d2a50e3b0015713b487e1fe2865d96cfb63c4e585016ca17279a83e101c46c75","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-16T15:25:15Z","title_canon_sha256":"1a791e0fbeb442a30ab9a238fab4d00f27957079cf31f497166ac36392057f83"},"schema_version":"1.0","source":{"id":"2308.08433","kind":"arxiv","version":1}},"canonical_sha256":"1584052243b89c68f02c2562e743f1bcc40fab6729a4cdb2e7e619bb93dcfc24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1584052243b89c68f02c2562e743f1bcc40fab6729a4cdb2e7e619bb93dcfc24","first_computed_at":"2026-07-05T06:41:59.122064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:41:59.122064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xbBTu/oaBnX6aWBxsN1uDpVbJOsEREoAOIZ3LmauwSLcemHcfh2lcUoaayF0euvmwGWZvyDJwSb8U0lfNuTxAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:41:59.122495Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.08433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6307c574825026297dbea8417093dd97c735627bef7c078afc37374c7cb45d99","sha256:8a57db5f9e17df52db8ce46c4edce62cc07527dbb5e53b5726e15489b8950a82"],"state_sha256":"df196718c9aead7a0f504f439c7638acc03325f4fb62bee06716399361d7798d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycMiAr1gjS54fgm4h+IiWXj2clEbyUH32Jh9HcrSDQ7mBko52N6mmxAhXqCIdS3fDcgEjl3pFikw2ktLjFckBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T03:35:06.949392Z","bundle_sha256":"c788b05cae3cd2f73d3ab91dc53f4819cbc26921cf428629cc4949de4b5e8032"}}