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: "ideal node enquiry search algorithm inesh in manets"
  Abstract: The different routing protocols in Mobile Ad hoc Networks take after various methodologies to send the data starting from one node then onto the next. The nodes in the system are non-static and they move arbitrarily and are inclined to interface disappointment which makes dependably to discover new routes to the destination. During the forwarding of packets to the destination, various intermediate nodes take part in routing, where such node should be an ideal node. An algorithm is proposed here to know the ideal node after studying the features of the reactive routing protocols. The malicious node can be eliminated from the networking function and the overhead on the protocol can be reduced. The node chooses the neighbor which can be found in less number of bounces and with less time delay and keeping up the QoS.

Connected through hyperedge HE-1 (induced by source paper "secured approach towards reactive routing protocols using triple factor in mobile adhoc networks"):
  with members:
    - "an enhanced multipath strategy in mobile ad hoc routing protocols"
    - "a survey of distributed certificate authorities in manets"
    - "treatment of reactive routing protocols using second chance based on malicious behavior of nodes in manets"

Connected through hyperedge HE-2 (induced by source paper "named entity recognition system for sindhi language"):
  with members:
    - "natural language processing almost from scratch"

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)