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 "fast flow volume estimation"):
  Abstract: The increasing popularity of jumbo frames means growing variance in the size of packets transmitted in modern networks. Consequently, network monitoring tools must maintain explicit traffic volume statistics rather than settle for packet counting as before. We present constant time algorithms for volume estimations in streams and sliding windows, which are faster than previous work. Our solutions are formally analyzed and are extensively evaluated over multiple real-world packet traces as well as synthetic ones. For streams, we demonstrate a run-time improvement of up to 2.4X compared to the state of the art. On sliding windows, we exhibit a memory reduction of over 100X on all traces and an asymptotic runtime improvement to a constant. Finally, we apply our approach to hierarchical heavy hitters and achieve an empirical 2.4-7X speedup.

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 "a high performance algorithm for identifying frequent items in data streams":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "heavy hitters over interval queries")
  Member "constant time updates in hierarchical heavy hitters":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "memory efficient performance monitoring on programmable switches with lean algorithms")
  Member "heavy hitter detection entirely in the data plane":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "constellation a high performance geo distributed middlebox framework")
  Member "randomized admission policy for efficient top k and frequency estimation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a fast and compact invertible sketch for network wide heavy flow detection")
  Member "tinylfu a highly efficient cache admission policy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a hybrid cache architecture for meeting per tenant performance goals in a private cloud")
  Member "hierarchical heavy hitters with the space saving algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)