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: "finding robust solutions to stable marriage"
  Abstract: We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An $(a,b)$-supermatch is a stable matching in which if $a$ pairs break up it is possible to find another stable matching by changing the partners of those $a$ pairs and at most $b$ other pairs. In this context, we define the most robust stable matching as a $(1,b)$-supermatch where b is minimum. We show that checking whether a given stable matching is a $(1,b)$-supermatch can be done in polynomial time. Next, we use this procedure to design a constraint programming model, a local search approach, and a genetic algorithm to find the most robust stable matching. Our empirical evaluation on large instances show that local search outperforms the other approaches.

Connected through hyperedge HE-1 (induced by source paper "adapting stable matchings to evolving preferences"):
  with members:
    - "stable roommates with narcissistic single peaked and single crossing preferences"
    - "matchings under preferences strength of stability and trade offs"
    - "stable matchings robust solutions and distributive lattices"
    - "stable marriage with multi modal preferences"
    - "reoptimization of parameterized problems"
    - "parameterized dynamic cluster editing"
    - "finding stable matchings that are robust to errors in the input"
    - "how hard is it to satisfy almost all roommates"

Connected through hyperedge HE-2 (induced by source paper "stable matchings robust solutions and distributive lattices"):
  with members:
    - "a natural generalization of stable matching solved via new insights into ideal cuts"
    - "finding stable matchings that are robust to errors in the input"
    - "on the complexity of robust stable marriage"
    - "stable matching with uncertain linear preferences"

Connected through hyperedge HE-3 (induced by source paper "finding stable matchings that are robust to errors in the input"):
  with members:
    - "stable matchings robust solutions and distributive lattices"
    - "on the complexity of robust stable marriage"
    - "stable matching with uncertain linear preferences"

Connected through hyperedge HE-4 (induced by source paper "meet cyrus the query by voice mobile assistant for the tutoring and formative assessment of sql learners"):
  with members:
    - "recommender system for learning sql using hints"
    - "system and methods for converting speech to sql"

Connected through hyperedge HE-5 (induced by source paper "on the complexity of robust stable marriage"):
  with members:
    - "perturbation robust stable matching"

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.AI(Artificial Intelligence)