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 "practical verified computation with streaming interactive proofs"):
  Abstract: When delegating computation to a service provider, as in cloud computing, we seek some reassurance that the output is correct and complete. Yet recomputing the output as a check is inefficient and expensive, and it may not even be feasible to store all the data locally. We are therefore interested in proof systems which allow a service provider to prove the correctness of its output to a streaming (sublinear space) user, who cannot store the full input or perform the full computation herself. #R##N#Our approach is two-fold. First, we describe a carefully chosen instantiation of one of the most efficient general-purpose constructions for arbitrary computations (streaming or otherwise), due to Goldwasser, Kalai, and Rothblum. This requires several new insights to make the methodology more practical. Our main contribution is in achieving a prover who runs in time O(S(n) log S(n)), where S(n) is the size of an arithmetic circuit computing the function of interest. Our experimental results demonstrate that a practical general-purpose protocol for verifiable computation may be significantly closer to reality than previously realized. #R##N#Second, we describe techniques that achieve genuine scalability for protocols fine-tuned for specific important problems in streaming and database processing. Focusing in particular on non-interactive protocols for problems ranging from matrix-vector multiplication to bipartite perfect matching, we build on prior work to achieve a prover who runs in nearly linear-time, while obtaining optimal tradeoffs between communication cost and the user's working memory. Existing techniques required (substantially) superlinear time for the prover. We argue that even if general-purpose methods improve, fine-tuned protocols will remain valuable in real-world settings for key problems, and hence special attention to specific problems is warranted.

Includes members:
  Member "on the communication complexity of sparse set disjointness and exists equal problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the communication complexity of set intersection and multiple equality testing")
  Member "arthur merlin streaming complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "streaming verification in data analysis")
  Member "time optimal interactive proofs for circuit evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "doubly efficient pseudo deterministic proofs")
  Member "verifying computations with streaming interactive proofs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (induced by source paper "streaming verification of graph properties")
  Member "computing the diameter polynomially faster than apsp":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on analyzing and evaluating privacy measures for social networks under active attack")
  Member "weighted matching in the semi streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams")

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)