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 "maximum balanced subgraph problem parameterized above lower bound"):
  Abstract: We consider graphs without loops or parallel edges in which every edge is assigned + or -. Such a signed graph is balanced if its vertex set can be partitioned into parts $V_1$ and $V_2$ such that all edges between vertices in the same part have sign + and all edges between vertices of different parts have sign $-$ (one of the parts may be empty). It is well-known that every connected signed graph with $n$ vertices and $m$ edges has a balanced subgraph with at least $\frac{m}{2} + \frac{n-1}{4}$ edges and this bound is tight. We consider the following parameterized problem: given a connected signed graph $G$ with $n$ vertices and $m$ edges, decide whether $G$ has a balanced subgraph with at least $\frac{m}{2} + \frac{n-1}{4}+\frac{k}{4}$ edges, where $k$ is the parameter. #R##N#We obtain an algorithm for the problem of runtime $8^k(kn)^{O(1)}$. We also prove that for each instance $(G,k)$ of the problem, in polynomial time, we can either solve $(G,k)$ or produce an equivalent instance $(G',k')$ such that $k'\le k$ and $|V(G')|=O(k^3)$. Our first result generalizes a result of Crowston, Jones and Mnich (ICALP 2012) on the corresponding parameterization of Max Cut (when every edge of $G$ has sign $-$). Our second result generalizes and significantly improves the corresponding result of Crowston, Jones and Mnich: they showed that $|V(G')|=O(k^5)$.

Includes members:
  Member "beyond max cut lambda extendible properties parameterized above the poljak turz i k bound":
    also connected through other hyperedges:
      (none)
  Member "directed acyclic subgraph problem parameterized above the poljak turzik bound":
    also connected through other hyperedges:
      (none)
  Member "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "satisfiability of ordering csps above average")
  Member "max cut parameterized above the edwards erd h o s bound":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parameterized tsp beating the average")
  Member "note on maximal bisection above tight lower bound":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "balanced judicious partition 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)