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 achievable rates of the diamond relay channel with conferencing links"):
  Abstract: We consider a half-duplex diamond relay channel, which consists of one source-destination pair and two relay nodes connected with two-way rate-limited out-of-band conferencing links. Three basic schemes and their achievable rates are studied: For the decode-and-forward (DF) scheme, we obtain the achievable rate by letting the source send a common message and two private messages; for the compress-and-forward (CF) scheme, we exploit the conferencing links to help with the compression of the received signals, or to exchange messages intended for the second hop to introduce certain cooperation; for the amplify-and-forward (AF) scheme, we study the optimal combining strategy between the received signals from the source and the conferencing link. Moreover, we show that these schemes could achieve the capacity upper bound under certain conditions. Finally, we evaluate the various rates for the Gaussian case with numerical results.

Includes members:
  Member "the approximate capacity of the gaussian n relay diamond network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalized degrees of freedom of noncoherent 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 "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  Member "compound multiple access channels with partial cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation")
  Member "capacity of a class of diamond channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized compression strategy for the downlink cloud radio access network")
  Member "broadcast channels with cooperating decoders":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the capacity on degraded relay broadcast 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)