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: "when can graph hyperbolicity be computed in linear time"
  Abstract: Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known algorithms for computing the hyperbolicity number of a graph (the smaller, the more tree-like) have running time $O(n^4)$, where $n$ is the number of graph vertices. Exploiting the framework of parameterized complexity analysis, we explore possibilities for "linear-time FPT" algorithms to compute hyperbolicity. For instance, we show that hyperbolicity can be computed in time $O(2^{O(k)} + n +m)$ ($m$ being the number of graph edges) while at the same time, unless the SETH fails, there is no $2^{o(k)}n^2$-time algorithm.

Connected through hyperedge HE-1 (induced by source paper "fast approximation and exact computation of negative curvature parameters of graphs"):
  with members:
    - "effect of gromov hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications"
    - "fully polynomial fpt algorithms for some classes of bounded clique width graphs"
    - "core congestion is inherent in hyperbolic networks"
    - "an improved combinatorial algorithm for boolean matrix multiplication"
    - "into the square on the complexity of quadratic time solvable problems"
    - "computing the gromov hyperbolicity of a discrete metric space"

Connected through hyperedge HE-2 (induced by source paper "parameterized complexity of diameter"):
  with members:
    - "towards improving brandes algorithm for betweenness centrality"
    - "towards tight approximation bounds for graph diameter and eccentricities"
    - "data reduction for maximum matching on real world graphs theory and experiments"
    - "multivariate analysis of orthogonal range searching and graph distances parameterized by treewidth"
    - "efficient and adaptive parameterized algorithms on modular decompositions"
    - "parameterized aspects of triangle enumeration"
    - "fully polynomial fpt algorithms for some classes of bounded clique width graphs"
    - "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time"

Connected through hyperedge HE-3 (induced by source paper "efficient and adaptive parameterized algorithms on modular decompositions"):
  with members:
    - "parameterized aspects of triangle enumeration"
    - "fully polynomial fpt algorithms for some classes of bounded clique width graphs"
    - "on the power of tree depth for fully polynomial fpt algorithms"
    - "the power of data reduction for matching"
    - "data structures for weighted matching and extensions to b matching and f factors"
    - "quadratic conditional lower bounds for string problems and dynamic time warping"
    - "polynomial fixed parameter algorithms a case study for longest path on interval graphs"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"

Connected through hyperedge HE-4 (induced by source paper "a quasi linear time b matching algorithm on distance hereditary graphs and bounded split width graphs"):
  with members:
    - "parameterized aspects of triangle enumeration"
    - "fully polynomial fpt algorithms for some classes of bounded clique width graphs"
    - "the weighted matching approach to maximum cardinality matching"
    - "on the power of tree depth for fully polynomial fpt algorithms"
    - "a linear time algorithm for maximum cardinality matching on cocomparability graphs"
    - "data structures for weighted matching and extensions to b matching and f factors"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"
    - "linear time split decomposition revisited"

Connected through hyperedge HE-5 (induced by source paper "parameterized aspects of triangle enumeration"):
  with members:
    - "an adaptive version of brandes algorithm for betweenness centrality"
    - "data reduction for maximum matching on real world graphs theory and experiments"
    - "fully polynomial fpt algorithms for some classes of bounded clique width graphs"
    - "kernelization lower bounds for finding constant size subgraphs"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"
    - "polynomial fixed parameter algorithms a case study for longest path on interval graphs"
    - "joins via geometric resolutions worst case and beyond"
    - "dynamic set intersection"

Connected through hyperedge HE-6 (induced by source paper "fully polynomial fpt algorithms for some classes of bounded clique width graphs"):
  with members:
    - "the use of a pruned modular decomposition for maximum matching algorithms on some graph classes"
    - "efficient and adaptive parameterized algorithms on modular decompositions"
    - "parameterized aspects of triangle enumeration"
    - "on the power of tree depth for fully polynomial fpt algorithms"
    - "the power of data reduction for matching"
    - "tight hardness results for distance and centrality problems in constant degree graphs"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"
    - "polynomial fixed parameter algorithms a case study for longest path on interval graphs"

Connected through hyperedge HE-7 (induced by source paper "a linear time algorithm for maximum cardinality matching on cocomparability graphs"):
  with members:
    - "parameterized aspects of triangle enumeration"
    - "recognizing simple triangle graphs by restricted 2 chain subgraph cover"
    - "a recognition algorithm for simple triangle graphs"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"
    - "graph isomorphism completeness for trapezoid graphs"
    - "polynomial fixed parameter algorithms a case study for longest path on interval graphs"
    - "new geometric representations and domination problems on tolerance and multitolerance graphs"
    - "linear time lexdfs on cocomparability graphs"

Connected through hyperedge HE-8 (induced by source paper "kernelization lower bounds for finding constant size subgraphs"):
  with members:
    - "the power of data reduction for matching"
    - "linear time kernelization for feedback vertex set"
    - "diminishable parameterized problems and strict polynomial kernelization"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"
    - "polynomial fixed parameter algorithms a case study for longest path on interval graphs"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "kernelization lower bounds by cross composition"

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.CC(Computational Complexity)