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 "parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters"):
  Abstract: We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well as on the side of fixed-parameter tractability. Other than for its famous sister problem Stable Marriage which focuses on a bipartite scenario, Stable Roommates with Incomplete Lists allows for arbitrary acceptability graphs whose edges specify the possible matchings of each two agents (agents are represented by graph vertices). Herein, incomplete lists and ties reflect the fact that in realistic application scenarios the agents cannot bring all other agents into a linear order. Among our main contributions is to show that it is W[1]-hard to compute a maximum-cardinality stable matching for acceptability graphs of bounded treedepth, bounded tree-cut width, and bounded feedback vertex number (these are each time the respective parameters). However, if we `only' ask for perfect stable matchings or the mere existence of a stable matching, then we obtain fixed-parameter tractability with respect to tree-cut width but not with respect to treedepth. On the positive side, we also provide fixed-parameter tractability results for the parameter feedback edge set number.

Includes members:
  Member "sat encodings for treecut width and treedepth":
    also connected through other hyperedges:
      (none)
  Member "stable marriage with multi modal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "stable marriage with groups of similar agents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "on treewidth and stable marriage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "adapting stable matchings to evolving preferences")
  Member "the stable roommates problem with short lists":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computational complexity of stable marriage and stable roommates and their variants")
  Member "stable marriage with covering constraints a complete computational trichotomy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "acyclic preference systems in p2p networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "computational complexity of stable marriage and stable roommates and their variants")

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