{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BWBPTTKJNNTIRU5JJDCKZLMIMR","short_pith_number":"pith:BWBPTTKJ","canonical_record":{"source":{"id":"1710.09275","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T14:49:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"71773163517f3e707535e28fa22cc1a8eaa0581e1972fd5cffa99ec840019cb3","abstract_canon_sha256":"885886618a386e76c1a8a53587c96fee5c90081c249663dc99fd26100d777e9c"},"schema_version":"1.0"},"canonical_sha256":"0d82f9cd496b6688d3a948c4acad88646adfc18bb3a6d22b0c06da7963fd67c8","source":{"kind":"arxiv","id":"1710.09275","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09275","created_at":"2026-05-17T23:55:08Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09275v3","created_at":"2026-05-17T23:55:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09275","created_at":"2026-05-17T23:55:08Z"},{"alias_kind":"pith_short_12","alias_value":"BWBPTTKJNNTI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BWBPTTKJNNTIRU5J","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BWBPTTKJ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BWBPTTKJNNTIRU5JJDCKZLMIMR","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09275","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T14:49:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"71773163517f3e707535e28fa22cc1a8eaa0581e1972fd5cffa99ec840019cb3","abstract_canon_sha256":"885886618a386e76c1a8a53587c96fee5c90081c249663dc99fd26100d777e9c"},"schema_version":"1.0"},"canonical_sha256":"0d82f9cd496b6688d3a948c4acad88646adfc18bb3a6d22b0c06da7963fd67c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:08.060592Z","signature_b64":"u0lHjbiPfqSzU/XZ+YOJ+H15mNmiHB80sRJ3JK9AyERLMIHxYtYr5ak2orckX1nFFCzT2joeXmCIMOUeQrbaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d82f9cd496b6688d3a948c4acad88646adfc18bb3a6d22b0c06da7963fd67c8","last_reissued_at":"2026-05-17T23:55:08.060007Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:08.060007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09275","source_version":3,"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-17T23:55:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p469G4vW9YWKv6oX680L3iRdYAWY5B19xD5Vjh1k4sMaikgiRzYIXHrOIlUgGUofQWXxQ0q87QCztIznltbjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:56:42.130898Z"},"content_sha256":"be00d900cb5d005b928b9b760b82d2c89cae7645d014e54d467b12ef16be8b36","schema_version":"1.0","event_id":"sha256:be00d900cb5d005b928b9b760b82d2c89cae7645d014e54d467b12ef16be8b36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BWBPTTKJNNTIRU5JJDCKZLMIMR","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-10-25T14:49: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":"1710.09275","kind":"arxiv","version":3},"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-17T23:55:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52h0g1EXtOfEyCH66+YdXxg1bLm8m4+fsKfVZQLFnMXQ7vhI9+WfEFFVmfYO6kGN4PdOQ3hGuJ0ILrsTj9pBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:56:42.131558Z"},"content_sha256":"c4daaeb0912a953ae4870f4cfba5fe711b1418bb135bce7d369fcac218cafc16","schema_version":"1.0","event_id":"sha256:c4daaeb0912a953ae4870f4cfba5fe711b1418bb135bce7d369fcac218cafc16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWBPTTKJNNTIRU5JJDCKZLMIMR/bundle.json","state_url":"https://pith.science/pith/BWBPTTKJNNTIRU5JJDCKZLMIMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWBPTTKJNNTIRU5JJDCKZLMIMR/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-25T18:56:42Z","links":{"resolver":"https://pith.science/pith/BWBPTTKJNNTIRU5JJDCKZLMIMR","bundle":"https://pith.science/pith/BWBPTTKJNNTIRU5JJDCKZLMIMR/bundle.json","state":"https://pith.science/pith/BWBPTTKJNNTIRU5JJDCKZLMIMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWBPTTKJNNTIRU5JJDCKZLMIMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BWBPTTKJNNTIRU5JJDCKZLMIMR","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":"885886618a386e76c1a8a53587c96fee5c90081c249663dc99fd26100d777e9c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T14:49:31Z","title_canon_sha256":"71773163517f3e707535e28fa22cc1a8eaa0581e1972fd5cffa99ec840019cb3"},"schema_version":"1.0","source":{"id":"1710.09275","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09275","created_at":"2026-05-17T23:55:08Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09275v3","created_at":"2026-05-17T23:55:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09275","created_at":"2026-05-17T23:55:08Z"},{"alias_kind":"pith_short_12","alias_value":"BWBPTTKJNNTI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BWBPTTKJNNTIRU5J","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BWBPTTKJ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:c4daaeb0912a953ae4870f4cfba5fe711b1418bb135bce7d369fcac218cafc16","target":"graph","created_at":"2026-05-17T23:55:08Z","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-10-25T14:49: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":"1710.09275","kind":"arxiv","version":3},"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:be00d900cb5d005b928b9b760b82d2c89cae7645d014e54d467b12ef16be8b36","target":"record","created_at":"2026-05-17T23:55:08Z","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":"885886618a386e76c1a8a53587c96fee5c90081c249663dc99fd26100d777e9c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T14:49:31Z","title_canon_sha256":"71773163517f3e707535e28fa22cc1a8eaa0581e1972fd5cffa99ec840019cb3"},"schema_version":"1.0","source":{"id":"1710.09275","kind":"arxiv","version":3}},"canonical_sha256":"0d82f9cd496b6688d3a948c4acad88646adfc18bb3a6d22b0c06da7963fd67c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d82f9cd496b6688d3a948c4acad88646adfc18bb3a6d22b0c06da7963fd67c8","first_computed_at":"2026-05-17T23:55:08.060007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:08.060007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u0lHjbiPfqSzU/XZ+YOJ+H15mNmiHB80sRJ3JK9AyERLMIHxYtYr5ak2orckX1nFFCzT2joeXmCIMOUeQrbaDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:08.060592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09275","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be00d900cb5d005b928b9b760b82d2c89cae7645d014e54d467b12ef16be8b36","sha256:c4daaeb0912a953ae4870f4cfba5fe711b1418bb135bce7d369fcac218cafc16"],"state_sha256":"7dbc3183eff9715d0bad29a8bb16bdbdc35013bfc505c785dcfd1aec40e00555"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l5ML1zYCbr3YmrJJoWA/GJ1eikvwRFmkn2Ykgyo13vT4pNb7CRuffiRBLHyO1Jj+BQczRT9BvP0RUHlQU7y4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:56:42.135241Z","bundle_sha256":"ce60f177af4dcde6e76cdf8ce0908e318922df87016fcfdd0dcde1cd838feaa9"}}