human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "note on maximal bisection above tight lower bound"
  Abstract: In a graph $G=(V,E)$, a bisection $(X,Y)$ is a partition of $V$ into sets $X$ and $Y$ such that $|X|\le |Y|\le |X|+1$. The size of $(X,Y)$ is the number of edges between $X$ and $Y$. In the Max Bisection problem we are given a graph $G=(V,E)$ and are required to find a bisection of maximum size. It is not hard to see that $\lceil |E|/2 \rceil$ is a tight lower bound on the maximum size of a bisection of $G$. We study parameterized complexity of the following parameterized problem called Max Bisection above Tight Lower Bound (Max-Bisec-ATLB): decide whether a graph $G=(V,E)$ has a bisection of size at least $\lceil |E|/2 \rceil+k,$ where $k$ is the parameter. We show that this parameterized problem has a kernel with $O(k^2)$ vertices and $O(k^3)$ edges, i.e., every instance of Max-Bisec-ATLB is equivalent to an instance of Max-Bisec-ATLB on a graph with at most $O(k^2)$ vertices and $O(k^3)$ edges.

Connected through hyperedge HE-1 (induced by source paper "balanced judicious partition is fixed parameter tractable"):
  with members:
    - "parameterized algorithms for load coloring problem"
    - "maximum balanced subgraph problem parameterized above lower bound"
    - "designing fpt algorithms for cut problems using randomized contractions"
    - "fixed parameter tractability of multicut parameterized by the size of the cutset"

Connected through hyperedge HE-2 (induced by source paper "parameterized algorithms for constraint satisfaction problems above average with global cardinality constraints"):
  with members:
    - "analysis of boolean functions"
    - "hypercontractivity sum of squares proofs and their applications"
    - "better balance by being biased a 0 8776 approximation for max bisection"
    - "approximating csps with global cardinality constraints using sdp hierarchies"
    - "reductions between expansion problems"
    - "a probabilistic approach to problems parameterized above or below tight bounds"
    - "solving max r sat above a tight lower bound"
    - "approximation resistant predicates from pairwise independence"

Connected through hyperedge HE-3 (induced by source paper "maximum balanced subgraph problem parameterized above lower bound"):
  with members:
    - "beyond max cut lambda extendible properties parameterized above the poljak turz i k bound"
    - "directed acyclic subgraph problem parameterized above the poljak turzik bound"
    - "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average"
    - "max cut parameterized above the edwards erd h o s bound"

Connected through hyperedge HE-4 (induced by source paper "max cut parameterized above the edwards erd h o s bound"):
  with members:
    - "maximum balanced subgraph problem parameterized above lower bound"
    - "improved parameterized algorithms for constraint satisfaction"

Question: Please tell me which class the center node 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)