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 "complexity of token swapping and its variants"):
  Abstract: In the Token Swapping problem we are given a graph with a token placed on each vertex. Each token has exactly one destination vertex, and we try to move all the tokens to their destinations, using the minimum number of swaps, i.e., operations of exchanging the tokens on two adjacent vertices. As the main result of this paper, we show that Token Swapping is $W[1]$-hard parameterized by the length $k$ of a shortest sequence of swaps. In fact, we prove that, for any computable function $f$, it cannot be solved in time $f(k)n^{o(k / \log k)}$ where $n$ is the number of vertices of the input graph, unless the ETH fails. This lower bound almost matches the trivial $n^{O(k)}$-time algorithm. #R##N#We also consider two generalizations of the Token Swapping, namely Colored Token Swapping (where the tokens have different colors and tokens of the same color are indistinguishable), and Subset Token Swapping (where each token has a set of possible destinations). To complement the hardness result, we prove that even the most general variant, Subset Token Swapping, is FPT in nowhere-dense graph classes. #R##N#Finally, we consider the complexities of all three problems in very restricted classes of graphs: graphs of bounded treewidth and diameter, stars, cliques, and paths, trying to identify the borderlines between polynomial and NP-hard cases.

Includes members:
  Member "swapping colored tokens on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "token swapping on trees")
  Member "complexity of finding perfect bipartite matchings minimizing the number of intersecting edges":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximum clique in disk like intersection graphs")
  Member "subexponential time algorithms for finding small tree and path decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on tradeoffs between width and fill like graph parameters")
  Member "approximation and hardness for token swapping":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "token swapping on trees")
  Member "optimal parameterized algorithms for planar facility location problems using voronoi diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "grundy coloring friends half graphs bicliques")
  Member "linear time algorithm for sliding tokens on trees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "independent set reconfiguration parameterized by modular width")
  Member "deciding first order properties of nowhere dense graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hitting topological minors is fpt")
  Member "sorting of permutations by cost constrained transpositions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fuzzy rankings properties and applications")

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)