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 "a local algorithm for the sparse spanning graph problem"):
  Abstract: Constructing a sparse spanning subgraph is a fundamental primitive in graph theory. In this paper, we study this problem in the Centralized Local model, where the goal is to decide whether an edge is part of the spanning subgraph by examining only a small part of the input; yet, answers must be globally consistent and independent of prior queries. #R##N#Unfortunately, maximally sparse spanning subgraphs, i.e., spanning trees, cannot be constructed efficiently in this model. Therefore, we settle for a spanning subgraph containing at most $(1+\varepsilon)n$ edges (where $n$ is the number of vertices and $\varepsilon$ is a given approximation/sparsity parameter). We achieve query complexity of $\tilde{O}(poly(\Delta/\varepsilon)n^{2/3})$, ($\tilde{O}$-notation hides polylogarithmic factors in $n$). where $\Delta$ is the maximum degree of the input graph. Our algorithm is the first to do so on arbitrary bounded degree graphs. Moreover, we achieve the additional property that our algorithm outputs a spanner, i.e., distances are approximately preserved. With high probability, for each deleted edge there is a path of $O(poly(\Delta/\varepsilon)\log^2 n)$ hops in the output that connects its endpoints.

Includes members:
  Member "local computation algorithms for graphs of non constant degrees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "seeing far vs seeing wide volume complexity of local graph problems")
  Member "local algorithms for sparse spanning graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "seeing far vs seeing wide volume complexity of local graph problems")
  Member "a local computation approximation scheme to maximum matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed maximum matching verification in congest")
  Member "a quasi polynomial time partition oracle for graphs with an excluded minor":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "local computation algorithms for spanners")
  Member "converting online algorithms to local computation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "seeing far vs seeing wide volume complexity of local graph problems")
  Member "fast local computation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "local access to huge random objects through partial sampling")
  Member "finding cycles and trees in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "walking randomly massively and efficiently")

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.DS(Data Structures and Algorithms)