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: "submatrix maximum queries in monge matrices are equivalent to predecessor search"
  Abstract: We present an optimal data structure for submatrix maximum queries in n x n Monge matrices. Our result is a two-way reduction showing that the problem is equivalent to the classical predecessor problem in a universe of polynomial size. This gives a data structure of O(n) space that answers submatrix maximum queries in O(loglogn) time. It also gives a matching lower bound, showing that O(loglogn) query-time is optimal for any data structure of size O(n polylog(n)). Our result concludes a line of improvements that started in SODA'12 with O(log^2 n) query-time and continued in ICALP'14 with O(log n) query-time. Finally, we show that partial Monge matrices can be handled in the same bounds as full Monge matrices. In both previous results, partial Monge matrices incurred additional inverse-Ackerman factors.

Connected through hyperedge HE-1 (induced by source paper "near optimal distance emulator for planar graphs"):
  with members:
    - "near optimal compression for the planar graph metric"
    - "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "linear size distance preservers"
    - "graph minors for preserving terminal distances approximately lower and upper bounds"
    - "a linear size logarithmic stretch path reporting distance oracle for general graphs"
    - "sublinear space distance labeling using hubs"
    - "the 4 3 additive spanner exponent is tight"

Connected through hyperedge HE-2 (induced by source paper "minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths"):
  with members:
    - "minimum cut of directed planar graphs in o nloglogn time"
    - "computing the girth of a planar graph in linear time"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "algorithmic applications of baur strassen s theorem shortest cycles diameter and matchings"
    - "shortest non trivial cycles in directed and undirected surface graphs"
    - "shortest paths in planar graphs with real lengths in o n log 2n log log n time"
    - "optimally cutting a surface into a disk"
    - "minimum cuts in near linear time"

Connected through hyperedge HE-3 (induced by source paper "improved bounds for shortest paths in dense distance graphs"):
  with members:
    - "faster shortest paths in dense distance graphs with applications"
    - "all pairs minimum cuts in near linear time for surface embedded graphs"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "randomized speedup of the bellman ford algorithm"
    - "min st cut oracle for planar graphs with near linear preprocessing time"
    - "exact distance oracles for planar graphs"
    - "shortest paths in planar graphs with real lengths in o n log 2n log log n time"

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)