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: "constrained colluding eavesdroppers an information theoretic model"
  Abstract: We study the secrecy capacity in the vicinity of colluding eavesdroppers. Contrary to the perfect collusion assumption in previous works, our new information-theoretic model considers constraints in collusion. We derive the achievable secure rates (lower bounds on the perfect secrecy capacity), both for the discrete memoryless and Gaussian channels. We also compare the proposed rates to the non-colluding and perfect colluding cases.

Connected through hyperedge HE-1 (induced by source paper "secrecy capacity scaling in large cooperative wireless networks"):
  with members:
    - "scaling laws for secrecy capacity in cooperative wireless networks"
    - "multi receiver wiretap channel with public and confidential messages"
    - "secure diversity multiplexing tradeoff of zero forcing transmit scheme at finite snr"
    - "an overview of the transmission capacity of wireless networks"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "diversity multiplexing tradeoff for the multiple antenna wire tap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-2 (induced by source paper "scaling laws for secrecy capacity in cooperative wireless networks"):
  with members:
    - "multi receiver wiretap channel with public and confidential messages"
    - "secure diversity multiplexing tradeoff of zero forcing transmit scheme at finite snr"
    - "an overview of the transmission capacity of wireless networks"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "diversity multiplexing tradeoff for the multiple antenna wire tap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the secrecy capacity of the mimo wiretap channel"

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)