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: "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"
  Abstract: We consider a distributed antenna system where $L$ antenna terminals (ATs) are connected to a Central Processor (CP) via digital error-free links of finite capacity $R_0$, and serve $L$ user terminals (UTs). This system model has been widely investigated both for the uplink and the downlink, which are instances of the general multiple-access relay and broadcast relay networks. In this work we focus on the downlink, and propose a novel downlink precoding scheme nicknamed "Reverse Quantized Compute and Forward" (RQCoF). For this scheme we obtain achievable rates and compare with the state of the art available in the literature. We also provide simulation results for a realistic network with fading and pathloss with $K > L$ UTs, and show that channel-based user selection produces large benefits and essentially removes the problem of rank deficiency in the system matrix.

Connected through hyperedge HE-1 (induced by source paper "optimization of integer forcing precoding for multi user mimo downlink"):
  with members:
    - "on integer forcing precoding for the gaussian mimo broadcast channel"
    - "integer forcing linear receivers"

Connected through hyperedge HE-2 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "a joint typicality approach to algebraic network information theory"
    - "secure compute and forward in a bidirectional relay"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiple access via compute and forward"
    - "lattices over eisenstein integers for compute and forward"
    - "uplink downlink duality for integer forcing"

Connected through hyperedge HE-3 (induced by source paper "on integer forcing precoding for the gaussian mimo broadcast channel"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "full diversity unitary precoded integer forcing"
    - "optimal multiuser transmit beamforming a difficult problem with a simple solution structure"
    - "uplink downlink duality for integer forcing"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "integer forcing linear receivers"

Connected through hyperedge HE-4 (induced by source paper "uplink downlink duality for integer forcing"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "lattices over eisenstein integers for compute and forward"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "integer forcing source coding"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "integer forcing mimo linear receivers based on lattice reduction"

Connected through hyperedge HE-5 (induced by source paper "structured lattice codes for some two user gaussian networks with cognition coordination and two hops"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on interference networks over finite fields"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "the degrees of freedom of compute and forward"
    - "quantized compute and forward a low complexity architecture for distributed antenna systems"

Connected through hyperedge HE-6 (induced by source paper "precoded integer forcing universally achieves the mimo capacity to within a constant gap"):
  with members:
    - "successive integer forcing and its sum rate optimality"
    - "structured lattice codes for 2 times 2 times 2 mimo interference channel"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "wireless network information flow a deterministic approach"
    - "integer forcing linear receivers"

Connected through hyperedge HE-7 (induced by source paper "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks"):
  with members:
    - "decomposition by partial linearization parallel optimization of multi agent systems"
    - "distributed robust multicell coordinated beamforming with imperfect csi an admm approach"
    - "robust and efficient distributed compression for cloud radio access networks"
    - "decomposition by successive convex approximation a unifying approach for linear transceiver design in heterogeneous networks"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "optimized data sharing in multicell mimo with finite backhaul capacity"
    - "quantized compute and forward a low complexity architecture for distributed antenna systems"
    - "multiuser miso transmitter optimization for intercell interference mitigation"

Connected through hyperedge HE-8 (induced by source paper "integer forcing linear receivers"):
  with members:
    - "lattices over eisenstein integers for compute and forward"
    - "successive integer forcing and its sum rate optimality"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "an algebraic approach to physical layer network coding"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "achieving a vanishing snr gap to exact lattice decoding at a subexponential complexity"
    - "compute and forward strategies for cooperative distributed antenna systems"

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)