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: "cleaning interval graphs"
  Abstract: We investigate a special case of the Induced Subgraph Isomorphism problem, where both input graphs are interval graphs. We show the NP-hardness of this problem, and we prove fixed-parameter tractability of the problem with non-standard parameterization, where the parameter is the difference |V(G)|-|V(H)|, with G and H being the larger and the smaller input graph, respectively. Intuitively, we can interpret this problem as "cleaning" the graph G, regarded as a pattern containing extra vertices indicating errors, in order to obtain the graph H representing the original pattern. We also prove W[1]-hardness for the standard parameterization where the parameter is |V(H)|.

Connected through hyperedge HE-1 (induced by source paper "fo model checking of geometric graphs"):
  with members:
    - "a new perspective on fo model checking of dense graph classes"
    - "fo model checking of interval graphs"
    - "fo model checking on posets of bounded width"
    - "model checking existential logic on partially ordered sets"
    - "faster existential fo model checking on posets"
    - "deciding first order properties of nowhere dense graphs"
    - "deciding first order properties of locally tree decomposable structures"

Connected through hyperedge HE-2 (induced by source paper "on the complexity of various parameterizations of common induced subgraph isomorphism"):
  with members:
    - "slightly superexponential parameterized problems"
    - "deciding first order properties of nowhere dense graphs"
    - "kernelization lower bounds by cross composition"
    - "cross composition a new technique for kernelization lower bounds"
    - "known algorithms on graphs of bounded treewidth are probably optimal"
    - "linear time algorithms for finding a dominating set of fixed size in degenerated graphs"
    - "fixed parameter tractability definability and model checking"

Connected through hyperedge HE-3 (induced by source paper "on retracts absolute retracts and folds in cographs"):
  with members:
    - "finding vertex surjective graph homomorphisms"
    - "an effective dichotomy for the counting constraint satisfaction problem"
    - "split decomposition and graph labelled trees characterizations and fully dynamic algorithms for totally decomposable graphs"
    - "a complexity dichotomy for partition functions with mixed signs"

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)