{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2D2JTXEXQIQGDUPY5SJA53LGBG","short_pith_number":"pith:2D2JTXEX","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"},"canonical_sha256":"d0f499dc97822061d1f8ec920eed66098cd53f9fd897d946f9c154b8dbaa7b17","source":{"kind":"arxiv","id":"1711.06983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06983","created_at":"2026-05-18T00:30:14Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06983v1","created_at":"2026-05-18T00:30:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06983","created_at":"2026-05-18T00:30:14Z"},{"alias_kind":"pith_short_12","alias_value":"2D2JTXEXQIQG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2D2JTXEXQIQGDUPY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2D2JTXEX","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2D2JTXEXQIQGDUPY5SJA53LGBG","target":"record","payload":{"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"},"canonical_sha256":"d0f499dc97822061d1f8ec920eed66098cd53f9fd897d946f9c154b8dbaa7b17","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"},"source_kind":"arxiv","source_id":"1711.06983","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:30:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"igYRN34cv6mrwxFVmG50Rv8pr+hUp5jXrl6OlTmzBEqc+irBslmSExVYV/fBymKKnPCuUFfoeyJRu9K9WNnsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:23:23.195345Z"},"content_sha256":"8e93dae0ea17cdf622f1031c6d3a2510c136ab5f72c18d4d10210b410514d7c7","schema_version":"1.0","event_id":"sha256:8e93dae0ea17cdf622f1031c6d3a2510c136ab5f72c18d4d10210b410514d7c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2D2JTXEXQIQGDUPY5SJA53LGBG","target":"graph","payload":{"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"},"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:30:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsQyubZeFHQzu7Ds70jSAEG6UHwlcKnVvSWTbgADdWivSdHzmP+6eqebumxLNLH9I4TO8CjfuQmzgRYE1+RVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:23:23.195981Z"},"content_sha256":"bd14b2f57e212add2f1e867d511e0adf2071d456a383af76efae392ece37d286","schema_version":"1.0","event_id":"sha256:bd14b2f57e212add2f1e867d511e0adf2071d456a383af76efae392ece37d286"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/bundle.json","state_url":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/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-05-27T13:23:23Z","links":{"resolver":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG","bundle":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/bundle.json","state":"https://pith.science/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2D2JTXEXQIQGDUPY5SJA53LGBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2D2JTXEXQIQGDUPY5SJA53LGBG","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":"0df2df24ef8d3363cc1e7561609b2dfd00e46436a53a1d2eaa3fff59daedd5f5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-19T08:40:38Z","title_canon_sha256":"3b9a02f3b4e8e9f06a729401e8e8e7e4584ac74a5edbd99d0279c76f124abc53"},"schema_version":"1.0","source":{"id":"1711.06983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06983","created_at":"2026-05-18T00:30:14Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06983v1","created_at":"2026-05-18T00:30:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06983","created_at":"2026-05-18T00:30:14Z"},{"alias_kind":"pith_short_12","alias_value":"2D2JTXEXQIQG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2D2JTXEXQIQGDUPY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2D2JTXEX","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:bd14b2f57e212add2f1e867d511e0adf2071d456a383af76efae392ece37d286","target":"graph","created_at":"2026-05-18T00:30:14Z","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":"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","authors_text":"Jun Zhang, Khaled B. Letaief, Wei Chen, Yuanming Shi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-19T08:40:38Z","title":"Enhanced Group Sparse Beamforming for Green Cloud-RAN: A Random Matrix Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06983","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:8e93dae0ea17cdf622f1031c6d3a2510c136ab5f72c18d4d10210b410514d7c7","target":"record","created_at":"2026-05-18T00:30:14Z","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":"0df2df24ef8d3363cc1e7561609b2dfd00e46436a53a1d2eaa3fff59daedd5f5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-19T08:40:38Z","title_canon_sha256":"3b9a02f3b4e8e9f06a729401e8e8e7e4584ac74a5edbd99d0279c76f124abc53"},"schema_version":"1.0","source":{"id":"1711.06983","kind":"arxiv","version":1}},"canonical_sha256":"d0f499dc97822061d1f8ec920eed66098cd53f9fd897d946f9c154b8dbaa7b17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0f499dc97822061d1f8ec920eed66098cd53f9fd897d946f9c154b8dbaa7b17","first_computed_at":"2026-05-18T00:30:14.926060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:14.926060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+J7Mmu6qtFpdP2jiGvzzmJiA3qh9BPdLbKYeAmbzJoNcu4tcnLHTgm0PcE+2HUPBqYeq7x485BlQXCqc+PgfBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:14.926739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e93dae0ea17cdf622f1031c6d3a2510c136ab5f72c18d4d10210b410514d7c7","sha256:bd14b2f57e212add2f1e867d511e0adf2071d456a383af76efae392ece37d286"],"state_sha256":"e3c543f65886cb4d6726adbd9984c51c5e7f2f52ad23ab81d192223d45e6fabe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lkfFTenx3PV8FAS2Dm8XgQgLk2Dd1jPY2kivr2vcAT1d4XnfFSSVhQV2cIbao97CyOMN31z8Qo4oqgpVFx9Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:23:23.198990Z","bundle_sha256":"9aa54eaf7034174004cfb863381b8911fa154805c144b5b8625dbb919ed191c8"}}