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: "steiner network problems on temporal graphs"
  Abstract: We introduce a temporal Steiner network problem in which a graph, as well as changes to its edges and/or vertices over a set of discrete times, are given as input; the goal is to find a minimal subgraph satisfying a set of $k$ time-sensitive connectivity demands. We show that this problem, $k$-Temporal Steiner Network ($k$-TSN), is NP-hard to approximate to a factor of $k - \epsilon$, for every fixed $k \geq 2$ and $\epsilon > 0$. This bound is tight, as certified by a trivial approximation algorithm. Conceptually this demonstrates, in contrast to known results for traditional Steiner problems, that a time dimension adds considerable complexity even when the problem is offline. #R##N#We also discuss special cases of $k$-TSN in which the graph changes satisfy a monotonicity property. We show approximation-preserving reductions from monotonic $k$-TSN to well-studied problems such as Priority Steiner Tree and Directed Steiner Tree, implying improved approximation algorithms. #R##N#Lastly, $k$-TSN and its variants arise naturally in computational biology; to facilitate such applications, we devise an integer linear program for $k$-TSN based on network flows.

Connected through hyperedge HE-1 (induced by source paper "temporal graph classes a view through temporal separators"):
  with members:
    - "the computational complexity of finding separators in temporal graphs"
    - "the complexity of finding small separators in temporal graphs"
    - "on the size and the approximability of minimum temporally connected subgraphs"
    - "an introduction to temporal graphs an algorithmic perspective"
    - "on temporal graph exploration"
    - "time varying graphs and dynamic networks"

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)