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 "streaming verification in data analysis"):
  Abstract: Streaming interactive proofs (SIPs) are a framework to reason about outsourced computation, where a data owner (the verifier) outsources a computation to the cloud (the prover), but wishes to verify the correctness of the solution provided by the cloud service. In this paper we present streaming interactive proofs for problems in data analysis. We present protocols for clustering and shape fitting problems, as well as an improved protocol for rectangular matrix multiplication. The latter can in turn be used to verify $k$ eigenvectors of a (streamed) $n \times n$ matrix. In general our solutions use polylogarithmic rounds of communication and polylogarithmic total communication and verifier space. For special cases (when optimality certificates can be verified easily), we present constant round protocols with similar costs. For rectangular matrix multiplication and eigenvector verification, our protocols work in the more restricted annotated data streaming model, and use sublinear (but not polylogarithmic) communication.

Includes members:
  Member "an improved interactive streaming algorithm for the distinct elements problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "streaming verification of graph properties")
  Member "annotations for sparse data streams":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on szk and pp")
  Member "arthur merlin streaming complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semi streaming algorithms for annotated graph streams")
  Member "practical verified computation with streaming interactive proofs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "doubly efficient pseudo deterministic proofs")
  Member "verifying computations with streaming interactive proofs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient rational proofs with strong utility gap guarantees")
  Member "on arthur merlin games in communication complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "vanishing error approximate degree and qma complexity")
  Member "streaming graph computations with a helpful advisor":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "streaming verification of graph properties")

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)