{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z3MDAYWYQ3TFQXQVV7NPQQBMRC","short_pith_number":"pith:Z3MDAYWY","canonical_record":{"source":{"id":"1706.08762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T10:10:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e4e03fcb6b831f2f56f12520b39cfa037a9e369db10f5ed034ea1a18c84f82dc","abstract_canon_sha256":"ac5315252f86cbbbd72e28e36fab89185da7b18cc29344b8259fc1b6f00c75f6"},"schema_version":"1.0"},"canonical_sha256":"ced83062d886e6585e15afdaf8402c888542b2265a578f4385e6519a366ed6f2","source":{"kind":"arxiv","id":"1706.08762","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08762","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08762v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08762","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"Z3MDAYWYQ3TF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z3MDAYWYQ3TFQXQV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z3MDAYWY","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z3MDAYWYQ3TFQXQVV7NPQQBMRC","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T10:10:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e4e03fcb6b831f2f56f12520b39cfa037a9e369db10f5ed034ea1a18c84f82dc","abstract_canon_sha256":"ac5315252f86cbbbd72e28e36fab89185da7b18cc29344b8259fc1b6f00c75f6"},"schema_version":"1.0"},"canonical_sha256":"ced83062d886e6585e15afdaf8402c888542b2265a578f4385e6519a366ed6f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.105470Z","signature_b64":"ulIgvGdVPnUtpRshe1Pn5DOPAManWjz/3ET4wCKWuusImfPv/mAJ90aCpNfd1z0FeIquz7yRrMTyds3LDOBcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ced83062d886e6585e15afdaf8402c888542b2265a578f4385e6519a366ed6f2","last_reissued_at":"2026-05-18T00:41:31.104863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.104863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08762","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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I72bYVg9L8y2MFPjIj1aCV4ptEyG88UCp8DmLsjaw5EnpuySnowY246Fq354zxol9S31el8X5cyEU6BQtys7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:46:11.823917Z"},"content_sha256":"3141dfdb323896a6cc01ca4c810d0b99ede07f70598d5a5697d19fdff7cfa71f","schema_version":"1.0","event_id":"sha256:3141dfdb323896a6cc01ca4c810d0b99ede07f70598d5a5697d19fdff7cfa71f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z3MDAYWYQ3TFQXQVV7NPQQBMRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Centralized and Distributed Sparsification for Low-Complexity Message Passing Algorithm in C-RAN Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alessandro Brighente, Stefano Tomasin","submitted_at":"2017-06-27T10:10:24Z","abstract_excerpt":"Cloud radio access network (C-RAN) is a promising technology for fifth-generation (5G) cellular systems. However the burden imposed by the huge amount of data to be collected (in the uplink) from the radio remote heads (RRHs) and processed at the base band unit (BBU) poses serious challenges. In order to reduce the computation effort of minimum mean square error (MMSE) receiver at the BBU the Gaussian message passing (MP) together with a suitable sparsification of the channel matrix can be used. In this paper we propose two sets of solutions, either centralized or distributed ones. In the cent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08762","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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RExwKWd5LprmSew1210kYS7hzJiByJ4BMH/V5ERD742LZ5famG6++n58bwaYDr8JHls2XTC15qmL6gBA0TuNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:46:11.824257Z"},"content_sha256":"84d1d7ba00c96279a6ffb25372e37633521befebd6050294f78e1095aef842e5","schema_version":"1.0","event_id":"sha256:84d1d7ba00c96279a6ffb25372e37633521befebd6050294f78e1095aef842e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3MDAYWYQ3TFQXQVV7NPQQBMRC/bundle.json","state_url":"https://pith.science/pith/Z3MDAYWYQ3TFQXQVV7NPQQBMRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3MDAYWYQ3TFQXQVV7NPQQBMRC/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-06-24T19:46:11Z","links":{"resolver":"https://pith.science/pith/Z3MDAYWYQ3TFQXQVV7NPQQBMRC","bundle":"https://pith.science/pith/Z3MDAYWYQ3TFQXQVV7NPQQBMRC/bundle.json","state":"https://pith.science/pith/Z3MDAYWYQ3TFQXQVV7NPQQBMRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3MDAYWYQ3TFQXQVV7NPQQBMRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z3MDAYWYQ3TFQXQVV7NPQQBMRC","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":"ac5315252f86cbbbd72e28e36fab89185da7b18cc29344b8259fc1b6f00c75f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T10:10:24Z","title_canon_sha256":"e4e03fcb6b831f2f56f12520b39cfa037a9e369db10f5ed034ea1a18c84f82dc"},"schema_version":"1.0","source":{"id":"1706.08762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08762","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08762v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08762","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"Z3MDAYWYQ3TF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z3MDAYWYQ3TFQXQV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z3MDAYWY","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:84d1d7ba00c96279a6ffb25372e37633521befebd6050294f78e1095aef842e5","target":"graph","created_at":"2026-05-18T00:41:31Z","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":"Cloud radio access network (C-RAN) is a promising technology for fifth-generation (5G) cellular systems. However the burden imposed by the huge amount of data to be collected (in the uplink) from the radio remote heads (RRHs) and processed at the base band unit (BBU) poses serious challenges. In order to reduce the computation effort of minimum mean square error (MMSE) receiver at the BBU the Gaussian message passing (MP) together with a suitable sparsification of the channel matrix can be used. In this paper we propose two sets of solutions, either centralized or distributed ones. In the cent","authors_text":"Alessandro Brighente, Stefano Tomasin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T10:10:24Z","title":"Centralized and Distributed Sparsification for Low-Complexity Message Passing Algorithm in C-RAN Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08762","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:3141dfdb323896a6cc01ca4c810d0b99ede07f70598d5a5697d19fdff7cfa71f","target":"record","created_at":"2026-05-18T00:41:31Z","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":"ac5315252f86cbbbd72e28e36fab89185da7b18cc29344b8259fc1b6f00c75f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T10:10:24Z","title_canon_sha256":"e4e03fcb6b831f2f56f12520b39cfa037a9e369db10f5ed034ea1a18c84f82dc"},"schema_version":"1.0","source":{"id":"1706.08762","kind":"arxiv","version":1}},"canonical_sha256":"ced83062d886e6585e15afdaf8402c888542b2265a578f4385e6519a366ed6f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ced83062d886e6585e15afdaf8402c888542b2265a578f4385e6519a366ed6f2","first_computed_at":"2026-05-18T00:41:31.104863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:31.104863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ulIgvGdVPnUtpRshe1Pn5DOPAManWjz/3ET4wCKWuusImfPv/mAJ90aCpNfd1z0FeIquz7yRrMTyds3LDOBcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:31.105470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3141dfdb323896a6cc01ca4c810d0b99ede07f70598d5a5697d19fdff7cfa71f","sha256:84d1d7ba00c96279a6ffb25372e37633521befebd6050294f78e1095aef842e5"],"state_sha256":"5c4a6ef0dbedffcbc5621b2b8ef19e2d2c6a967783ffb442eca7c9d003898409"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jyg10i1HxlvHOIbg5Oyqow9niwHP5cNMZKFoGZxmVgY8dYktvpmyz72CowwFaqGmxg6fWTfC+2L+O3nQb56wCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:46:11.826185Z","bundle_sha256":"1beca3bb6d6f452a5c5607f6eb49d1d598f2dacaa9428d1e2129f4cefbb31696"}}