human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "efficiently finding simple schedules in gaussian half duplex relay line networks"
  Abstract: The problem of operating a Gaussian Half-Duplex (HD) relay network optimally is challenging due to the exponential number of listen/transmit network states that need to be considered. Recent results have shown that, for the class of Gaussian HD networks with $N$ relays, there always exists a $simple$ schedule, i.e., with at most $N+1$ active states, that is sufficient for approximate (i.e., up to a constant gap) capacity characterization. This paper investigates how to efficiently find such a simple schedule over line networks. Towards this end, a polynomial-time algorithm is designed and proved to output a simple schedule that achieves the approximate capacity. The key ingredient of the algorithm is to leverage similarities between network states in HD and edge coloring in a graph. It is also shown that the algorithm allows to derive a closed-form expression for the approximate capacity of the Gaussian line network that can be evaluated distributively and in linear time.

Connected through hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks"):
  with members:
    - "on the optimality of simple schedules for networks with multiple half duplex relays"
    - "softnull many antenna full duplex wireless via digital beamforming"
    - "wireless communications with unmanned aerial vehicles opportunities and challenges"
    - "unmanned aerial vehicle with underlaid device to device communications performance and tradeoffs"
    - "wireless network simplification beyond diamond networks"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-2 (induced by source paper "queue aware beam scheduling for half duplex mmwave relay networks"):
  with members:
    - "fully partially connected hybrid beamforming architectures for mmwave mu mimo"
    - "efficient beam alignment for mmwave single carrier systems with hybrid mimo transceivers"
    - "gaussian 1 2 1 networks capacity results for mmwave communications"
    - "a new backpressure algorithm for joint rate control and routing with vanishing utility optimality gaps and finite queue lengths"
    - "towards fast convergence low delay and low complexity network optimization"

Connected through hyperedge HE-3 (induced by source paper "polynomial time capacity calculation and scheduling for half duplex 1 2 1 networks"):
  with members:
    - "gaussian 1 2 1 networks capacity results for mmwave communications"
    - "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"
    - "efficient capacity computation and power optimization for relay networks"

Question: Please tell me which class the center node 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)