{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EFPBSWMTZGYB5TNPOX25EPFIHZ","short_pith_number":"pith:EFPBSWMT","schema_version":"1.0","canonical_sha256":"215e195993c9b01ecdaf75f5d23ca83e56888a669fd9f0aad5371105c2ccb6fb","source":{"kind":"arxiv","id":"1610.09407","version":1},"attestation_state":"computed","paper":{"title":"On Achievability for Downlink Cloud Radio Access Networks with Base Station Cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, Chien-Yi Wang, Mich\\`ele Wigger","submitted_at":"2016-10-28T21:31:51Z","abstract_excerpt":"This work investigates the downlink of a cloud radio access network (C-RAN) in which a central processor communicates with two mobile users through two base stations (BSs). The BSs act as relay nodes and cooperate with each other through error-free rate-limited links. We develop and analyze two coding schemes for this scenario. The first coding scheme is based on Liu-Kang scheme for C-RANs without BS cooperation; and extends it to scenarios allowing conferencing between the BSs. Among few other features, our new coding scheme enables arbitrary correlation among the auxiliary codewords that are"},"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":"1610.09407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-28T21:31:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ec2bba52e9b19a0bbc795907d62ebbe6e5ec10963dbd4146f01ee2be1e00e74","abstract_canon_sha256":"f3fd877bd2a2eda61537a7a1131a8d8074f49348c3d6500165b94f1c5013f8e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:52.105276Z","signature_b64":"na91aFu3dZv4fVAJLKmyVwhA3DozKpDr98J9oZGqmVLg2Aymk0NWQXwiqaGl1Ht7yF7RwGOkmhekzfAKxeJZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215e195993c9b01ecdaf75f5d23ca83e56888a669fd9f0aad5371105c2ccb6fb","last_reissued_at":"2026-05-18T01:00:52.104488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:52.104488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Achievability for Downlink Cloud Radio Access Networks with Base Station Cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, Chien-Yi Wang, Mich\\`ele Wigger","submitted_at":"2016-10-28T21:31:51Z","abstract_excerpt":"This work investigates the downlink of a cloud radio access network (C-RAN) in which a central processor communicates with two mobile users through two base stations (BSs). The BSs act as relay nodes and cooperate with each other through error-free rate-limited links. We develop and analyze two coding schemes for this scenario. The first coding scheme is based on Liu-Kang scheme for C-RANs without BS cooperation; and extends it to scenarios allowing conferencing between the BSs. Among few other features, our new coding scheme enables arbitrary correlation among the auxiliary codewords that are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09407","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":"1610.09407","created_at":"2026-05-18T01:00:52.104603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09407v1","created_at":"2026-05-18T01:00:52.104603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09407","created_at":"2026-05-18T01:00:52.104603+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFPBSWMTZGYB","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFPBSWMTZGYB5TNP","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFPBSWMT","created_at":"2026-05-18T12:30:12.583610+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/EFPBSWMTZGYB5TNPOX25EPFIHZ","json":"https://pith.science/pith/EFPBSWMTZGYB5TNPOX25EPFIHZ.json","graph_json":"https://pith.science/api/pith-number/EFPBSWMTZGYB5TNPOX25EPFIHZ/graph.json","events_json":"https://pith.science/api/pith-number/EFPBSWMTZGYB5TNPOX25EPFIHZ/events.json","paper":"https://pith.science/paper/EFPBSWMT"},"agent_actions":{"view_html":"https://pith.science/pith/EFPBSWMTZGYB5TNPOX25EPFIHZ","download_json":"https://pith.science/pith/EFPBSWMTZGYB5TNPOX25EPFIHZ.json","view_paper":"https://pith.science/paper/EFPBSWMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09407&json=true","fetch_graph":"https://pith.science/api/pith-number/EFPBSWMTZGYB5TNPOX25EPFIHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/EFPBSWMTZGYB5TNPOX25EPFIHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFPBSWMTZGYB5TNPOX25EPFIHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFPBSWMTZGYB5TNPOX25EPFIHZ/action/storage_attestation","attest_author":"https://pith.science/pith/EFPBSWMTZGYB5TNPOX25EPFIHZ/action/author_attestation","sign_citation":"https://pith.science/pith/EFPBSWMTZGYB5TNPOX25EPFIHZ/action/citation_signature","submit_replication":"https://pith.science/pith/EFPBSWMTZGYB5TNPOX25EPFIHZ/action/replication_record"}},"created_at":"2026-05-18T01:00:52.104603+00:00","updated_at":"2026-05-18T01:00:52.104603+00:00"}