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: "minor matching hypertree width"
  Abstract: In this paper we present a new width measure for a tree decomposition, minor-matching hypertree width, $\mu\text{-}tw$, for graphs and hypergraphs, such that bounding the width guarantees that set of maximal independent sets has a polynomially-sized restriction to each decomposition bag. The relaxed conditions of the decomposition allow a much wider class of graphs and hypergraphs of bounded width compared to other tree decompositions. We show that, for fixed $k$, there are $2^{(1 - \frac1k + o(1)){n \choose 2}}$ $n$-vertex graphs of minor-matching hypertree width at most $k$. A number of problems including Maximum Independence Set, $k$-Colouring, and Homomorphism of uniform hypergraphs permit polynomial-time solutions for hypergraphs with bounded minor-matching hypertree width and bounded rank. We show that for any given $k$ and any graph $G$, it is possible to construct a decomposition of minor-matching hypertree width at most $O(k^3)$, or to prove that $\mu\text{-}tw(G) > k$ in time $n^{O(k^3)}$. The result relating the restriction of the maximal independent sets to a set $S$ with the set of induced matchings intersecting $S$ in graphs, and minor matchings intersecting $S$ in hypergraphs, might be of independent interest.

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)