human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "adapting stable matchings to evolving preferences"):
  Abstract: Adaptivity to changing environments and constraints is key to success in modern society. We address this view by proposing "incrementalized versions" of Stable Marriage and Stable Roommates. That is, we try to answer the following question: for both problems, what is the cost of adapting an existing stable matching after some of the preferences of the agents have changed. While doing so, we also model the constraint that the new stable matching shall be close to the old one. After formalizing these incremental versions, we provide a fairly comprehensive picture of the computational complexity landscape of Incremental Stable Marriage and Incremental Stable Roommates. To this end, we exploit the parameters "degree of change" both in the input (difference between old and new preference profile) and in the output (difference between old and new stable matching). We obtain both hardness and tractability results, among the latter being one of the few fixed-parameter tractability results (exploiting the parameter "distance between old and new stable matching") in the context of computationally hard stable matching problems.

Includes members:
  Member "stable roommates with narcissistic single peaked and single crossing preferences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computational complexity of stable marriage and stable roommates and their variants")
  Member "matchings under preferences strength of stability and trade offs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "stable matchings robust solutions and distributive lattices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "matchings under preferences strength of stability and trade offs")
  Member "stable marriage with multi modal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "reoptimization of parameterized problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a polynomial version of cereceda s conjecture")
  Member "parameterized dynamic cluster editing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a dynamically turbo charged greedy heuristic for graph coloring")
  Member "finding stable matchings that are robust to errors in the input":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "matchings under preferences strength of stability and trade offs")
  Member "finding robust solutions to stable marriage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stable matchings robust solutions and distributive lattices")

Question: Please tell me which class the source paper 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.GT(Computer Science and Game Theory)