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 new paradigm for minimax search"
  Abstract: textabstractThis paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of Pearl's Test procedure. By changing the way MT is called, a number of best-first game-tree search algorithms can be simply and elegantly constructed (including SSS*).#N#Most of the assessments of minimax search algorithms have been based on simulations.#N#However, these simulations generally do not address two of the key ingredients of high#N#performance game-playing programs: iterative deepening and memory usage. This paper#N#presents experimental data from three game-playing programs (checkers, Othello and chess),#N#covering the range from low to high branching factor. The improved move ordering due to#N#iterative deepening and memory usage results in significantly different results from those#N#portrayed in the literature. Whereas some simulations show alpha-beta expanding almost#N#100% more leaf nodes than other algorithms [Marsland, Reinefeld & Schaeffer, 1987],#N#our results showed variations of less than 20%.#N#One new instance of our framework MTD(f) out-performs our best alpha-beta searcher#N#(aspiration NegaScout) on leaf nodes, total nodes and execution time. To our knowledge,#N#these are the first reported results that compare both depth-first and best-first algorithms given the same amount of memory.

Connected through hyperedge HE-1 (induced by source paper "best first and depth first minimax search in practice"):
  with members:
    - "a minimax algorithm better than alpha beta no and yes"

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.AI(Artificial Intelligence)