human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "validating xml documents in the streaming model with external memory"
  Abstract: We study the problem of validating XML documents of size $N$ against general DTDs in the context of streaming algorithms. The starting point of this work is a well-known space lower bound. There are XML documents and DTDs for which $p$-pass streaming algorithms require $\Omega(N/p)$ space. #R##N#We show that when allowing access to external memory, there is a deterministic streaming algorithm that solves this problem with memory space $O(\log^2 N)$, a constant number of auxiliary read/write streams, and $O(\log N)$ total number of passes on the XML document and auxiliary streams. #R##N#An important intermediate step of this algorithm is the computation of the First-Child-Next-Sibling (FCNS) encoding of the initial XML document in a streaming fashion. We study this problem independently, and we also provide memory efficient streaming algorithms for decoding an XML document given in its FCNS encoding. #R##N#Furthermore, validating XML documents encoding binary trees in the usual streaming model without external memory can be done with sublinear memory. There is a one-pass algorithm using $O(\sqrt{N \log N})$ space, and a bidirectional two-pass algorithm using $O(\log^2 N)$ space performing this task.

Connected through hyperedge HE-1 (induced by source paper "streamability of nested word transductions"):
  with members:
    - "randomized sliding window algorithms for regular languages"
    - "untwisting two way transducers in elementary time"
    - "two way visibly pushdown automata and transducers"
    - "streaming property testing of visibly pushdown languages"
    - "from two way to one way finite state transducers"
    - "streaming tree transducers"
    - "on functionality of visibly pushdown transducers"
    - "tight lower bounds for query processing on streaming and external memory data"

Connected through hyperedge HE-2 (induced by source paper "automata theory on sliding windows"):
  with members:
    - "approximate hamming distance in a stream"
    - "dictionary matching in a stream"
    - "streaming property testing of visibly pushdown languages"
    - "the k mismatch problem revisited"
    - "streaming algorithms for recognizing nearly well parenthesized expressions"

Connected through hyperedge HE-3 (induced by source paper "streaming property testing of visibly pushdown languages"):
  with members:
    - "recognizing well parenthesized expressions in the streaming model"
    - "first order and temporal logics for nested words"
    - "logics for unranked trees an overview"

Connected through hyperedge HE-4 (induced by source paper "unidirectional input output streaming complexity of reversal and sorting"):
  with members:
    - "on the value of multiple read write streams for data compression"
    - "streaming complexity of checking priority queues"
    - "data oblivious external memory algorithms for the compaction selection and sorting of outsourced data"
    - "information cost tradeoffs for augmented index and streaming language recognition"
    - "the space complexity of recognizing well parenthesized expressions in the streaming model the index function revisited"
    - "recognizing well parenthesized expressions in the streaming model"
    - "reversal complexity revisited"
    - "tight lower bounds for query processing on streaming and external memory data"

Connected through hyperedge HE-5 (induced by source paper "streaming complexity of checking priority queues"):
  with members:
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "information equals amortized communication"
    - "information cost tradeoffs for augmented index and streaming language recognition"
    - "the space complexity of recognizing well parenthesized expressions in the streaming model the index function revisited"
    - "recognizing well parenthesized expressions in the streaming model"

Question: Please tell me which class the center node 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)