{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LA5WD534OMYVX5O44UBZGBQ5WK","short_pith_number":"pith:LA5WD534","schema_version":"1.0","canonical_sha256":"583b61f77c73315bf5dce50393061db2998f13b24d3be25b015d0ce8301f960e","source":{"kind":"arxiv","id":"1202.0854","version":2},"attestation_state":"computed","paper":{"title":"Reverse Compute and Forward: A Low-Complexity Architecture for Downlink Distributed Antenna Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Song-Nam Hong","submitted_at":"2012-02-04T01:25:12Z","abstract_excerpt":"We consider a distributed antenna system where $L$ antenna terminals (ATs) are connected to a Central Processor (CP) via digital error-free links of finite capacity $R_0$, and serve $L$ user terminals (UTs). This system model has been widely investigated both for the uplink and the downlink, which are instances of the general multiple-access relay and broadcast relay networks. In this work we focus on the downlink, and propose a novel downlink precoding scheme nicknamed \"Reverse Quantized Compute and Forward\" (RQCoF). For this scheme we obtain achievable rates and compare with the state of the"},"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":"1202.0854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-04T01:25:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"973d26d8e01447ba674213bcc3eaba11ec62b81efe1779bfc7ec28077d4729a7","abstract_canon_sha256":"85b07b2f56028880a4f438b212db55d6d88f2e73eb00cd45f1bd15669b341926"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:53.894808Z","signature_b64":"MJflV/guJEKnJtx0tQbu7Ldr+xas0mbNUdmswgOZmtxEzPZ+6LRj3wKnXU/MwLZaQ0E5PBdxA2Mp+3HBNt89Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"583b61f77c73315bf5dce50393061db2998f13b24d3be25b015d0ce8301f960e","last_reissued_at":"2026-05-18T04:02:53.893885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:53.893885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reverse Compute and Forward: A Low-Complexity Architecture for Downlink Distributed Antenna Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Song-Nam Hong","submitted_at":"2012-02-04T01:25:12Z","abstract_excerpt":"We consider a distributed antenna system where $L$ antenna terminals (ATs) are connected to a Central Processor (CP) via digital error-free links of finite capacity $R_0$, and serve $L$ user terminals (UTs). This system model has been widely investigated both for the uplink and the downlink, which are instances of the general multiple-access relay and broadcast relay networks. In this work we focus on the downlink, and propose a novel downlink precoding scheme nicknamed \"Reverse Quantized Compute and Forward\" (RQCoF). For this scheme we obtain achievable rates and compare with the state of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0854","kind":"arxiv","version":2},"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":"1202.0854","created_at":"2026-05-18T04:02:53.894033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0854v2","created_at":"2026-05-18T04:02:53.894033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0854","created_at":"2026-05-18T04:02:53.894033+00:00"},{"alias_kind":"pith_short_12","alias_value":"LA5WD534OMYV","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LA5WD534OMYVX5O4","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LA5WD534","created_at":"2026-05-18T12:27:14.488303+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/LA5WD534OMYVX5O44UBZGBQ5WK","json":"https://pith.science/pith/LA5WD534OMYVX5O44UBZGBQ5WK.json","graph_json":"https://pith.science/api/pith-number/LA5WD534OMYVX5O44UBZGBQ5WK/graph.json","events_json":"https://pith.science/api/pith-number/LA5WD534OMYVX5O44UBZGBQ5WK/events.json","paper":"https://pith.science/paper/LA5WD534"},"agent_actions":{"view_html":"https://pith.science/pith/LA5WD534OMYVX5O44UBZGBQ5WK","download_json":"https://pith.science/pith/LA5WD534OMYVX5O44UBZGBQ5WK.json","view_paper":"https://pith.science/paper/LA5WD534","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0854&json=true","fetch_graph":"https://pith.science/api/pith-number/LA5WD534OMYVX5O44UBZGBQ5WK/graph.json","fetch_events":"https://pith.science/api/pith-number/LA5WD534OMYVX5O44UBZGBQ5WK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LA5WD534OMYVX5O44UBZGBQ5WK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LA5WD534OMYVX5O44UBZGBQ5WK/action/storage_attestation","attest_author":"https://pith.science/pith/LA5WD534OMYVX5O44UBZGBQ5WK/action/author_attestation","sign_citation":"https://pith.science/pith/LA5WD534OMYVX5O44UBZGBQ5WK/action/citation_signature","submit_replication":"https://pith.science/pith/LA5WD534OMYVX5O44UBZGBQ5WK/action/replication_record"}},"created_at":"2026-05-18T04:02:53.894033+00:00","updated_at":"2026-05-18T04:02:53.894033+00:00"}