{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B3S52BIQBLZ6SOUVS4RNQV6JTZ","short_pith_number":"pith:B3S52BIQ","canonical_record":{"source":{"id":"1511.09024","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-29T15:16:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"502cdfab8b58f01a8beaafab47861e9bcbca8f32ad5824b81bd891f622eca957","abstract_canon_sha256":"93330d5a8c5f21a9b5aaba992b7405dd86bc4180c78beb4b7e9014eea5f561bc"},"schema_version":"1.0"},"canonical_sha256":"0ee5dd05100af3e93a959722d857c99e4311760a67d1a642fc400a0db297a00b","source":{"kind":"arxiv","id":"1511.09024","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.09024","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.09024v5","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09024","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"B3S52BIQBLZ6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B3S52BIQBLZ6SOUV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B3S52BIQ","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B3S52BIQBLZ6SOUVS4RNQV6JTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1511.09024","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-29T15:16:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"502cdfab8b58f01a8beaafab47861e9bcbca8f32ad5824b81bd891f622eca957","abstract_canon_sha256":"93330d5a8c5f21a9b5aaba992b7405dd86bc4180c78beb4b7e9014eea5f561bc"},"schema_version":"1.0"},"canonical_sha256":"0ee5dd05100af3e93a959722d857c99e4311760a67d1a642fc400a0db297a00b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:39.806595Z","signature_b64":"XpWHXsS9wRD57JUfsoqv1A6nsSdzODlpPkIsAxwb7BP8TGDrXdHAqCfVfE+wDFJEJ4iF6+sTpDVFBX5ajA8pBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ee5dd05100af3e93a959722d857c99e4311760a67d1a642fc400a0db297a00b","last_reissued_at":"2026-05-18T00:43:39.806073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:39.806073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.09024","source_version":5,"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:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGTMkE0JBT/BOdXtgAMLMpwpDwHBRegBZziPTKDtv66alYPDvPPb/VidAVij/vV5fFX2sh8gm0RGcex2D2SlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:12:36.074894Z"},"content_sha256":"3a0f02c456ef0e4a1692fc6f6d1ae38bfddf0af621aae865c582bbd55cc04bd4","schema_version":"1.0","event_id":"sha256:3a0f02c456ef0e4a1692fc6f6d1ae38bfddf0af621aae865c582bbd55cc04bd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B3S52BIQBLZ6SOUVS4RNQV6JTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Uplink Signal Detection in C-RANs via Randomized Gaussian Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Congmin Fan, Xiaojun Yuan, Ying Jun Zhang","submitted_at":"2015-11-29T15:16:47Z","abstract_excerpt":"Cloud Radio Access Network (C-RAN) is a promising architecture for unprecedented capacity enhancement in next-generation wireless networks thanks to the centralization and virtualization of base station processing. However, centralized signal processing in C-RANs involves high computational complexity that quickly becomes unaffordable when the network grows to a huge size. Among the first, this paper endeavours to design a scalable uplink signal detection algorithm, in the sense that both the complexity per unit network area and the total computation time remain constant when the network size "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09024","kind":"arxiv","version":5},"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:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9Q1NkzmkeQb1AxtS1hwEqHDg4WUzQFA9VPCBtaZyn58lXLLPKGy78CTC2ZEDHpBmtNOVgfv86iPhevRn8wZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:12:36.075240Z"},"content_sha256":"b8e004024cf60e0253c0ac2722b72f30b49b62441908283bc40b3ad309cb3ed4","schema_version":"1.0","event_id":"sha256:b8e004024cf60e0253c0ac2722b72f30b49b62441908283bc40b3ad309cb3ed4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/bundle.json","state_url":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/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-04T20:12:36Z","links":{"resolver":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ","bundle":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/bundle.json","state":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B3S52BIQBLZ6SOUVS4RNQV6JTZ","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":"93330d5a8c5f21a9b5aaba992b7405dd86bc4180c78beb4b7e9014eea5f561bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-29T15:16:47Z","title_canon_sha256":"502cdfab8b58f01a8beaafab47861e9bcbca8f32ad5824b81bd891f622eca957"},"schema_version":"1.0","source":{"id":"1511.09024","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.09024","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1511.09024v5","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09024","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"B3S52BIQBLZ6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B3S52BIQBLZ6SOUV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B3S52BIQ","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:b8e004024cf60e0253c0ac2722b72f30b49b62441908283bc40b3ad309cb3ed4","target":"graph","created_at":"2026-05-18T00:43:39Z","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 architecture for unprecedented capacity enhancement in next-generation wireless networks thanks to the centralization and virtualization of base station processing. However, centralized signal processing in C-RANs involves high computational complexity that quickly becomes unaffordable when the network grows to a huge size. Among the first, this paper endeavours to design a scalable uplink signal detection algorithm, in the sense that both the complexity per unit network area and the total computation time remain constant when the network size ","authors_text":"Congmin Fan, Xiaojun Yuan, Ying Jun Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-29T15:16:47Z","title":"Scalable Uplink Signal Detection in C-RANs via Randomized Gaussian Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09024","kind":"arxiv","version":5},"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:3a0f02c456ef0e4a1692fc6f6d1ae38bfddf0af621aae865c582bbd55cc04bd4","target":"record","created_at":"2026-05-18T00:43:39Z","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":"93330d5a8c5f21a9b5aaba992b7405dd86bc4180c78beb4b7e9014eea5f561bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-29T15:16:47Z","title_canon_sha256":"502cdfab8b58f01a8beaafab47861e9bcbca8f32ad5824b81bd891f622eca957"},"schema_version":"1.0","source":{"id":"1511.09024","kind":"arxiv","version":5}},"canonical_sha256":"0ee5dd05100af3e93a959722d857c99e4311760a67d1a642fc400a0db297a00b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ee5dd05100af3e93a959722d857c99e4311760a67d1a642fc400a0db297a00b","first_computed_at":"2026-05-18T00:43:39.806073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:39.806073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XpWHXsS9wRD57JUfsoqv1A6nsSdzODlpPkIsAxwb7BP8TGDrXdHAqCfVfE+wDFJEJ4iF6+sTpDVFBX5ajA8pBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:39.806595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.09024","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a0f02c456ef0e4a1692fc6f6d1ae38bfddf0af621aae865c582bbd55cc04bd4","sha256:b8e004024cf60e0253c0ac2722b72f30b49b62441908283bc40b3ad309cb3ed4"],"state_sha256":"48e45e43fd4beb6af694aff13d5cd4e0b9066b04acc8acb05f46e0746bc3bf1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kz36BaBWf3Zj+MeHGO0vm7ule7/3FMkpBgcN3ukXk7F1J386JNC2E/0nmmkGOuYpn1LuXnU4Mgx+kPd9YkmxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:12:36.077294Z","bundle_sha256":"1ecc8fe175e181985b6140f7e40c54ae3f8cfb6e44d52e1270c7e420b8be5fb9"}}