{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RO253D5JEN5HZKDTUM72FB5RLG","short_pith_number":"pith:RO253D5J","schema_version":"1.0","canonical_sha256":"8bb5dd8fa9237a7ca873a33fa287b1599e77b29c5cbe3598bf022d484faa9a8d","source":{"kind":"arxiv","id":"1602.08714","version":1},"attestation_state":"computed","paper":{"title":"Lossy Compression for Compute-and-Forward in Limited Backhaul Uplink Multicell Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, I\\~naki Estella Aguerri","submitted_at":"2016-02-28T13:31:25Z","abstract_excerpt":"We study the transmission over a cloud radio access network in which multiple base stations (BS) are connected to a central processor (CP) via finite-capacity backhaul links. We propose two lattice-based coding schemes. In the first scheme, the base stations decode linear combinations of the transmitted messages, in the spirit of compute-and-forward (CoF), but differs from it essentially in that the decoded equations are remapped to linear combinations of the channel input symbols, sent compressed in a lossy manner to the central processor, and are not required to be linearly independent. Also"},"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":"1602.08714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-28T13:31:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d876dd1319893cfe60dda5a5f361697f3894802d5b9ea0524002c0ab3bb91143","abstract_canon_sha256":"a0730aa369386d45e9f6b7591f885e72e7461d3260702afe09587aef3d64634f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:52.120280Z","signature_b64":"PDKI62PZyl4izM/j/Bjd5dOx9XPtqn+LHvyW8JdZEaSAn0fadZ6VxMkBqNfzXAoNNVRge8CxA5M93GqsbLaqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb5dd8fa9237a7ca873a33fa287b1599e77b29c5cbe3598bf022d484faa9a8d","last_reissued_at":"2026-05-18T01:19:52.119648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:52.119648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lossy Compression for Compute-and-Forward in Limited Backhaul Uplink Multicell Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, I\\~naki Estella Aguerri","submitted_at":"2016-02-28T13:31:25Z","abstract_excerpt":"We study the transmission over a cloud radio access network in which multiple base stations (BS) are connected to a central processor (CP) via finite-capacity backhaul links. We propose two lattice-based coding schemes. In the first scheme, the base stations decode linear combinations of the transmitted messages, in the spirit of compute-and-forward (CoF), but differs from it essentially in that the decoded equations are remapped to linear combinations of the channel input symbols, sent compressed in a lossy manner to the central processor, and are not required to be linearly independent. Also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08714","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":"1602.08714","created_at":"2026-05-18T01:19:52.119743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08714v1","created_at":"2026-05-18T01:19:52.119743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08714","created_at":"2026-05-18T01:19:52.119743+00:00"},{"alias_kind":"pith_short_12","alias_value":"RO253D5JEN5H","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RO253D5JEN5HZKDT","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RO253D5J","created_at":"2026-05-18T12:30:41.710351+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/RO253D5JEN5HZKDTUM72FB5RLG","json":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG.json","graph_json":"https://pith.science/api/pith-number/RO253D5JEN5HZKDTUM72FB5RLG/graph.json","events_json":"https://pith.science/api/pith-number/RO253D5JEN5HZKDTUM72FB5RLG/events.json","paper":"https://pith.science/paper/RO253D5J"},"agent_actions":{"view_html":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG","download_json":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG.json","view_paper":"https://pith.science/paper/RO253D5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08714&json=true","fetch_graph":"https://pith.science/api/pith-number/RO253D5JEN5HZKDTUM72FB5RLG/graph.json","fetch_events":"https://pith.science/api/pith-number/RO253D5JEN5HZKDTUM72FB5RLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG/action/storage_attestation","attest_author":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG/action/author_attestation","sign_citation":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG/action/citation_signature","submit_replication":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG/action/replication_record"}},"created_at":"2026-05-18T01:19:52.119743+00:00","updated_at":"2026-05-18T01:19:52.119743+00:00"}