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 "best relay selection in gaussian half duplex diamond networks"):
  Abstract: This paper considers Gaussian half-duplex diamond $n$-relay networks, where a source communicates with a destination by hopping information through one layer of $n$ non-communicating relays that operate in half-duplex. The main focus consists of investigating the following question: What is the contribution of a single relay on the approximate capacity of the entire network? In particular, approximate capacity refers to a quantity that approximates the Shannon capacity within an additive gap which only depends on $n$, and is independent of the channel parameters. This paper answers the above question by providing a fundamental bound on the ratio between the approximate capacity of the highest-performing single relay and the approximate capacity of the entire network, for any number $n$. Surprisingly, it is shown that such a ratio guarantee is $f = 1/(2+2\cos(2\pi/(n+2)))$, that is a sinusoidal function of $n$, which decreases as $n$ increases. It is also shown that the aforementioned ratio guarantee is tight, i.e., there exist Gaussian half-duplex diamond $n$-relay networks, where the highest-performing relay has an approximate capacity equal to an $f$ fraction of the approximate capacity of the entire network.

Includes members:
  Member "efficiently finding simple schedules in gaussian half duplex relay line networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "queue aware beam scheduling for half duplex mmwave relay networks")
  Member "on the optimality of simple schedules for networks with multiple half duplex relays":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the approximate optimality of simple schedules for half duplex multi relay networks")
  Member "softnull many antenna full duplex wireless via digital beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "full duplex hybrid a d beamforming with reduced complexity multi tap analog cancellation")
  Member "wireless communications with unmanned aerial vehicles opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "unmanned aerial vehicle with underlaid device to device communications performance and tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "performance analysis of mobile cellular connected drones under practical antenna configurations")
  Member "wireless network simplification beyond diamond networks":
    also connected through other hyperedges:
      (none)
  Member "design and characterization of a full duplex multiantenna system for wifi networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "gaussian half duplex relay networks improved constant gap and connections with the assignment problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polynomial time capacity calculation and scheduling for half duplex 1 2 1 networks")

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)