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 "0 1 all csps half integral a path packing and linear time fpt algorithms"):
  Abstract: A recent trend in the design of FPT algorithms is exploiting the half-integrality of LP relaxations. In other words, starting with a half-integral optimal solution to an LP relaxation, we assign integral values to variables one-by-one by branch and bound. This technique is general and the resulting time complexity has a low dependency on the parameter. However, the time complexity often becomes a large polynomial in the input size because we need to compute half-integral optimal LP solutions. #R##N#In this paper, we address this issue by providing an $O(km)$-time algorithm for solving the LPs arising from various FPT problems, where $k$ is the optimal value and $m$ is the number of edges/constraints. Our algorithm is based on interesting connections among 0/1/all constraints, which has been studied in the field of constraints satisfaction, $A$-path packing, which has been studied in the field of combinatorial optimization, and the LPs used in FPT algorithms. With the aid of this algorithm, we obtain improved FPT algorithms for various problems, including Group Feedback Vertex Set, Subset Feedback Vertex Set, Node Multiway Cut, Node Unique Label Cover, and Non-monochromatic Cycle Transversal. The obtained running time for each of these problems is linear in the input size and has the current smallest dependency on the parameter. In particular, these algorithms are the first linear-time FPT algorithms for problems including Group Feedback Vertex Set and Non-monochromatic Cycle Transversal.

Includes members:
  Member "parameterized algorithms for zero extension and metric labelling problems":
    also connected through other hyperedges:
      (none)
  Member "a linear time parameterized algorithm for node unique label cover":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "covering small independent sets and separators with applications to parameterized algorithms")
  Member "linear time kernelization for feedback vertex set":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved analysis of highest degree branching for feedback vertex set")
  Member "a linear time parameterized algorithm for directed feedback vertex set":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi budgeted directed cuts")
  Member "lp branching algorithms based on biased graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on quasipolynomial multicut mimicking networks and kernelization of multiway cut problems")
  Member "a dual descent algorithm for node capacitated multiflow problems and its applications":
    also connected through other hyperedges:
      (none)
  Member "linear time parameterized algorithms via skew symmetric multicuts":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "odd multiway cut in directed acyclic graphs")
  Member "linear time fpt algorithms via network flow":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "graph profiling for vertex cover targeted reductions in a branch and reduce solver")

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)