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 "quantum online streaming algorithms with constant number of advice bits"):
  Abstract: Online algorithms are known model that is investigated with respect to a competitive ratio typically. In this paper, we investigate streaming algorithms as a model for online algorithms. We focus on quantum and classical online algorithms with advice. Special problem $P_k$ was considered. This problem is obtained using "Black Hats Method". There is an optimal quantum online algorithm with single advice bit and single qubit of memory for the problem. At the same time, there is no optimal deterministic or randomized online algorithm with sublogarithmic memory for the same problem even the algorithm gets $o(\log n)$ advice bits. Additionally, we show that quantum online algorithm with a constant number of qubits can be better than deterministic online algorithm even if deterministic one has a constant number of advice bits and unlimited computational power.

Includes members:
  Member "quantum online algorithms with respect to space complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantum versus classical online streaming algorithms with logarithmic size of memory")
  Member "quantum versus classical online streaming algorithms with logarithmic size of memory":
    also connected through other hyperedges:
      (none)
  Member "exact affine obdds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantum versus classical online streaming algorithms with logarithmic size of memory")
  Member "reordering method and hierarchies for quantum and classical ordered binary decision diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quantum dynamic programming algorithm for dags applications for and or dag evaluation and dag s diameter search")
  Member "very narrow quantum obdds and width hierarchies for classical obdds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "language recognition power and succinctness of affine automata")
  Member "the frequent items problem in online streaming under various performance measures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "relative worst order analysis a survey")
  Member "superiority of exact quantum automata for promise problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "quantum finite automata survey status and research directions")
  Member "a comparison of performance measures for online algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "benchmark design and prior independent optimization")

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)