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: "gaussian 1 2 1 networks capacity results for mmwave communications"
  Abstract: Ahstract-This paper proposes a new model for wireless relay networks referred to as “1-2-1 network”, where two nodes can communicate only if they point “beams” at each other, while if they do not point beams at each other, no signal can be exchanged or interference can be generated. This model is motivated by millimeter wave communications where, due to the high path loss, a link between two nodes can exist only if beamforming gain at both sides is established, while in the absence of beamforming gain the signal is received well below the thermal noise floor. The main result in this paper is that the 1-2-1 network capacity can be approximated by routing information along at most 2N + 2 paths, where  $N$  is the number of relays connecting a source and a destination through an arbitrary topology.

Connected through hyperedge HE-1 (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"
    - "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"
    - "efficiently finding simple schedules in gaussian half duplex relay line networks"

Connected through hyperedge HE-2 (induced by source paper "dual band fading multiple access relay channels"):
  with members:
    - "secure communication over 1 2 1 networks"
    - "beam management for millimeter wave beamspace mu mimo systems"
    - "millimeter wave beam selection using out of band spatial information"
    - "downlink and uplink cell association with traditional macrocells and millimeter wave small cells"
    - "link regime and power savings of decode forward relaying in fading channels"
    - "joint millimeter wave and microwave resources allocation in cellular networks with dual mode base stations"
    - "hybrid millimeter wave systems a novel paradigm for hetnets"

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

Connected through hyperedge HE-4 (induced by source paper "secure communication over 1 2 1 networks"):
  with members:
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"

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)