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 "unidirectional input output streaming complexity of reversal and sorting"):
  Abstract: We consider unidirectional data streams with restricted access, such as read-only and write-only streams. For read-write streams, we also introduce a new complexity measure called expansion, the ratio between the space used on the stream and the input size. We give tight bounds for the complexity of reversing a stream of length $n$ in several of the possible models. In the read-only and write-only model, we show that $p$-pass algorithms need memory space ${\Theta}(n/p)$. But if either the output stream or the input stream is read-write, then the complexity falls to ${\Theta}(n/p^2)$. It becomes $polylog(n)$ if $p = O(log n)$ and both streams are read-write. We also study the complexity of sorting a stream and give two algorithms with small expansion. Our main sorting algorithm is randomized and has $O(1)$ expansion, $O(log n)$ passes and $O(log n)$ memory.

Includes members:
  Member "on the value of multiple read write streams for data compression":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounds from a card trick")
  Member "streaming complexity of checking priority queues":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the space complexity of recognizing well parenthesized expressions in the streaming model the index function revisited")
  Member "data oblivious external memory algorithms for the compaction selection and sorting of outsourced data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an algorithmic framework for differentially private data analysis on trusted processors")
  Member "information cost tradeoffs for augmented index and streaming language recognition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "validating xml documents in the streaming model with external memory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "streamability of nested word transductions")
  Member "the space complexity of recognizing well parenthesized expressions in the streaming model the index function revisited":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sliding window property testing for regular languages")
  Member "recognizing well parenthesized expressions in the streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "memory augmented recurrent neural networks can learn generalized dyck languages")
  Member "reversal complexity revisited":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the value of multiple read write streams for data compression")

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)