{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LIAJRMN3CDBZT5AWWMGLM4PN7K","short_pith_number":"pith:LIAJRMN3","schema_version":"1.0","canonical_sha256":"5a0098b1bb10c399f416b30cb671edfaa49cbe66944feaa50302ad03d156a19f","source":{"kind":"arxiv","id":"1503.08585","version":3},"attestation_state":"computed","paper":{"title":"The Complexity-Rate Tradeoff of Centralized Radio Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Matthew C. Valenti, Peter Rost, Salvatore Talarico","submitted_at":"2015-03-30T08:12:30Z","abstract_excerpt":"In a centralized RAN, the signals from multiple RAPs are processed centrally in a data center. Centralized RAN enables advanced interference coordination strategies while leveraging the elastic provisioning of data processing resources. It is particularly well suited for dense deployments, such as within a large building where the RAPs are connected via fibre and many cells are underutilized. This paper considers the computational requirements of centralized RAN with the goal of illuminating the benefits of pooling computational resources. A new analytical framework is proposed for quantifying"},"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":"1503.08585","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T08:12:30Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"299157c4ab5a994681d954899cc8c9f6049d966cfe74af4950b7cf7dbe09e4cd","abstract_canon_sha256":"ead5f5385d5c0a39e8a3921f24f79d2b70f676fc88c7bb33375e83f89263cbff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:34.882839Z","signature_b64":"HXSgZA4IVZXyMFMukSs460TPwztfYafR9SSa5qkKTlnHqLQLS6GNdLn1XFVYU2AlKXJPG5oXX5fO0g6nxjEhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a0098b1bb10c399f416b30cb671edfaa49cbe66944feaa50302ad03d156a19f","last_reissued_at":"2026-05-18T01:35:34.882124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:34.882124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity-Rate Tradeoff of Centralized Radio Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Matthew C. Valenti, Peter Rost, Salvatore Talarico","submitted_at":"2015-03-30T08:12:30Z","abstract_excerpt":"In a centralized RAN, the signals from multiple RAPs are processed centrally in a data center. Centralized RAN enables advanced interference coordination strategies while leveraging the elastic provisioning of data processing resources. It is particularly well suited for dense deployments, such as within a large building where the RAPs are connected via fibre and many cells are underutilized. This paper considers the computational requirements of centralized RAN with the goal of illuminating the benefits of pooling computational resources. A new analytical framework is proposed for quantifying"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08585","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.08585","created_at":"2026-05-18T01:35:34.882276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08585v3","created_at":"2026-05-18T01:35:34.882276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08585","created_at":"2026-05-18T01:35:34.882276+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIAJRMN3CDBZ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIAJRMN3CDBZT5AW","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIAJRMN3","created_at":"2026-05-18T12:29:29.992203+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/LIAJRMN3CDBZT5AWWMGLM4PN7K","json":"https://pith.science/pith/LIAJRMN3CDBZT5AWWMGLM4PN7K.json","graph_json":"https://pith.science/api/pith-number/LIAJRMN3CDBZT5AWWMGLM4PN7K/graph.json","events_json":"https://pith.science/api/pith-number/LIAJRMN3CDBZT5AWWMGLM4PN7K/events.json","paper":"https://pith.science/paper/LIAJRMN3"},"agent_actions":{"view_html":"https://pith.science/pith/LIAJRMN3CDBZT5AWWMGLM4PN7K","download_json":"https://pith.science/pith/LIAJRMN3CDBZT5AWWMGLM4PN7K.json","view_paper":"https://pith.science/paper/LIAJRMN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08585&json=true","fetch_graph":"https://pith.science/api/pith-number/LIAJRMN3CDBZT5AWWMGLM4PN7K/graph.json","fetch_events":"https://pith.science/api/pith-number/LIAJRMN3CDBZT5AWWMGLM4PN7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIAJRMN3CDBZT5AWWMGLM4PN7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIAJRMN3CDBZT5AWWMGLM4PN7K/action/storage_attestation","attest_author":"https://pith.science/pith/LIAJRMN3CDBZT5AWWMGLM4PN7K/action/author_attestation","sign_citation":"https://pith.science/pith/LIAJRMN3CDBZT5AWWMGLM4PN7K/action/citation_signature","submit_replication":"https://pith.science/pith/LIAJRMN3CDBZT5AWWMGLM4PN7K/action/replication_record"}},"created_at":"2026-05-18T01:35:34.882276+00:00","updated_at":"2026-05-18T01:35:34.882276+00:00"}