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: "decreasekeys are expensive for external memory priority queues"
  Abstract: One of the biggest open problems in external memory data structures is the priority queue problem with DecreaseKey operations. If only Insert and ExtractMin operations need to be supported, one can design a comparison-based priority queue performing $O((N/B)\lg_{M/B} N)$ I/Os over a sequence of $N$ operations, where $B$ is the disk block size in number of words and $M$ is the main memory size in number of words. This matches the lower bound for comparison-based sorting and is hence optimal for comparison-based priority queues. However, if we also need to support DecreaseKeys, the performance of the best known priority queue is only $O((N/B) \lg_2 N)$ I/Os. The big open question is whether a degradation in performance really is necessary. We answer this question affirmatively by proving a lower bound of $\Omega((N/B) \lg_{\lg N} B)$ I/Os for processing a sequence of $N$ intermixed Insert, ExtraxtMin and DecreaseKey operations. Our lower bound is proved in the cell probe model and thus holds also for non-comparison-based priority queues.

Connected through hyperedge HE-1 (induced by source paper "external memory priority queues with decrease key and applications to graph algorithms"):
  with members:
    - "a faster external memory priority queue with decreasekeys"
    - "optimal hashing in external memory"
    - "equivalence between priority queues and sorting in external memory"

Connected through hyperedge HE-2 (induced by source paper "lower bounds for oblivious data structures"):
  with members:
    - "bios oram improved privacy preserving data access for parameterized outsourced storage"
    - "crossing the logarithmic barrier for dynamic boolean data structure lower bounds"
    - "amortized dynamic cell probe lower bounds from four party communication"
    - "cell probe lower bounds for dynamic problems via a new communication model"
    - "new unconditional hardness results for dynamic and online problems"
    - "the cell probe complexity of dynamic range counting"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "lower bounds on near neighbor search via metric expansion"

Connected through hyperedge HE-3 (induced by source paper "lower bounds for external memory integer sorting via network coding"):
  with members:
    - "a faster external memory priority queue with decreasekeys"
    - "network coding in undirected graphs is either very helpful or not helpful at all"
    - "using hashing to solve the dictionary problem in external memory"

Connected through hyperedge HE-4 (induced by source paper "a faster external memory priority queue with decreasekeys"):
  with members:
    - "equivalence between priority queues and sorting in external memory"
    - "using hashing to solve the dictionary problem in external memory"

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)