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 "on temporally connected graphs of small cost"):
  Abstract: We study the design and verification of temporal graphs that are temporally connected. We mainly consider undirected graphs of $n$ vertices and follow the model of \cite{kempe}, where each edge has an associated set of discrete availability instances (labels). A journey from vertex $u$ to vertex $v$ is a path from $u$ to $v$ where successive path edges have strictly increasing labels. A graph is temporally connected iff there is a $(u,v)$-journey for any pair of vertices $u,v$. We first give a simple polynomial-time algorithm to check whether a given temporal graph is temporally connected. We then consider the case in which a designer can \emph{freely choose} availability instances for all edges and aims for temporal connectivity with a very small \emph{cost}; the cost here is the total number of availability instances used. We achieve this via a simple polynomial-time procedure which derives designs of cost linear in $n$, and at most the optimal cost plus $2$. To show this, we prove a lower bound on the cost for any undirected graph. Next, we consider the case in which a designer could only choose among a pre-specified set of availability instances. She comes to us and says "with those availability instances I deliver a temporally connected graph." Here, we first have to verify the correctness of the design. Then our aim is to decrease the cost by removing some labels without destroying temporal connectivity (redundant labels). Our main technical result is that computing the maximum number of labels that are redundant is APX-hard, i.e., there is no PTAS unless $P=NP$. On the other hand, a temporal design may be "minimal" i.e. all its labels may be needed for temporal connectivity. We partially characterise minimal temporal designs.

Includes members:
  Member "temporal network optimization subject to connectivity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")
  Member "time varying graphs and dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "edge disjoint branchings in temporal graphs")

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.DM(Discrete Mathematics)