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 "a high performance algorithm for identifying frequent items in data streams"):
  Abstract: Estimating frequencies of items over data streams is a common building block in streaming data measurement and analysis. Misra and Gries introduced their seminal algorithm for the problem in 1982, and the problem has since been revisited many times due its practicality and applicability. We describe a highly optimized version of Misra and Gries' algorithm that is suitable for deployment in industrial settings. Our code is made public via an open source library called DataSketches that is already used by several companies and production systems. #R##N#Our algorithm improves on two theoretical and practical aspects of prior work. First, it handles weighted updates in amortized constant time, a common requirement in practice. Second, it uses a simple and fast method for merging summaries that asymptotically improves on prior work even for unweighted streams. We describe experiments confirming that our algorithms are more efficient than prior proposals.

Includes members:
  Member "optimal elephant flow detection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a fast and compact invertible sketch for network wide heavy flow detection")
  Member "constant time updates in hierarchical heavy hitters":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "memory efficient performance monitoring on programmable switches with lean algorithms")
  Member "an optimal algorithm for l1 heavy hitters in insertion streams and related problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "estimating entropy of distributions in constant space")
  Member "smoking out the heavy hitter flows with hashpipe":
    also connected through other hyperedges:
      (none)
  Member "beating countsketch for heavy hitters in insertion streams":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rambo repeated and merged bloom filter for multiple set membership testing msmt in sub linear time")
  Member "simple and deterministic matrix sketching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed stochastic algorithms for high rate streaming principal component analysis")
  Member "hierarchical heavy hitters with the space saving algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "memory efficient performance monitoring on programmable switches with lean algorithms")

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)