{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JBBRUIVAG35ONV7PVS4MSJSCW3","short_pith_number":"pith:JBBRUIVA","schema_version":"1.0","canonical_sha256":"48431a22a036fae6d7efacb8c92642b6cd0f6a82afb509f0f9ebc5be0673a741","source":{"kind":"arxiv","id":"1905.12513","version":1},"attestation_state":"computed","paper":{"title":"A Novel Relay Selection Strategy of Cooperative Network Impaired by Bursty Impulsive Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Basile L. Agba, Georges Kaddoum, Md Sahabul Alam","submitted_at":"2019-05-29T15:01:11Z","abstract_excerpt":"Best relay selection (BRS) is crucial in enhancing the performance of cooperative networks. In contrast to most previous works, where the guidelines for BRS are limited to Gaussian noise, in this article, we propose a novel relay selection protocol for a decode-and-forward cooperative network taking into account the bursty impulsive noise (IN). The proposed protocol chooses the N'th best relay considering both the channel gains and the states of the IN of the source-relay and relay-destination links. For this scheme, to obtain the state of IN, we propose a state detection algorithm using maxim"},"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":"1905.12513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-29T15:01:11Z","cross_cats_sorted":[],"title_canon_sha256":"86440e8df1dec6ceec7692622653c9f27a82f042c9e69bc48b5e3b51c098ad34","abstract_canon_sha256":"9d908988aba87c97108fa99e93fa54f16d427c1f4898464332e23c626f91a620"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:44.086796Z","signature_b64":"q9oTo2BtigOa/PZTV+Tq736z3LsQM8gr1mS7PSd/O83r6oJc+OwxYCPkassjE++y8d1GxhQC28EZjcQX5YJFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48431a22a036fae6d7efacb8c92642b6cd0f6a82afb509f0f9ebc5be0673a741","last_reissued_at":"2026-05-17T23:44:44.086332Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:44.086332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Relay Selection Strategy of Cooperative Network Impaired by Bursty Impulsive Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Basile L. Agba, Georges Kaddoum, Md Sahabul Alam","submitted_at":"2019-05-29T15:01:11Z","abstract_excerpt":"Best relay selection (BRS) is crucial in enhancing the performance of cooperative networks. In contrast to most previous works, where the guidelines for BRS are limited to Gaussian noise, in this article, we propose a novel relay selection protocol for a decode-and-forward cooperative network taking into account the bursty impulsive noise (IN). The proposed protocol chooses the N'th best relay considering both the channel gains and the states of the IN of the source-relay and relay-destination links. For this scheme, to obtain the state of IN, we propose a state detection algorithm using maxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12513","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":""},"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":"1905.12513","created_at":"2026-05-17T23:44:44.086407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12513v1","created_at":"2026-05-17T23:44:44.086407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12513","created_at":"2026-05-17T23:44:44.086407+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBBRUIVAG35O","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBBRUIVAG35ONV7P","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBBRUIVA","created_at":"2026-05-18T12:33:18.533446+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/JBBRUIVAG35ONV7PVS4MSJSCW3","json":"https://pith.science/pith/JBBRUIVAG35ONV7PVS4MSJSCW3.json","graph_json":"https://pith.science/api/pith-number/JBBRUIVAG35ONV7PVS4MSJSCW3/graph.json","events_json":"https://pith.science/api/pith-number/JBBRUIVAG35ONV7PVS4MSJSCW3/events.json","paper":"https://pith.science/paper/JBBRUIVA"},"agent_actions":{"view_html":"https://pith.science/pith/JBBRUIVAG35ONV7PVS4MSJSCW3","download_json":"https://pith.science/pith/JBBRUIVAG35ONV7PVS4MSJSCW3.json","view_paper":"https://pith.science/paper/JBBRUIVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12513&json=true","fetch_graph":"https://pith.science/api/pith-number/JBBRUIVAG35ONV7PVS4MSJSCW3/graph.json","fetch_events":"https://pith.science/api/pith-number/JBBRUIVAG35ONV7PVS4MSJSCW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBBRUIVAG35ONV7PVS4MSJSCW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBBRUIVAG35ONV7PVS4MSJSCW3/action/storage_attestation","attest_author":"https://pith.science/pith/JBBRUIVAG35ONV7PVS4MSJSCW3/action/author_attestation","sign_citation":"https://pith.science/pith/JBBRUIVAG35ONV7PVS4MSJSCW3/action/citation_signature","submit_replication":"https://pith.science/pith/JBBRUIVAG35ONV7PVS4MSJSCW3/action/replication_record"}},"created_at":"2026-05-17T23:44:44.086407+00:00","updated_at":"2026-05-17T23:44:44.086407+00:00"}