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 "partial decode forward relaying for the gaussian two hop relay network"):
  Abstract: The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate through degraded sets of message parts, achieves the cutset upper bound within $(1/2)\log N$ bits regardless of the channel gains and power constraints. This scheme improves upon a previous scheme by Chern and Ozgur, which is also based on partial decode--forward yet has an unbounded gap from the cutset bound for $L \ge 2$ destinations. When specialized to independent codes among relays, the proposed scheme achieves within $\log N$ bits from the cutset bound. The computation of this relaxation involves evaluating mutual information across $L(N+1)$ cuts out of the total $L 2^N$ possible cuts, providing a very simple linear-complexity algorithm to approximate the single-source multicast capacity of the Gaussian two-hop relay network.

Includes members:
  Member "achieving the capacity of the n relay gaussian diamond network within log n bits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the arbitrarily varying relay channel")
  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 "slepian wolf coding over cooperative relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "wireless network simplification the gaussian n relay diamond network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "noisy network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation")

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)