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: "quantized compute and forward a low complexity architecture for distributed antenna systems"
  Abstract: We consider a low-complexity version of the Compute and Forward scheme that involves only scaling, offset (dithering removal) and scalar quantization at the relays. The proposed scheme is suited for the uplink of a distributed antenna system where the antenna elements must be very simple and are connected to a oint processor via orthogonal perfect links of given rate R0. We consider the design of non-binary LDPC codes naturally matched to the proposed scheme. Each antenna element performs individual (decentralized) Belief Propagation decoding of its own quantized signal, and sends a linear combination of the users' information messages via the noiseless link to the joint processor, which retrieves the users' messages by Gaussian elimination. The complexity of this scheme is linear in the coding block length and polynomial in the system size (number of relays).

Connected through hyperedge HE-1 (induced by source paper "cloud compute and forward with relay cooperation"):
  with members:
    - "compute and forward on a multi user multi relay channel"
    - "compute and forward on a multiaccess relay channel coding and symmetric rate optimization"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "wireless network information flow a deterministic approach"
    - "compute and forward harnessing interference through structured codes"
    - "physical layer network coding"

Connected through hyperedge HE-2 (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"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"
    - "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"

Connected through hyperedge HE-3 (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"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna 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"
    - "multiuser miso transmitter optimization for intercell interference mitigation"

Connected through hyperedge HE-4 (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"
    - "integer forcing linear receivers"
    - "approximately optimal wireless broadcasting"
    - "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-5 (induced by source paper "robust and efficient distributed compression for cloud radio access networks"):
  with members:
    - "minimum expected distortion in gaussian source coding with fading side information"
    - "uplink comp under a constrained backhaul and imperfect channel knowledge"
    - "successive wyner ziv coding scheme and its application to the quadratic gaussian ceo problem"
    - "distributed mimo receiver achievable rates and upper bounds"

Connected through hyperedge HE-6 (induced by source paper "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"):
  with members:
    - "integer forcing linear receivers"
    - "mimo broadcast channel optimization under general linear constraints"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-7 (induced by source paper "regenerative and adaptive schemes based on network coding for wireless relay network"):
  with members:
    - "coding and system design for quantize map and forward relaying"
    - "wireless network information flow a deterministic approach"

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"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "achieving a vanishing snr gap to exact lattice decoding at a subexponential complexity"

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)