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: "proximity search for maximal subgraph enumeration"
  Abstract: This paper considers the subgraphs of an input graph that satisfy a given property and are maximal under inclusion. The main result is a seemingly novel technique, proximity search, to list these subgraphs in polynomial delay each. These include Maximal Bipartite Subgraphs, Maximal $k$-Degenerate Subgraphs (for bounded $k$), Maximal Induced Chordal Subgraphs, and Maximal Induced Trees. Using known techniques, such as reverse search, the space of sought solutions induces an implicit directed graph called ``solution graph'': however, the latter can give rise to exponential out-degree, thus preventing polynomial delay. The novelty of our algorithm in this paper consists in providing a technique for generating a better solution graph, significantly reducing the out-degree with respect to existing approaches, so that it still remains strongly connected and guarantees that all solutions can be reported with polynomial delay by a suitable traversal. While traversing the solution graph incur in space proportional to the number of solutions to keep track of visited ones, we further propose a technique to induce a parent-child relationship and achieve polynomial space when suitable conditions are met.

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)