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: "on the complexity of robust stable marriage"
  Abstract: Robust Stable Marriage (RSM) is a variant of the classical Stable Marriage problem, where the robustness of a given stable matching is measured by the number of modifications required for repairing it in case an unforeseen event occurs. We focus on the complexity of finding an (a,b)-supermatch. An (a,b)-supermatch is defined as a stable matching in which if any 'a' (non-fixed) men/women break up it is possible to find another stable matching by changing the partners of those 'a' men/women and also the partners of at most 'b' other couples. In order to show deciding if there exists an (a,b)-supermatch is NP-Complete, we first introduce a SAT formulation that is NP-Complete by using Schaefer's Dichotomy Theorem. Then, we show the equivalence between the SAT formulation and finding a (1,1)-supermatch on a specific family of instances.

Connected through hyperedge HE-1 (induced by source paper "matchings under preferences strength of stability and trade offs"):
  with members:
    - "stable roommates with narcissistic single peaked and single crossing preferences"
    - "stable matchings robust solutions and distributive lattices"
    - "robust and approximately stable marriages under partial information"
    - "stable marriage with multi modal preferences"
    - "finding stable matchings that are robust to errors in the input"
    - "how hard is it to satisfy almost all roommates"
    - "robustness among multiwinner voting rules"
    - "stable matching with uncertain linear preferences"

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"
    - "finding robust solutions to 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"
    - "finding robust solutions to stable marriage"
    - "stable matching with uncertain linear preferences"

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.CC(Computational Complexity)