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 "a linear time parameterized algorithm for node unique label cover"):
  Abstract: The optimization version of the Unique Label Cover problem is at the heart of the Unique Games Conjecture which has played an important role in the proof of several tight inapproximability results. In recent years, this problem has been also studied extensively from the point of view of parameterized complexity. Cygan et al. [FOCS 2012] proved that this problem is fixed-parameter tractable (FPT) and Wahlstr\"om [SODA 2014] gave an FPT algorithm with an improved parameter dependence. Subsequently, Iwata, Wahlstr\"om and Yoshida [2014] proved that the edge version of Unique Label Cover can be solved in linear FPT-time. That is, there is an FPT algorithm whose dependence on the input-size is linear. However, such an algorithm for the node version of the problem was left as an open problem. In this paper, we resolve this question by presenting the first linear-time FPT algorithm for Node Unique Label Cover.

Includes members:
  Member "half integrality lp branching and fpt algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized algorithms for milps with small treedepth")
  Member "linear time parameterized algorithms via skew symmetric multicuts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "0 1 all csps half integral a path packing and linear time fpt algorithms")
  Member "linear time fpt algorithms via network flow":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph profiling for vertex cover targeted reductions in a branch and reduce solver")
  Member "designing fpt algorithms for cut problems using randomized contractions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "grundy coloring friends half graphs bicliques")
  Member "fixed parameter tractability of multicut in directed acyclic graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a relaxation of the directed disjoint paths problem a global congestion metric helps")
  Member "directed subset feedback vertex set is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hitting long directed cycles is fixed parameter tractable")
  Member "finding small separators in linear time via treewidth reduction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fixed parameter tractability of counting small minimum s t cuts")
  Member "fixed parameter tractability of directed multiway cut parameterized by the size of the cutset":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hitting long directed cycles is fixed parameter tractable")

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.DS(Data Structures and Algorithms)