{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P5RYB7OPNHABFOSSZSL3DQBTHO","short_pith_number":"pith:P5RYB7OP","canonical_record":{"source":{"id":"1701.07237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T10:12:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"71773163517f3e707535e28fa22cc1a8eaa0581e1972fd5cffa99ec840019cb3","abstract_canon_sha256":"e7c4999d56043267d5830d67eefd2b9fa494032352b821cd634f590ac597ec03"},"schema_version":"1.0"},"canonical_sha256":"7f6380fdcf69c012ba52cc97b1c0333bbdb4c0c5f9b4b088ff7d0bb9be25b6f6","source":{"kind":"arxiv","id":"1701.07237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07237","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07237v1","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07237","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"P5RYB7OPNHAB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5RYB7OPNHABFOSS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5RYB7OP","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P5RYB7OPNHABFOSSZSL3DQBTHO","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T10:12:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"71773163517f3e707535e28fa22cc1a8eaa0581e1972fd5cffa99ec840019cb3","abstract_canon_sha256":"e7c4999d56043267d5830d67eefd2b9fa494032352b821cd634f590ac597ec03"},"schema_version":"1.0"},"canonical_sha256":"7f6380fdcf69c012ba52cc97b1c0333bbdb4c0c5f9b4b088ff7d0bb9be25b6f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:07.088138Z","signature_b64":"5fEqrelICTH7/rosDNIE34pFNRs8eUD/87NFTSjsDhoVtMRyzY+n5r5RYF/wKdDBo/L01xqjaIGTaBDpyIBtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f6380fdcf69c012ba52cc97b1c0333bbdb4c0c5f9b4b088ff7d0bb9be25b6f6","last_reissued_at":"2026-05-18T00:52:07.087592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:07.087592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07237","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4tvO/9aIJIdoR+Wanm0r3Kz2vWkxidX2/9xZ4hkyBUgNxgQnu3+IKS+XYW/Gz1SiknDjLDFOOKZJbcuO4L+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:35:08.157618Z"},"content_sha256":"2b5aa98eda60987e87302baa10c47e3df336dc748dca603fc00277b9680383a3","schema_version":"1.0","event_id":"sha256:2b5aa98eda60987e87302baa10c47e3df336dc748dca603fc00277b9680383a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P5RYB7OPNHABFOSSZSL3DQBTHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of Cloud Radio Access Networks with Oblivious Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, Giuseppe Caire, Inaki Estella Aguerri, Shlomo Shamai (Shitz)","submitted_at":"2017-01-25T10:12:31Z","abstract_excerpt":"We study the transmission over a network in which users send information to a remote destination through relay nodes that are connected to the destination via finite-capacity error-free links, i.e., a cloud radio access network. The relays are constrained to operate without knowledge of the users' codebooks, i.e., they perform oblivious processing - The destination, or central processor, however, is informed about the users' codebooks. We establish a single-letter characterization of the capacity region of this model for a class of discrete memoryless channels in which the outputs at the relay"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07237","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZsFF3wsLMb0qOxENXBKp1iozRkDG60m001No+qyjifKyK1Q2NeyWmHXPAoAvsdBVpCPR7cpVE2e/ueYCSHZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:35:08.158291Z"},"content_sha256":"6cd60a5ed49fa9bcaf59ed4113e23a4a1f215a407a49a2001c8ab3607e907b22","schema_version":"1.0","event_id":"sha256:6cd60a5ed49fa9bcaf59ed4113e23a4a1f215a407a49a2001c8ab3607e907b22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5RYB7OPNHABFOSSZSL3DQBTHO/bundle.json","state_url":"https://pith.science/pith/P5RYB7OPNHABFOSSZSL3DQBTHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5RYB7OPNHABFOSSZSL3DQBTHO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T12:35:08Z","links":{"resolver":"https://pith.science/pith/P5RYB7OPNHABFOSSZSL3DQBTHO","bundle":"https://pith.science/pith/P5RYB7OPNHABFOSSZSL3DQBTHO/bundle.json","state":"https://pith.science/pith/P5RYB7OPNHABFOSSZSL3DQBTHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5RYB7OPNHABFOSSZSL3DQBTHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P5RYB7OPNHABFOSSZSL3DQBTHO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e7c4999d56043267d5830d67eefd2b9fa494032352b821cd634f590ac597ec03","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T10:12:31Z","title_canon_sha256":"71773163517f3e707535e28fa22cc1a8eaa0581e1972fd5cffa99ec840019cb3"},"schema_version":"1.0","source":{"id":"1701.07237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07237","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07237v1","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07237","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"P5RYB7OPNHAB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5RYB7OPNHABFOSS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5RYB7OP","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:6cd60a5ed49fa9bcaf59ed4113e23a4a1f215a407a49a2001c8ab3607e907b22","target":"graph","created_at":"2026-05-18T00:52:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the transmission over a network in which users send information to a remote destination through relay nodes that are connected to the destination via finite-capacity error-free links, i.e., a cloud radio access network. The relays are constrained to operate without knowledge of the users' codebooks, i.e., they perform oblivious processing - The destination, or central processor, however, is informed about the users' codebooks. We establish a single-letter characterization of the capacity region of this model for a class of discrete memoryless channels in which the outputs at the relay","authors_text":"Abdellatif Zaidi, Giuseppe Caire, Inaki Estella Aguerri, Shlomo Shamai (Shitz)","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T10:12:31Z","title":"On the Capacity of Cloud Radio Access Networks with Oblivious Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07237","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2b5aa98eda60987e87302baa10c47e3df336dc748dca603fc00277b9680383a3","target":"record","created_at":"2026-05-18T00:52:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e7c4999d56043267d5830d67eefd2b9fa494032352b821cd634f590ac597ec03","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T10:12:31Z","title_canon_sha256":"71773163517f3e707535e28fa22cc1a8eaa0581e1972fd5cffa99ec840019cb3"},"schema_version":"1.0","source":{"id":"1701.07237","kind":"arxiv","version":1}},"canonical_sha256":"7f6380fdcf69c012ba52cc97b1c0333bbdb4c0c5f9b4b088ff7d0bb9be25b6f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f6380fdcf69c012ba52cc97b1c0333bbdb4c0c5f9b4b088ff7d0bb9be25b6f6","first_computed_at":"2026-05-18T00:52:07.087592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:07.087592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5fEqrelICTH7/rosDNIE34pFNRs8eUD/87NFTSjsDhoVtMRyzY+n5r5RYF/wKdDBo/L01xqjaIGTaBDpyIBtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:07.088138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b5aa98eda60987e87302baa10c47e3df336dc748dca603fc00277b9680383a3","sha256:6cd60a5ed49fa9bcaf59ed4113e23a4a1f215a407a49a2001c8ab3607e907b22"],"state_sha256":"7c08e26aba1f6a2068cf122d179fcf073caf50538280c690c24f7bfd59c2b5d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eILpJWudFslQu4xcr129zJt6GfO6LE/z5BitzRRMiIMyGeoXC5QFmy3+8xlVc8tGL4iMHgc28BMvYqN1U3zyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:35:08.162182Z","bundle_sha256":"39cd41a139020010e163b3d2043871e2bcfec52978588a2718459034b6b10587"}}