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 "local access generators for basic random graph models"):
  Abstract: Consider a computation on a massive random graph: Does one need to generate the whole random graph up front, prior to performing the computation? Or, is it possible to provide an oracle to answer queries to the random graph "on-the-fly" in a much more efficient manner overall? That is, to provide a $local\ access\ generator$ which incrementally constructs the random graph locally, at the queried portions, in a manner consistent with the random graph model and all previous choices. Local access generators can be useful when studying the local behavior of specific random graph models. Our goal is to design local access generators whose required resource overhead for answering each query is significantly more efficient than generating the whole random graph. #R##N#Our results focus on undirected graphs with independent edge probabilities, that is, each edge is chosen as an independent Bernoulli random variable. We provide a general implementation for generators in this model. Then, we use this construction to obtain the first efficient local implementations for the Erd\"{o}s-R\'{e}nyi $G(n,p)$ model, and the Stochastic Block model. #R##N#As in previous local-access implementations for random graphs, we support $vertex$-$pair$, $next$-$neighbor$ queries, and $all$-$neighbors$ queries. In addition, we introduce a new $random$-$neighbor$ query. We also give the first local-access generation procedure for $all$-$neighbors$ queries in the (sparse and directed) Kleinberg's Small-World model. Note that, in the sparse case, an $all$-$neighbors$ query can be used to simulate the other types of queries efficiently. All of our generators require no pre-processing time, and answer each query using $polylog(n) $ time, random bits, and additional space.

Includes members:
  Member "on the probe complexity of local computation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "local access to huge random objects through partial sampling")
  Member "sublinear random access generators for preferential attachment graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "local access to huge random objects through partial sampling")
  Member "stochastic block model and community detection in the sparse graphs a spectral algorithm with optimal rate of recovery":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "randomized spectral clustering in large scale stochastic block models")

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)