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: "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.

Connected through hyperedge HE-1 (induced by source paper "doubly efficient pseudo deterministic proofs"):
  with members:
    - "solving linear programs in the current matrix multiplication time"
    - "pseudo deterministic proofs"
    - "graph isomorphism in quasipolynomial time"
    - "into the square on the complexity of quadratic time solvable problems"
    - "time optimal interactive proofs for circuit evaluation"
    - "verifiable computation with massively parallel interactive proofs"

Connected through hyperedge HE-2 (induced by source paper "the efficient server audit problem deduplicated re execution and the web"):
  with members:
    - "don t sit on the fence a static analysis approach to automatic fence insertion"

Connected through hyperedge HE-3 (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"
    - "arthur merlin streaming complexity"
    - "verifying computations with streaming interactive proofs"
    - "on arthur merlin games in communication complexity"
    - "streaming graph computations with a helpful advisor"

Connected through hyperedge HE-4 (induced by source paper "rational proofs with multiple provers"):
  with members:
    - "streaming verification in data analysis"
    - "verifying computations with streaming interactive proofs"

Connected through hyperedge HE-5 (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"
    - "arthur merlin streaming complexity"
    - "time optimal interactive proofs for circuit evaluation"
    - "single pass sparsification in the streaming model with edge deletions"
    - "verifying computations with streaming interactive proofs"
    - "invertible bloom lookup tables"
    - "streaming graph computations with a helpful advisor"

Connected through hyperedge HE-6 (induced by source paper "an improved interactive streaming algorithm for the distinct elements problem"):
  with members:
    - "arthur merlin streaming complexity"
    - "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-7 (induced by source paper "annotations for sparse data streams"):
  with members:
    - "arthur merlin streaming complexity"
    - "the non adaptive query complexity of testing k parities"
    - "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-8 (induced by source paper "time optimal interactive proofs for circuit evaluation"):
  with members:
    - "arthur merlin streaming complexity"
    - "verifiable computation with massively parallel interactive proofs"
    - "verifying computations with streaming interactive proofs"
    - "streaming graph computations with a helpful advisor"
    - "computing the diameter polynomially faster than apsp"

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.DS(Data Structures and Algorithms)