human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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).

Includes members:
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "noisy network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation")
  Member "approximately achieving gaussian relay network capacity with lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks")
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval over gaussian mac")
  Member "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lattice coding for downlink multiuser transmission")

Question: Please tell me which class the source paper 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)