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 "two player hidden pointer chasing and multi pass lower bounds in turnstile streams"):
  Abstract: (Assadi, Chen, and Khanna, 2019) define a 4-player hidden-pointer-chasing ($\mathsf{HPC}^4$), and using it, give strong multi-pass lower bounds for graph problems in the streaming model of computation and a lower bound on the query complexity of sub-modular minimization. We present a two-player version ($\mathsf{HPC}^2$) of $\mathsf{HPC}^4$ that has matching communication complexity to $\mathsf{HPC}^4$. Our formulation allows us to lower bound its communication complexity with a simple direct-sum argument. Using this lower bound on the communication complexity of $\mathsf{HPC}^2$, we retain the streaming and query complexity lower bounds by (Assadi, Chen, and Khanna, 2019). #R##N#Further, by giving reductions from $\mathsf{HPC}^2$, we prove new multi-pass space lower bounds for graph problems in turnstile streams. In particular, we show that any algorithm which computes the exact weight of the maximum weighted matching in an $n$-vertex graph requires $\tilde{O}(n^{2})$ space unless it makes $\omega(\log n)$ passes over the turnstile stream, and that any algorithm which computes the minimum $s\text{-}t$ distance in an $n$-vertex graph requires $n^{2-o(1)}$ space unless it makes $n^{\Omega(1)}$ passes over the turnstile stream. Our reductions can be modified to use $\mathsf{HPC}^4$ as well.

Includes members:
  Member "approximate maximum matching in random streams":
    also connected through other hyperedges:
      (none)
  Member "polynomial pass lower bounds for graph streaming algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "weighted min cut sequential cut query and streaming algorithms")
  Member "dynamic streaming spectral sparsification in nearly linear time and space":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "weighted matchings via unweighted augmentations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "tight bounds on the round complexity of the distributed maximum coverage problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "tight space approximation tradeoff for the multi pass streaming set cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "simplified and space optimal semi streaming for 2 epsilon approximate matching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximate maximum matching in random streams")
  Member "on estimating maximum matching size in graph streams":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")

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)