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: "stable matching with uncertain linear preferences"
  Abstract: We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model --- in which for each agent, there is a probability distribution over linear preferences, (2) compact indifference model --- for each agent, a weak preference order is specified and each linear order compatible with the weak order is equally likely and (3) joint probability model --- there is a lottery over preference profiles. For each of the models, we study the computational complexity of computing the stability probability of a given matching as well as finding a matching with the highest probability of being stable. We also examine more restricted problems such as deciding whether a certainly stable matching exists. We find a rich complexity landscape for these problems, indicating that the form uncertainty takes is significant.

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"
    - "finding robust solutions to stable marriage"

Connected through hyperedge HE-2 (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"
    - "on the complexity of robust stable marriage"
    - "how hard is it to satisfy almost all roommates"
    - "robustness among multiwinner voting rules"

Connected through hyperedge HE-3 (induced by source paper "the stable marriage problem with ties and restricted edges"):
  with members:
    - "mathematical models for stable matching problems with ties and incomplete lists"
    - "socially stable matchings in the hospitals residents problem"
    - "social networks and stable matchings in the job market"

Connected through hyperedge HE-4 (induced by source paper "stable marriage with multi modal preferences"):
  with members:
    - "stable roommates with narcissistic single peaked and single crossing preferences"
    - "a polynomial time randomized reduction from tournament isomorphism to tournament asymmetry"
    - "assessing the computational complexity of multi layer subgraph detection"
    - "the one dimensional euclidean domain finitely many obstructions are not enough"
    - "are there any nicely structured preference profiles nearby"
    - "parameterized algorithmics for computational social choice nine research challenges"
    - "stable marriage with general preferences"
    - "clone structures in voters preferences"

Connected through hyperedge HE-5 (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"
    - "on the complexity of robust stable marriage"

Connected through hyperedge HE-6 (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"
    - "on the complexity of robust stable marriage"

Connected through hyperedge HE-7 (induced by source paper "robust and approximately stable marriages under partial information"):
  with members:
    - "regret minimizing equilibria and mechanisms for games with strict type uncertainty"

Connected through hyperedge HE-8 (induced by source paper "pareto optimal allocation under uncertain preferences"):
  with members:
    - "size versus truthfulness in the house allocation problem"
    - "optimal reallocation under additive and ordinal 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.GT(Computer Science and Game Theory)