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: "nd tree a fast online algorithm for updating a pareto archive and its application in many objective pareto local search"
  Abstract: In this paper we propose a new method called ND-Tree for fast online update of a Pareto archive composed of mutually non-dominated solutions. ND-Tree uses a tree structure in which each node represents a subset of solutions contained in a hypercube defined by its local approximate ideal and nadir points. A leaf is a subset of solutions organized as a simple list, and an internal node is subset of solutions composed of the union of all its sub-nodes. Using heuristic rules we build subsets, either leafs or internal nodes, containing solutions located close in the objective space. Using basic properties of local ideal and nadir points we can efficiently avoid searching many branches in the tree. ND-Tree may be used in any multiobjective metaheuristics e.g. in an multiobjective evolutionary algorithm to update the external archive of potentially efficient solutions. We experimentally compare ND-Tree to simple list, quad-Tree, and M-Front methods using artificial and realistic benchmarks. Finally we apply ND-Tree within two-phase Pareto Local Search for traveling salesperson problems instances with up to 6 objectives. We show that with this new method substantial reduction of the computational time can be obtained.

Connected through hyperedge HE-1 (induced by source paper "many objective pareto local search"):
  with members:
    - "experimental analysis of design elements of scalarizing functions based multiobjective evolutionary algorithms"
    - "the multiobjective multidimensional knapsack problem a survey and a new approach"

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.DS(Data Structures and Algorithms)