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: "verifying computations with streaming interactive proofs"
  Abstract: When computation is outsourced, the data owner would like to be assured that the desired computation has been performed correctly by the service provider. In theory, proof systems can give the necessary assurance, but prior work is not sufficiently scalable or practical. In this paper, we develop new proof protocols for verifying computations which are streaming in nature: the verifier (data owner) needs only logarithmic space and a single pass over the input, and after observing the input follows a simple protocol with a prover (service provider) that takes logarithmic communication spread over a logarithmic number of rounds. These ensure that the computation is performed correctly: that the service provider has not made any errors or missed out some data. The guarantee is very strong: even if the service provider deliberately tries to cheat, there is only vanishingly small probability of doing so undetected, while a correct computation is always accepted. We first observe that some theoretical results can be modified to work with streaming verifiers, showing that there are efficient protocols for problems in the complexity classes NP and NC. Our main results then seek to bridge the gap between theory and practice by developing usable protocols for a variety of problems of central importance in streaming and database processing. All these problems require linear space in the traditional streaming model, and therefore our protocols demonstrate that adding a prover can exponentially reduce the effort needed by the verifier. Our experimental results show that our protocols are practical and scalable.

Connected through hyperedge HE-1 (induced by source paper "efficient rational proofs with strong utility gap guarantees"):
  with members:
    - "rational proofs with non cooperative provers"
    - "rational proofs with multiple provers"
    - "streaming verification in data analysis"

Connected through hyperedge HE-2 (induced by source paper "prio private robust and scalable computation of aggregate statistics"):
  with members:
    - "strong eth breaks with merlin and arthur short non interactive proofs of batch evaluation"
    - "building a rappor with the unknown privacy preserving learning of associations and data dictionaries"
    - "riposte an anonymous messaging system handling millions of users"
    - "efficient private statistics with succinct sketches"
    - "rappor randomized aggregatable privacy preserving ordinal response"
    - "hang with your buddies to resist intersection attacks"
    - "proactively accountable anonymous messaging in verdict"
    - "information theoretic security without an honest majority"

Connected through hyperedge HE-3 (induced by source paper "safetynets verifiable execution of deep neural networks on an untrusted cloud"):
  with members:
    - "sok security and privacy in machine learning"
    - "globally optimal training of generalized polynomial neural networks with nonlinear spectral methods"
    - "convexified convolutional neural networks"
    - "on the computational efficiency of training neural networks"
    - "stochastic pooling for regularization of deep convolutional neural networks"
    - "do deep nets really need to be deep"
    - "time optimal interactive proofs for circuit evaluation"

Connected through hyperedge HE-4 (induced by source paper "rational proofs with non cooperative provers"):
  with members:
    - "rational proofs with multiple provers"
    - "time optimal interactive proofs for circuit evaluation"

Connected through hyperedge HE-5 (induced by source paper "streaming verification of graph properties"):
  with members:
    - "bipartite perfect matching is in quasi nc"
    - "rational proofs with multiple provers"
    - "tight bounds for linear sketches of approximate matchings"
    - "sublinear estimation of weighted matchings in dynamic data streams"
    - "maximum matching in turnstile streams"
    - "sketching cuts in graphs and hypergraphs"
    - "an improved interactive streaming algorithm for the distinct elements problem"
    - "semi streaming algorithms for annotated graph streams"

Connected through hyperedge HE-6 (induced by source paper "on the power of statistical zero knowledge"):
  with members:
    - "a nearly optimal lower bound on the approximate degree of ac 0"
    - "on szk and pp"
    - "adaptivity vs postselection"
    - "dual polynomials for collision and element distinctness"
    - "hardness amplification and the approximate degree of constant depth circuits"
    - "on arthur merlin games in communication complexity"

Connected through hyperedge HE-7 (induced by source paper "on szk and pp"):
  with members:
    - "adaptivity vs postselection"
    - "dual polynomials for collision and element distinctness"
    - "annotations for sparse data streams"
    - "on arthur merlin games in communication complexity"
    - "bounded independence fools halfspaces"

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

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.DB(Databases)