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 "the approximate capacity of the gaussian n relay diamond network"):
  Abstract: We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains, and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound.

Includes members:
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "on the capacity of the half duplex diamond channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "the balanced unicast and multicast capacity regions of large wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless networks")
  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 "on capacity scaling in arbitrary wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "throughput scaling of covert communication over wireless adhoc networks")
  Member "a new achievable rate for the gaussian parallel relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the capacity of the binary symmetric parallel relay network")
  Member "interference alignment in dense wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ad hoc networking with cost effective infrastructure generalized capacity scaling")
  Member "capacity of a class of diamond channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "generalized compression strategy for the downlink cloud radio access network")

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)