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 "exponential separations between turnstile streaming and linear sketching"):
  Abstract: Almost every known turnstile streaming algorithm is implementable as a linear sketch. Is this necessarily true, or can there exist turnstile streaming algorithms that use much less space than any linear sketch? #R##N#It was shown in~\cite{LNW14} that, if a turnstile algorithm works for arbitrarily long streams with arbitrarily large coordinates at intermediate stages of the stream, then the turnstile algorithm can be implemented as a linear sketch. Our results have the opposite form: if either the stream length or the maximum value of the stream are substantially restricted, there exist problems where linear sketching is exponentially harder than turnstile streaming.

Includes members:
  Member "the sketching complexity of graph and hypergraph counting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "data streams with bounded deletions":
    also connected through other hyperedges:
      (none)
  Member "optimality of linear sketching under modular updates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximate mathbb f _2 sketching of valuation functions")
  Member "on estimating maximum matching size in graph streams":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams")
  Member "a hybrid sampling scheme for triangle counting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cocos fast and accurate distributed triangle counting in graph streams")
  Member "linear sketching over mathbb f_2":
    also connected through other hyperedges:
      (none)
  Member "maximum matching in turnstile streams":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)