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 "computational complexity of stable marriage and stable roommates and their variants"):
  Abstract: This paper gives an overview on and summarizes existing complexity and algorithmic results of some variants of the Stable Marriage and the Stable Roommates problems. The last section defines a list of stable matching problems mentioned in the paper. If you find any corrections, suggestions, new or missing results, please send them to jiehua.chen2@gmail.com.

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 "adapting stable matchings to evolving preferences")
  Member "matchings under preferences strength of stability and trade offs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "stable marriage with multi modal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "popular matchings and limits to tractability":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding popular matchings via stable matchings")
  Member "on treewidth and stable marriage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stable matchings with diversity constraints affirmative action is beyond np")
  Member "how hard is it to satisfy almost all roommates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "balanced stable marriage how close is close enough":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "the stable roommates problem with short lists":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters")

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)