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: "automated lower bounds on the i o complexity of computation graphs"
  Abstract: We consider the problem of finding lower bounds on the I/O complexity of arbitrary computations. Executions of complex computations can be formalized as an evaluation order over the underlying computation graph. In this paper, we present two novel methods to find I/O lower bounds for an arbitrary computation graph. In the first, we bound the I/O using the eigenvalues of the graph Laplacian. This spectral bound is not only efficiently computable, but also can be computed in closed form for graphs with known spectra. In our second method, we leverage a novel Integer Linear Program that directly solves for the optimal evaluation order; we solve this ILP on constant sized sub-graphs of the original computation graph to find I/O lower bounds. We apply our spectral method to compute closed-form analytical bounds on two computation graphs (hypercube and Fast Fourier Transform). We further empirically validate our methods on four computation graphs, and find that our methods provide tighter bounds than current empirical methods and behave similarly to previously published I/O bounds.

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)