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: "a match in time saves nine deterministic online matching with delays"
  Abstract: We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) introduced by Emek et al. (STOC 2016). In this problem, an even number of requests appear in a metric space at different times and the goal of an online algorithm is to match them in pairs. In contrast to traditional online matching problems, in MPMD all requests appear online and an algorithm can match any pair of requests, but such decision may be delayed (e.g., to find a better match). The cost is the sum of matching distances and the introduced delays. #R##N#We present the first deterministic online algorithm for this problem. Its competitive ratio is $O(m^{\log_2 5.5})$ $ = O(m^{2.46})$, where $2 m$ is the number of requests. This is polynomial in the number of metric space points if all requests are given at different points. In particular, the bound does not depend on other parameters of the metric, such as its aspect ratio. Unlike previous (randomized) solutions for the MPMD problem, our algorithm does not need to know the metric space in advance.

Connected through hyperedge HE-1 (induced by source paper "permutation strikes back the power of recourse in online metric matching"):
  with members:
    - "stochastic online metric matching"
    - "optimal analysis of an online algorithm for the bipartite matching problem on a line"
    - "maintaining perfect matchings at low cost"
    - "fully dynamic bin packing with limited repacking"
    - "a collection of lower bounds for online matching on the line"
    - "online and dynamic algorithms for set cover"
    - "online matching haste makes waste"
    - "new algorithms better bounds and a novel model for online stochastic matching"

Connected through hyperedge HE-2 (induced by source paper "on bin packing with clustering and bin packing with delays"):
  with members:
    - "a new lower bound for classic online bin packing"
    - "a new and improved algorithm for online bin packing"
    - "online service with delay"
    - "online matching haste makes waste"

Connected through hyperedge HE-3 (induced by source paper "general framework for metric optimization problems with delay or with deadlines"):
  with members:
    - "a primal dual online deterministic algorithm for matching with delays"
    - "online service with delay"
    - "online matching haste makes waste"

Connected through hyperedge HE-4 (induced by source paper "set cover and vertex cover with delay"):
  with members:
    - "a primal dual online deterministic algorithm for matching with delays"
    - "deterministic min cost matching with delays"
    - "online service with delay"
    - "online and dynamic algorithms for set cover"
    - "online matching haste makes waste"
    - "the online disjoint set cover problem and its applications"
    - "semi streaming set cover"
    - "minimum latency submodular cover"

Connected through hyperedge HE-5 (induced by source paper "a primal dual online deterministic algorithm for matching with delays"):
  with members:
    - "online service with delay"
    - "online matching haste makes waste"
    - "better approximation bounds for the joint replenishment problem"

Connected through hyperedge HE-6 (induced by source paper "deterministic min cost matching with delays"):
  with members:
    - "a primal dual online deterministic algorithm for matching with delays"
    - "online matching haste makes waste"

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)