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: "linear time parameterized algorithms via skew symmetric multicuts"
  Abstract: A skew-symmetric graph $(D=(V,A),\sigma)$ is a directed graph $D$ with an involution $\sigma$ on the set of vertices and arcs. In this paper, we introduce a separation problem, $d$-Skew-Symmetric Multicut, where we are given a skew-symmetric graph $D$, a family of $\cal T$ of $d$-sized subsets of vertices and an integer $k$. The objective is to decide if there is a set $X\subseteq A$ of $k$ arcs such that every set $J$ in the family has a vertex $v$ such that $v$ and $\sigma(v)$ are in different connected components of $D'=(V,A\setminus (X\cup \sigma(X))$. In this paper, we give an algorithm for this problem which runs in time $O((4d)^{k}(m+n+\ell))$, where $m$ is the number of arcs in the graph, $n$ the number of vertices and $\ell$ the length of the family given in the input. #R##N#Using our algorithm, we show that Almost 2-SAT has an algorithm with running time $O(4^kk^4\ell)$ and we obtain algorithms for {\sc Odd Cycle Transversal} and {\sc Edge Bipartization} which run in time $O(4^kk^4(m+n))$ and $O(4^kk^5(m+n))$ respectively. This resolves an open problem posed by Reed, Smith and Vetta [Operations Research Letters, 2003] and improves upon the earlier almost linear time algorithm of Kawarabayashi and Reed [SODA, 2010]. #R##N#We also show that Deletion q-Horn Backdoor Set Detection is a special case of 3-Skew-Symmetric Multicut, giving us an algorithm for Deletion q-Horn Backdoor Set Detection which runs in time $O(12^kk^5\ell)$. This gives the first fixed-parameter tractable algorithm for this problem answering a question posed in a paper by a superset of the authors [STACS, 2013]. Using this result, we get an algorithm for Satisfiability which runs in time $O(12^kk^5\ell)$ where $k$ is the size of the smallest q-Horn deletion backdoor set, with $\ell$ being the length of the input formula.

Connected through hyperedge HE-1 (induced by source paper "0 1 all csps half integral a path packing and linear time fpt algorithms"):
  with members:
    - "parameterized algorithms for zero extension and metric labelling problems"
    - "a linear time parameterized algorithm for node unique label cover"
    - "linear time kernelization for feedback vertex set"
    - "a linear time parameterized algorithm for directed feedback vertex set"
    - "lp branching algorithms based on biased graphs"
    - "a dual descent algorithm for node capacitated multiflow problems and its applications"
    - "linear time fpt algorithms via network flow"
    - "faster parameterized algorithms using linear programming"

Connected through hyperedge HE-2 (induced by source paper "odd multiway cut in directed acyclic graphs"):
  with members:
    - "min max theorems for packing and covering odd u v trails"
    - "a linear time parameterized algorithm for directed feedback vertex set"
    - "linear time fpt algorithms via network flow"
    - "faster parameterized algorithms using linear programming"
    - "fixed parameter tractability of multicut in directed acyclic graphs"
    - "finding small separators in linear time via treewidth reduction"
    - "compression via matroids a randomized polynomial kernel for odd cycle transversal"
    - "fixed parameter tractability of directed multiway cut parameterized by the size of the cutset"

Connected through hyperedge HE-3 (induced by source paper "a linear time parameterized algorithm for node unique label cover"):
  with members:
    - "half integrality lp branching and fpt algorithms"
    - "linear time fpt algorithms via network flow"
    - "designing fpt algorithms for cut problems using randomized contractions"
    - "fixed parameter tractability of multicut in directed acyclic graphs"
    - "directed subset feedback vertex set is fixed parameter tractable"
    - "finding small separators in linear time via treewidth reduction"
    - "fixed parameter tractability of directed multiway cut parameterized by the size of the cutset"
    - "fixed parameter tractability of multicut parameterized by the size of the cutset"

Connected through hyperedge HE-4 (induced by source paper "linear time kernelization for feedback vertex set"):
  with members:
    - "on feedback vertex set new measure and new structures"
    - "towards optimal and expressive kernelization for d hitting set"
    - "half integrality lp branching and fpt algorithms"
    - "linear time fpt algorithms via network flow"
    - "faster deterministic feedback vertex set"
    - "faster parameterized algorithms using linear programming"
    - "solving connectivity problems parameterized by treewidth in single exponential time"
    - "randomized algorithms for the loop cutset problem"

Connected through hyperedge HE-5 (induced by source paper "half integrality lp branching and fpt algorithms"):
  with members:
    - "towards minimizing k submodular functions"
    - "linear time fpt algorithms via network flow"
    - "the power of linear programming for valued csps"
    - "designing fpt algorithms for cut problems using randomized contractions"
    - "faster parameterized algorithms using linear programming"
    - "the power of linear programming for valued csps a constructive characterization"
    - "min csp on four elements moving beyond submodularity"
    - "on group feedback vertex set parameterized by the size of the cutset"

Connected through hyperedge HE-6 (induced by source paper "a faster fpt algorithm for bipartite contraction"):
  with members:
    - "linear time fpt algorithms via network flow"
    - "interval deletion is fixed parameter tractable"
    - "faster parameterized algorithms using linear programming"
    - "obtaining planarity by contracting few edges"
    - "on group feedback vertex set parameterized by the size of the cutset"
    - "representative sets and irrelevant vertices new tools for kernelization"
    - "finding small separators in linear time via treewidth reduction"
    - "compression via matroids a randomized polynomial kernel for odd cycle transversal"

Connected through hyperedge HE-7 (induced by source paper "linear time fpt algorithms via network flow"):
  with members:
    - "faster parameterized algorithms using linear programming"
    - "representative sets and irrelevant vertices new tools for kernelization"
    - "finding small separators in linear time via treewidth reduction"
    - "on multiway cut parameterized above lower bounds"
    - "almost 2 sat is fixed parameter tractable"

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)