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: "enhanced transmit antenna selection scheme for secure throughput maximization without csi at the transmitter and its applications on smart grids"
  Abstract: This paper addresses the establishment of secure communication links between smart-meters (Alice) and an aggregator (Bob) in the presence of an eavesdropper (Eve). The proposed scenario assumes: (i) MIMOME wiretap channel; (ii) transmit antenna selection at the Alice; (iii) no channel state information at the transmitter; (iv) fixed Wyner codes; and (v) guarantee of secure throughput by both quality of service and secrecy outage constraints. We propose a simple protocol to enhance security via transmit antenna selection, and then assess its performance in closed-form by means of secrecy outage and successful transmission probabilities. We assume these probabilities are our constraints and then maximize the secure throughput, establishing a security-reliability trade-off for the proposed scenario. Our numerical results illustrate the effect of this trade-off on the secure throughput as well as on the number of antennas at Alice, Bob and Eve. Interestingly, a small sacrifice in reliability allows secrecy enhancement in terms of secure bps/Hz. We apply this idea in our smart grid application to exemplify that, although Eve may acquire some samples of the average power demand of a household, it is not enough to properly reconstruct such curve.

Connected through hyperedge HE-1 (induced by source paper "maximizing the link throughput between smart meters and aggregators as secondary users under power and outage constraints"):
  with members:
    - "what can wireless cellular technologies do about the upcoming smart metering traffic"
    - "on the joint impact of beamwidth and orientation error on throughput in directional wireless poisson networks"
    - "models for the modern power grid"
    - "machine learning in wireless sensor networks algorithms strategies and applications"
    - "throughput analysis of cognitive wireless networks with poisson distributed nodes based on location information"
    - "an overview of the transmission capacity of wireless networks"
    - "the effect of fading channel inversion and threshold scheduling on ad hoc networks"

Connected through hyperedge HE-2 (induced by source paper "throughput maximization in multi hop wireless networks under secrecy constraint"):
  with members:
    - "maximizing the link throughput between smart meters and aggregators as secondary users under power and outage constraints"
    - "on the secrecy of interference limited networks under composite fading channels"
    - "on the performance of secure full duplex relaying under composite fading channels"
    - "improving physical layer security in wireless communications using diversity techniques"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "five disruptive technology directions for 5g"
    - "an overview of the transmission capacity of wireless networks"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"

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)