{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EFEJ57EDTYMCIQZGYF6EMSDWAK","short_pith_number":"pith:EFEJ57ED","schema_version":"1.0","canonical_sha256":"21489efc839e18244326c17c4648760284229b067b9f91749844a356ef1b2372","source":{"kind":"arxiv","id":"1505.00582","version":1},"attestation_state":"computed","paper":{"title":"On the Feedback Reduction of Relay Aided Multiuser Networks using Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Abla Kammoun, Hamid Reza Bahrami, Khalil M. Elkhalil, Mohammed E. Eltayeb, Tareq Y. Al-Naffouri","submitted_at":"2015-05-04T10:31:29Z","abstract_excerpt":"In this paper, we propose a feedback reduction scheme for full-duplex relay-aided multiuser networks. The proposed scheme permits the base station (BS) to obtain channel state information (CSI) from a subset of strong users under substantially reduced feedback overhead. More specifically, we cast the problem of user identification and CSI estimation as a block sparse signal recovery problem in compressive sensing (CS). Using existing CS block recovery algorithms, we first obtain the identity of the strong users and then estimate their CSI using the best linear unbiased estimator (BLUE). To min"},"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":"1505.00582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-04T10:31:29Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"58afed441a28619a478eb44cc23c1b20072a7263c2b9eaf8a7ff5e0a6b47feb4","abstract_canon_sha256":"09b59d63938cc01d797cb1857d23248e1ac83c08a04df820ab9dda7b8fbc067e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:02.484652Z","signature_b64":"xtsOvJtCOdkPJr7MFoziIUtYHqqZMextLaXUALAGsKdpdvFRdf48aVbqoubFhykDo6bIMucPwkEWSRcwKkoiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21489efc839e18244326c17c4648760284229b067b9f91749844a356ef1b2372","last_reissued_at":"2026-05-18T02:17:02.483936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:02.483936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Feedback Reduction of Relay Aided Multiuser Networks using Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Abla Kammoun, Hamid Reza Bahrami, Khalil M. Elkhalil, Mohammed E. Eltayeb, Tareq Y. Al-Naffouri","submitted_at":"2015-05-04T10:31:29Z","abstract_excerpt":"In this paper, we propose a feedback reduction scheme for full-duplex relay-aided multiuser networks. The proposed scheme permits the base station (BS) to obtain channel state information (CSI) from a subset of strong users under substantially reduced feedback overhead. More specifically, we cast the problem of user identification and CSI estimation as a block sparse signal recovery problem in compressive sensing (CS). Using existing CS block recovery algorithms, we first obtain the identity of the strong users and then estimate their CSI using the best linear unbiased estimator (BLUE). To min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00582","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":"1505.00582","created_at":"2026-05-18T02:17:02.484047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00582v1","created_at":"2026-05-18T02:17:02.484047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00582","created_at":"2026-05-18T02:17:02.484047+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFEJ57EDTYMC","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFEJ57EDTYMCIQZG","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFEJ57ED","created_at":"2026-05-18T12:29:19.899920+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/EFEJ57EDTYMCIQZGYF6EMSDWAK","json":"https://pith.science/pith/EFEJ57EDTYMCIQZGYF6EMSDWAK.json","graph_json":"https://pith.science/api/pith-number/EFEJ57EDTYMCIQZGYF6EMSDWAK/graph.json","events_json":"https://pith.science/api/pith-number/EFEJ57EDTYMCIQZGYF6EMSDWAK/events.json","paper":"https://pith.science/paper/EFEJ57ED"},"agent_actions":{"view_html":"https://pith.science/pith/EFEJ57EDTYMCIQZGYF6EMSDWAK","download_json":"https://pith.science/pith/EFEJ57EDTYMCIQZGYF6EMSDWAK.json","view_paper":"https://pith.science/paper/EFEJ57ED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00582&json=true","fetch_graph":"https://pith.science/api/pith-number/EFEJ57EDTYMCIQZGYF6EMSDWAK/graph.json","fetch_events":"https://pith.science/api/pith-number/EFEJ57EDTYMCIQZGYF6EMSDWAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFEJ57EDTYMCIQZGYF6EMSDWAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFEJ57EDTYMCIQZGYF6EMSDWAK/action/storage_attestation","attest_author":"https://pith.science/pith/EFEJ57EDTYMCIQZGYF6EMSDWAK/action/author_attestation","sign_citation":"https://pith.science/pith/EFEJ57EDTYMCIQZGYF6EMSDWAK/action/citation_signature","submit_replication":"https://pith.science/pith/EFEJ57EDTYMCIQZGYF6EMSDWAK/action/replication_record"}},"created_at":"2026-05-18T02:17:02.484047+00:00","updated_at":"2026-05-18T02:17:02.484047+00:00"}