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: "peer to peer network simulators an analytical review"
  Abstract: Simulators are the most dominant and eminent tool for analyzing and investigating different type of networks. The simulations can be executed with less cost as compared to large scale experiment as less computational resources are required and if the simulation model is carefully designed then it can be more practical than any well brought-up mathematical model. Generally P2P research is based on the principle of simulate first and then experiment in the real world and there is no reason that simulation results cannot be reproducible. A lack of standard documentation makes verification of results harder as well as due to such poor documentation implementation of well-known overlay algorithms was very difficult. This Paper describes different types of existing P2P simulators as well as provides a survey and comparison of existing P2P simulators and extracting the best simulator among them.

Connected through hyperedge HE-1 (induced by source paper "sit a lightweight encryption algorithm for secure internet of things"):
  with members:
    - "security analysis of secure force algorithm for wireless sensor networks"
    - "symmetric algorithm survey a comparative analysis"
    - "internet of things iot a vision architectural elements and future directions"
    - "security risk analysis in peer 2 peer system an approach towards surmounting security challenges"

Connected through hyperedge HE-2 (induced by source paper "security analysis of secure force algorithm for wireless sensor networks"):
  with members:
    - "symmetric algorithm survey a comparative analysis"
    - "security risk analysis in peer 2 peer system an approach towards surmounting security challenges"

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.NI(Networking and Internet Architecture)