human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "approximately optimal wireless broadcasting"
  Abstract: We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the aid of relays and cooperation between destinations. The wireless nature of the medium is captured by the broadcast nature of transmissions as well as the superposition of all transmit signals plus independent Gaussian noise at the received signal at any radio. We propose a scheme that can achieve rate tuples within a constant gap away from the cut-set bound, where the constant is independent of channel coefficients and power constraints. #R##N#The proposed scheme operates in two steps. The inner code, in which the relays perform a quantize-and-encode operation, is constructed by lifting a scheme designed for a corresponding discrete superposition network. The outer code is a Marton code for the non-Gaussian vector broadcast channel induced by the relaying scheme, and is constructed by adopting a ``receiver-centric'' viewpoint.

Connected through hyperedge HE-1 (induced by source paper "hybrid data sharing and compression strategy for downlink cloud radio access network"):
  with members:
    - "generalized compression strategy for the downlink cloud radio access network"
    - "fronthaul compression and precoding design for c rans over ergodic fading channels"
    - "distributed decode forward for relay networks"
    - "backhaul limited asymmetric cooperation for mimo cellular networks via semidefinite relaxation"
    - "sparse beamforming and user centric clustering for downlink cloud radio access network"
    - "group sparse beamforming for green cloud ran"
    - "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks"
    - "linear precoding and equalization for network mimo with partial cooperation"

Connected through hyperedge HE-2 (induced by source paper "distributed decode forward for relay networks"):
  with members:
    - "partial decode forward relaying for the gaussian two hop relay network"
    - "noisy network coding with partial df"
    - "optimized backhaul compression for uplink cloud radio access network"
    - "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "short message noisy network coding with a decode forward option"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"

Connected through hyperedge HE-3 (induced by source paper "cut set bound is loose for gaussian relay networks"):
  with members:
    - "cover s open problem the capacity of the relay channel"
    - "improving on the cut set bound via geometric analysis of typical sets"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "improved capacity approximations for gaussian relay networks"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "a unified relay framework with both d f and c f relay nodes"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"

Connected through hyperedge HE-4 (induced by source paper "on uplink downlink duality for cellular ia"):
  with members:
    - "cellular interference alignment omni directional antennas and asymmetric configurations"
    - "cognitive wyner networks with clustered decoding"
    - "flexible backhaul design and degrees of freedom for linear interference networks"
    - "cellular interference alignment"
    - "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "wireless network information flow a deterministic approach"
    - "joint source channel coding with side information using hybrid digital analog codes"

Connected through hyperedge HE-5 (induced by source paper "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"):
  with members:
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "on capacity and optimal scheduling for the half duplex multiple relay channel"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "study of gaussian relay channels with correlated noises"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"

Connected through hyperedge HE-6 (induced by source paper "on information flow and feedback in relay networks"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "improved capacity approximations for gaussian relay networks"
    - "efficient capacity computation and power optimization for relay networks"
    - "wireless network information flow a deterministic approach"
    - "wireless network simplification the gaussian n relay diamond network"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "a theory of network equivalence parts i and ii"
    - "approximately achieving gaussian relay network capacity with lattice codes"

Connected through hyperedge HE-7 (induced by source paper "compute and forward strategies for cooperative distributed antenna systems"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "wireless network information flow a deterministic approach"
    - "quantized compute and forward a low complexity architecture for distributed antenna systems"
    - "integer forcing linear receivers"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "mimo broadcast channel optimization under general linear constraints"
    - "compute and forward harnessing interference through structured codes"
    - "distributed mimo receiver achievable rates and upper bounds"

Connected through hyperedge HE-8 (induced by source paper "capacity of multiple unicast in wireless networks a polymatroidal approach"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiuser broadcast erasure channel with feedback capacity and algorithms"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "multicommodity flows and cuts in polymatroidal networks"
    - "wireless network information flow a deterministic approach"
    - "computation alignment capacity approximation without noise accumulation"
    - "the degrees of freedom of the 2 hop 2 user interference channel with feedback"
    - "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)