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 "on the capacity of the half duplex diamond channel"):
  Abstract: In this paper, a dual-hop communication system composed of a source S and a destination D connected through two non-interfering half-duplex relays, R 1  and R 2 , is considered. In the literature of Information Theory, this configuration is known as the diamond channel. In this setup, four transmission modes are present, namely: 1) S transmits, and R 1  and R 2  listen (broadcast mode), 2) S transmits, R 1  listens, and simultaneously, R 2  transmits and D listens. 3) S transmits, R 2  listens, and simultaneously, R 1  transmits and D listens. 4) R 1 , R 2  transmit, and D listens (multiple-access mode). Assuming a constant power constraint for all transmitters, a parameter Δ is defined, which captures some important features of the channel. It is proven that for Δ=0 the capacity of the channel can be attained by successive relaying, i.e, using modes 2 and 3 defined above in a successive manner. This strategy may have an infinite gap from the capacity of the channel when Δ≠0. To achieve rates as close as 0.71 bits to the capacity, it is shown that the cases of Δ > 0 and Δ   0, respectively. Furthermore, it is established that under average power constraints the aforementioned strategies achieve rates as close as 3.6 bits to the capacity of the channel.

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 "a new achievable rate for the gaussian parallel relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of the binary symmetric parallel relay network")
  Member "capacity of a class of diamond channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generalized compression strategy for the downlink cloud radio access network")
  Member "cooperative strategies for the half duplex gaussian parallel relay channel simultaneous relaying versus successive relaying":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the achievable rates of multihop virtual full duplex relay channels")
  Member "dmt of multi hop cooperative networks part i basic results":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multistage relaying using interference networks")
  Member "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multistage relaying using interference networks")
  Member "on the diversity multiplexing tradeoff in multiple relay network":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multiplexing gain of amplify forward relaying in wireless multi antenna relay networks")
  Member "a deterministic approach to wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the deterministic sum capacity of the multiple access wiretap 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)