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: "sim width and induced minors"
  Abstract: We introduce a new graph width parameter, called special induced matching width, shortly sim-width, which does not increase when taking induced minors. For a vertex partition $(A,B)$ of a graph $G$, this parameter is based on the maximum size of an induced matching $\{a_1b_1, \ldots, a_mb_m\}$ in $G$ where $a_1, \ldots, a_m\in A$ and $b_1, \ldots, b_m\in B$. Classes of graphs of bounded sim-width are much wider than classes of bounded tree-width, rank-width, or mim-width. As examples, we show that chordal graphs and co-comparability graphs have sim-width at most $1$, while they have unbounded value for the other three parameters. In this paper, we obtain general algorithmic results on graphs of bounded sim-width by further excluding certain graphs as induced minors. #R##N#A $t$-matching complete graph is a graph that consists of two vertex sets $\{v_1, \ldots, v_t\}$ and $\{w_1, \ldots, w_t\}$ such that $\{v_1, \ldots, v_t\}$ is a clique, and between the two sets, $\{v_1w_1, \ldots, v_tw_t\}$ is an induced matching. We prove that for positive integers $w$ and $t$, a large class of domination and partitioning problems, including the Minimum Dominating Set problem, can be solved in time $n^{\mathcal{O}(wt^2)}$ on $n$-vertex graphs of sim-width at most $w$ and having no induced minor isomorphic to a $t$-matching complete graph, when the decomposition tree is given. To prove it, we show that such graphs have mim-width at most $(4w+2)t^2$. In this way, we generate infinite non-trivial classes of graphs that are closed under induced minors, but not under minors, and have general algorithmic applications. For chordal graphs and co-comparability graphs, we provide polynomial-time algorithms to obtain decomposition trees certifying that their sim-width are at most $1$. Note that Minimum Dominating Set is NP-complete on chordal graphs.

Connected through hyperedge HE-1 (induced by source paper "lower bounds on the mim width of some graph classes"):
  with members:
    - "a width parameter useful for chordal and co comparability graphs"
    - "on satisfiability problems with a linear structure"
    - "understanding model counting for beta acyclic cnf formulas"
    - "no small nondeterministic read once branching programs for cnfs of bounded treewidth"
    - "expander cnfs have exponential dnnf size"

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)