{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B3S52BIQBLZ6SOUVS4RNQV6JTZ","short_pith_number":"pith:B3S52BIQ","schema_version":"1.0","canonical_sha256":"0ee5dd05100af3e93a959722d857c99e4311760a67d1a642fc400a0db297a00b","source":{"kind":"arxiv","id":"1511.09024","version":5},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.09024","created_at":"2026-05-18T00:43:39.806148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.09024v5","created_at":"2026-05-18T00:43:39.806148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09024","created_at":"2026-05-18T00:43:39.806148+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3S52BIQBLZ6","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3S52BIQBLZ6SOUV","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3S52BIQ","created_at":"2026-05-18T12:29:14.074870+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/B3S52BIQBLZ6SOUVS4RNQV6JTZ","json":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ.json","graph_json":"https://pith.science/api/pith-number/B3S52BIQBLZ6SOUVS4RNQV6JTZ/graph.json","events_json":"https://pith.science/api/pith-number/B3S52BIQBLZ6SOUVS4RNQV6JTZ/events.json","paper":"https://pith.science/paper/B3S52BIQ"},"agent_actions":{"view_html":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ","download_json":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ.json","view_paper":"https://pith.science/paper/B3S52BIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.09024&json=true","fetch_graph":"https://pith.science/api/pith-number/B3S52BIQBLZ6SOUVS4RNQV6JTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/B3S52BIQBLZ6SOUVS4RNQV6JTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/action/storage_attestation","attest_author":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/action/author_attestation","sign_citation":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/action/citation_signature","submit_replication":"https://pith.science/pith/B3S52BIQBLZ6SOUVS4RNQV6JTZ/action/replication_record"}},"created_at":"2026-05-18T00:43:39.806148+00:00","updated_at":"2026-05-18T00:43:39.806148+00:00"}