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 "superlinear lower bounds for multipass graph processing"):
  Abstract: We prove $n^{1+\Omega(1/p)}/p^{O(1)}$ lower bounds for the space complexity of $p$-pass streaming algorithms solving the following problems on $n$-vertex graphs: #R##N#* testing if an undirected graph has a perfect matching (this implies lower bounds for computing a maximum matching or even just the maximum matching size), #R##N#* testing if two specific vertices are at distance at most $2(p+1)$ in an undirected graph, #R##N#* testing if there is a directed path from $s$ to $t$ for two specific vertices $s$ and $t$ in a directed graph. #R##N#Prior to our result, it was known that these problems require $\Omega(n^2)$ space in one pass, but no $n^{1+\Omega(1)}$ lower bound was known for any $p\ge 2$. #R##N#These streaming results follow from a communication complexity lower bound for a communication game in which the players hold two graphs on the same set of vertices. The task of the players is to find out whether the sets of vertices at distance exactly $p+1$ from a specific vertex intersect. The game requires a significant amount of communication only if the players are forced to speak in a specific difficult order. This is reminiscent of lower bounds for communication problems such as indexing and pointer chasing. Among other things, our line of attack requires proving an information cost lower bound for a decision version of the classic pointer chasing problem and a direct sum type theorem for the disjunction of several instances of this problem.

Includes members:
  Member "better bounds for matchings in the streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams")
  Member "a direct product theorem for bounded round public coin randomized communication complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the power of multiplexing in number on the forehead protocols")
  Member "lower bounds on information complexity via zero communication protocols and applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "query to communication lifting using low discrepancy gadgets")
  Member "information complexity versus corruption and applications to orthogonality and gap hamming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "r enyi information complexity and an information theoretic characterization of the partition bound")
  Member "maximum matching in semi streaming with few passes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "information equals amortized communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication for generating correlation a unifying survey")
  Member "a discrepancy lower bound for information complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "detecting patterns can be hard circuit lower bounds for the string matching problem")
  Member "improved approximation guarantees for weighted matching in the semi streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "space efficient approximation to maximum matching size from uniform edge samples")

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)