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: "arthur merlin streaming complexity"
  Abstract: We study the power of Arthur-Merlin probabilistic proof systems in the data stream model. We show a canonical $\mathcal{AM}$ streaming algorithm for a wide class of data stream problems. The algorithm offers a tradeoff between the length of the proof and the space complexity that is needed to verify it. #R##N#As an application, we give an $\mathcal{AM}$ streaming algorithm for the \emph{Distinct Elements} problem. Given a data stream of length $m$ over alphabet of size $n$, the algorithm uses $\tilde O(s)$ space and a proof of size $\tilde O(w)$, for every $s,w$ such that $s \cdot w \ge n$ (where $\tilde O$ hides a $\polylog(m,n)$ factor). We also prove a lower bound, showing that every $\mathcal{MA}$ streaming algorithm for the \emph{Distinct Elements} problem that uses $s$ bits of space and a proof of size $w$, satisfies $s \cdot w = \Omega(n)$. #R##N#As a part of the proof of the lower bound for the \emph{Distinct Elements} problem, we show a new lower bound of $\Omega(\sqrt n)$ on the $\mathcal{MA}$ communication complexity of the \emph{Gap Hamming Distance} problem, and prove its tightness.

Connected through hyperedge HE-1 (induced by source paper "streaming verification in data analysis"):
  with members:
    - "an improved interactive streaming algorithm for the distinct elements problem"
    - "annotations for sparse data streams"
    - "practical verified computation with streaming interactive proofs"
    - "verifying computations with streaming interactive proofs"
    - "on arthur merlin games in communication complexity"
    - "streaming graph computations with a helpful advisor"

Connected through hyperedge HE-2 (induced by source paper "semi streaming algorithms for annotated graph streams"):
  with members:
    - "an improved interactive streaming algorithm for the distinct elements problem"
    - "annotations for sparse data streams"
    - "time optimal interactive proofs for circuit evaluation"
    - "single pass sparsification in the streaming model with edge deletions"
    - "practical verified computation with streaming interactive proofs"
    - "verifying computations with streaming interactive proofs"
    - "invertible bloom lookup tables"
    - "streaming graph computations with a helpful advisor"

Connected through hyperedge HE-3 (induced by source paper "an improved interactive streaming algorithm for the distinct elements problem"):
  with members:
    - "practical verified computation with streaming interactive proofs"
    - "verifying computations with streaming interactive proofs"
    - "on arthur merlin games in communication complexity"
    - "streaming graph computations with a helpful advisor"
    - "rectangle size bounds and threshold covers in communication complexity"

Connected through hyperedge HE-4 (induced by source paper "annotations for sparse data streams"):
  with members:
    - "the non adaptive query complexity of testing k parities"
    - "practical verified computation with streaming interactive proofs"
    - "verifying computations with streaming interactive proofs"
    - "on arthur merlin games in communication complexity"
    - "streaming graph computations with a helpful advisor"
    - "straggler identification in round trip data streams via newton s identities and invertible bloom filters"
    - "rectangle size bounds and threshold covers in communication complexity"

Connected through hyperedge HE-5 (induced by source paper "time optimal interactive proofs for circuit evaluation"):
  with members:
    - "verifiable computation with massively parallel interactive proofs"
    - "practical verified computation with streaming interactive proofs"
    - "verifying computations with streaming interactive proofs"
    - "streaming graph computations with a helpful advisor"
    - "computing the diameter polynomially faster than apsp"

Connected through hyperedge HE-6 (induced by source paper "practical verified computation with streaming interactive proofs"):
  with members:
    - "on the communication complexity of sparse set disjointness and exists equal problems"
    - "time optimal interactive proofs for circuit evaluation"
    - "verifying computations with streaming interactive proofs"
    - "on arthur merlin games in communication complexity"
    - "streaming graph computations with a helpful advisor"
    - "computing the diameter polynomially faster than apsp"
    - "weighted matching in the semi streaming model"
    - "straggler identification in round trip data streams via newton s identities and invertible bloom filters"

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