{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2D2JTXEXQIQGDUPY5SJA53LGBG","short_pith_number":"pith:2D2JTXEX","schema_version":"1.0","canonical_sha256":"d0f499dc97822061d1f8ec920eed66098cd53f9fd897d946f9c154b8dbaa7b17","source":{"kind":"arxiv","id":"1711.06983","version":1},"attestation_state":"computed","paper":{"title":"Enhanced Group Sparse Beamforming for Green Cloud-RAN: A Random Matrix Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Zhang, Khaled B. Letaief, Wei Chen, Yuanming Shi","submitted_at":"2017-11-19T08:40:38Z","abstract_excerpt":"Group sparse beamforming is a general framework to minimize the network power consumption for cloud radio access networks (Cloud-RANs), which, however, suffers high computational complexity. In particular, a complex optimization problem needs to be solved to obtain the remote radio head (RRH) ordering criterion in each transmission block, which will help to determine the active RRHs and the associated fronthaul links. In this paper, we propose innovative approaches to reduce the complexity of this key step in group sparse beamforming. Specifically, we first develop a smoothed $\\ell_p$-minimiza"},"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":"1711.06983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-19T08:40:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b9a02f3b4e8e9f06a729401e8e8e7e4584ac74a5edbd99d0279c76f124abc53","abstract_canon_sha256":"0df2df24ef8d3363cc1e7561609b2dfd00e46436a53a1d2eaa3fff59daedd5f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:14.926739Z","signature_b64":"+J7Mmu6qtFpdP2jiGvzzmJiA3qh9BPdLbKYeAmbzJoNcu4tcnLHTgm0PcE+2HUPBqYeq7x485BlQXCqc+PgfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0f499dc97822061d1f8ec920eed66098cd53f9fd897d946f9c154b8dbaa7b17","last_reissued_at":"2026-05-18T00:30:14.926060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:14.926060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhanced Group Sparse Beamforming for Green Cloud-RAN: A Random Matrix Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Zhang, Khaled B. Letaief, Wei Chen, Yuanming Shi","submitted_at":"2017-11-19T08:40:38Z","abstract_excerpt":"Group sparse beamforming is a general framework to minimize the network power consumption for cloud radio access networks (Cloud-RANs), which, however, suffers high computational complexity. In particular, a complex optimization problem needs to be solved to obtain the remote radio head (RRH) ordering criterion in each transmission block, which will help to determine the active RRHs and the associated fronthaul links. In this paper, we propose innovative approaches to reduce the complexity of this key step in group sparse beamforming. Specifically, we first develop a smoothed $\\ell_p$-minimiza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06983","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.06983","created_at":"2026-05-18T00:30:14.926181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06983v1","created_at":"2026-05-18T00:30:14.926181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06983","created_at":"2026-05-18T00:30:14.926181+00:00"},{"alias_kind":"pith_short_12","alias_value":"2D2JTXEXQIQG","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2D2JTXEXQIQGDUPY","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2D2JTXEX","created_at":"2026-05-18T12:30:55.937587+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/2D2JTXEXQIQGDUPY5SJA53LGBG","json":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG.json","graph_json":"https://pith.science/api/pith-number/2D2JTXEXQIQGDUPY5SJA53LGBG/graph.json","events_json":"https://pith.science/api/pith-number/2D2JTXEXQIQGDUPY5SJA53LGBG/events.json","paper":"https://pith.science/paper/2D2JTXEX"},"agent_actions":{"view_html":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG","download_json":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG.json","view_paper":"https://pith.science/paper/2D2JTXEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06983&json=true","fetch_graph":"https://pith.science/api/pith-number/2D2JTXEXQIQGDUPY5SJA53LGBG/graph.json","fetch_events":"https://pith.science/api/pith-number/2D2JTXEXQIQGDUPY5SJA53LGBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/action/storage_attestation","attest_author":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/action/author_attestation","sign_citation":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/action/citation_signature","submit_replication":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/action/replication_record"}},"created_at":"2026-05-18T00:30:14.926181+00:00","updated_at":"2026-05-18T00:30:14.926181+00:00"}