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: "a trust based detection algorithm of selfish packet dropping nodes in a peer to peer wireless mesh network"
  Abstract: Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the potential to provide robust and high-throughput data delivery to wireless users. In a WMN, high speed routers equipped with advanced antennas, communicate with each other in a multi-hop fashion over wireless channels and form a broadband backhaul. However, the throughput of a WMN may be severely degraded due to presence of some selfish routers that avoid forwarding packets for other nodes even as they send their own traffic through the network. This paper presents an algorithm for detection of selfish nodes in a WMN that uses statistical theory of inference for reliable clustering of the nodes based on local observations. Simulation results show that the algorithm has a high detection rate and a low false positive rate.

Connected through hyperedge HE-1 (induced by source paper "secure and privacy preserving data aggregation protocols for wireless sensor networks"):
  with members:
    - "an attack on privacy preserving data aggregation protocol for wireless sensor networks"
    - "reputation and trust based systems for wireless self organizing networks"
    - "internet of things applications and challenges in technology and standardization"
    - "a robust and secure aggregation protocol for wireless sensor networks"
    - "a survey on wireless sensor network security"
    - "a distributed trust and reputation framework for mobile ad hoc networks"
    - "medians and beyond new aggregation techniques for sensor networks"

Connected through hyperedge HE-2 (induced by source paper "secure and energy efficient data aggregation in wireless sensor networks"):
  with members:
    - "reputation and trust based systems for wireless self organizing networks"
    - "a distributed protocol for detection of packet dropping attack in mobile ad hoc networks"
    - "a robust and secure aggregation protocol for wireless sensor networks"
    - "a survey on wireless sensor network security"
    - "a distributed trust and reputation framework for mobile ad hoc 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.CR(Cryptography and Security)