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 "distributed decode forward for relay networks"):
  Abstract: A new coding scheme for general N-node relay networks is presented for unicast, multicast, and broadcast. The proposed distributed decode-forward scheme combines and generalizes Marton coding for single-hop broadcast channels and the Cover-El Gamal partial decode-forward coding scheme for 3-node relay channels. The key idea of the scheme is to precode all the codewords of the entire network at the source by multicoding over multiple blocks. This encoding step allows these codewords to carry partial information of the messages implicitly without complicated rate splitting and routing. This partial information is then recovered at the relay nodes and forwarded further. For N-node Gaussian unicast, multicast, and broadcast relay networks, the scheme achieves within 0.5N bits from the cutset bound and thus from the capacity (region), regardless of the network topology, channel gains, or power constraints. Roughly speaking, distributed decode-forward is dual to noisy network coding, which generalized compress-forward to unicast, multicast, and multiple access relay networks.

Includes members:
  Member "partial decode forward relaying for the gaussian two hop relay network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coding schemes for discrete memoryless multicast networks with rate limited feedback")
  Member "noisy network coding with partial df":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation")
  Member "optimized backhaul compression for uplink cloud radio access network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm")
  Member "index coding capacity how far can one go with only shannon inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "short message noisy network coding with a decode forward option":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private information retrieval over gaussian mac")
  Member "achieving the capacity of the n relay gaussian diamond network within log n bits":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the arbitrarily varying relay channel")

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)