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 "derandomization beyond connectivity undirected laplacian systems in nearly logarithmic space"):
  Abstract: We give a deterministic $\tilde{O}(\log n)$-space algorithm for approximately solving linear systems given by Laplacians of undirected graphs, and consequently also approximating hitting times, commute times, and escape probabilities for undirected graphs. Previously, such systems were known to be solvable by randomized algorithms using $O(\log n)$ space (Doron, Le Gall, and Ta-Shma, 2017) and hence by deterministic algorithms using $O(\log^{3/2} n)$ space (Saks and Zhou, FOCS 1995 and JCSS 1999). #R##N#Our algorithm combines ideas from time-efficient Laplacian solvers (Spielman and Teng, STOC `04; Peng and Spielman, STOC `14) with ideas used to show that Undirected S-T Connectivity is in deterministic logspace (Reingold, STOC `05 and JACM `08; Rozenman and Vadhan, RANDOM `05).

Includes members:
  Member "faster algorithms for computing the stationary distribution simulating random walks and more":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spectral sparsification via bounded independence sampling")
  Member "almost linear time algorithms for markov chains and new spectral primitives for directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "flows in almost linear time via adaptive preconditioning")
  Member "efficient inverse maintenance and faster algorithms for linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "pseudorandomness and fourier growth bounds for width 3 branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fourier bounds and pseudorandom generators for product tests")
  Member "an almost linear time algorithm for approximate max flow in undirected graphs and its multicommodity generalizations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "faster divergence maximization for faster maximum flow")
  Member "an efficient parallel solver for sdd linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "circulation control for faster minimum cost flow in unit capacity graphs")
  Member "pseudorandomness for regular branching programs via fourier analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fourier bounds and pseudorandom generators for product tests")
  Member "efficient accelerated coordinate descent methods and faster algorithms for solving linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spectral sparsification via bounded independence sampling")

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.CC(Computational Complexity)