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: "space efficient local computation algorithms"
  Abstract: Recently Rubinfeld et al. (ICS 2011, pp. 223--238) proposed a new model of sublinear algorithms called \emph{local computation algorithms}. In this model, a computation problem $F$ may have more than one legal solution and each of them consists of many bits. The local computation algorithm for $F$ should answer in an online fashion, for any index $i$, the $i^{\mathrm{th}}$ bit of some legal solution of $F$. Further, all the answers given by the algorithm should be consistent with at least one solution of $F$. #R##N#In this work, we continue the study of local computation algorithms. In particular, we develop a technique which under certain conditions can be applied to construct local computation algorithms that run not only in polylogarithmic time but also in polylogarithmic \emph{space}. Moreover, these local computation algorithms are easily parallelizable and can answer all parallel queries consistently. Our main technical tools are pseudorandom numbers with bounded independence and the theory of branching processes.

Connected through hyperedge HE-1 (induced by source paper "seeing far vs seeing wide volume complexity of local graph problems"):
  with members:
    - "an automatic speedup theorem for distributed problems"
    - "polylogarithmic time deterministic network decomposition and distributed derandomization"
    - "how much does randomness help with locally checkable problems"
    - "locality of not so weak coloring"
    - "almost global problems in the local model"
    - "the distributed complexity of locally checkable problems on paths is decidable"
    - "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation"
    - "hardness of minimal symmetry breaking in distributed computing"

Connected through hyperedge HE-2 (induced by source paper "sublinear algorithms for delta 1 vertex coloring"):
  with members:
    - "coloring in graph streams"
    - "brief announcement semi mapreduce meets congested clique"
    - "greedy and local ratio algorithms in the mapreduce model"
    - "independent sets in vertex arrival streams"
    - "optimal lower bounds for universal relation and for samplers and finding duplicates in streams"
    - "coresets meet edcs algorithms for matching and vertex cover on massive graphs"
    - "simple round compression for parallel vertex cover"
    - "round compression for parallel matching algorithms"

Connected through hyperedge HE-3 (induced by source paper "on the complexity of local distributed graph problems"):
  with members:
    - "polynomial lower bound for distributed graph coloring in a weak local model"
    - "distributed degree splitting edge coloring and orientations"
    - "distributed delta 1 coloring in sublogarithmic rounds"
    - "an exponential separation between randomized and deterministic complexity in the local model"
    - "a hierarchy of local decision"
    - "distributed strong diameter network decomposition"
    - "a fast network decomposition algorithm and its applications to constant time distributed computation"
    - "local conflict coloring"

Connected through hyperedge HE-4 (induced by source paper "sublinear random access generators for preferential attachment graphs"):
  with members:
    - "a scalable generative graph model with community structure"
    - "new techniques and tighter bounds for local computation algorithms"
    - "best of two local models local centralized and local distributed algorithms"
    - "local algorithms for sparse spanning graphs"
    - "a local computation approximation scheme to maximum matching"
    - "converting online algorithms to local computation algorithms"
    - "a near optimal sublinear time algorithm for approximating the minimum vertex cover size"
    - "fast local computation algorithms"

Connected through hyperedge HE-5 (induced by source paper "fast distributed algorithms for connectivity and mst in large graphs"):
  with members:
    - "near optimal clustering in the k machine model"
    - "tight bounds for distributed graph computations"
    - "on the distributed complexity of large scale graph computations"
    - "a time and message optimal distributed algorithm for minimum spanning trees"
    - "super fast mst algorithms in the congested clique using o m messages"
    - "distributed algorithms for finding local clusters using heat kernel pagerank"
    - "algebraic methods in the congested clique"
    - "construction and impromptu repair of an mst in a distributed network with o m communication"

Connected through hyperedge HE-6 (induced by source paper "local computation algorithms for graphs of non constant degrees"):
  with members:
    - "flow based algorithms for local graph clustering"
    - "distributed maximum matching in bounded degree graphs"
    - "new techniques and tighter bounds for local computation algorithms"
    - "best of two local models local centralized and local distributed algorithms"
    - "local algorithms for sparse spanning graphs"
    - "a local computation approximation scheme to maximum matching"
    - "a simple online competitive adaptation of lempel ziv compression with efficient random access support"
    - "local computation mechanism design"

Connected through hyperedge HE-7 (induced by source paper "optimal dynamic distributed mis"):
  with members:
    - "local computation algorithms for graphs of non constant degrees"
    - "an improved distributed algorithm for maximal independent set"
    - "fully dynamic matching in bipartite graphs"
    - "deterministic fully dynamic data structures for vertex cover and matching"
    - "dynamic approximate all pairs shortest paths breaking the o mn barrier and derandomization"
    - "greedy sequential maximal independent set and matching are parallel on average"
    - "the locality of distributed symmetry breaking"
    - "converting online algorithms to local computation algorithms"

Connected through hyperedge HE-8 (induced by source paper "an improved distributed algorithm for maximal independent set"):
  with members:
    - "local computation algorithms for graphs of non constant degrees"
    - "optimal deterministic routing and sorting on the congested clique"
    - "the locality of distributed symmetry breaking"
    - "fast local computation algorithms"

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)