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: "minimum latency submodular cover"
  Abstract: We study the Minimum Latency Submodular Cover problem (MLSC), which consists of a metric $(V,d)$ with source $r\in V$ and $m$ monotone submodular functions $f_1, f_2, ..., f_m: 2^V \rightarrow [0,1]$. The goal is to find a path originating at $r$ that minimizes the total cover time of all functions. This generalizes well-studied problems, such as Submodular Ranking [AzarG11] and Group Steiner Tree [GKR00]. We give a polynomial time $O(\log \frac{1}{\eps} \cdot \log^{2+\delta} |V|)$-approximation algorithm for MLSC, where $\epsilon>0$ is the smallest non-zero marginal increase of any $\{f_i\}_{i=1}^m$ and $\delta>0$ is any constant. #R##N#We also consider the Latency Covering Steiner Tree problem (LCST), which is the special case of \mlsc where the $f_i$s are multi-coverage functions. This is a common generalization of the Latency Group Steiner Tree [GuptaNR10a,ChakrabartyS11] and Generalized Min-sum Set Cover [AzarGY09, BansalGK10] problems. We obtain an $O(\log^2|V|)$-approximation algorithm for LCST. #R##N#Finally we study a natural stochastic extension of the Submodular Ranking problem, and obtain an adaptive algorithm with an $O(\log 1/ \eps)$ approximation ratio, which is best possible. This result also generalizes some previously studied stochastic optimization problems, such as Stochastic Set Cover [GoemansV06] and Shared Filter Evaluation [MunagalaSW07, LiuPRY08].

Connected through hyperedge HE-1 (induced by source paper "the online min sum set cover problem"):
  with members:
    - "chasing convex bodies optimally"
    - "stochastic online metric matching"
    - "pure entropic regularization for metrical task systems"
    - "metrical task systems on trees via mirror descent and unfair gluing"
    - "weighted k server bounds via combinatorial dichotomies"
    - "competitive algorithms for generalized k server in uniform metrics"
    - "a static optimality transformation with applications to planar point location"
    - "the generalized work function algorithm is competitive for the generalized 2 server problem"

Connected through hyperedge HE-2 (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"
    - "a match in time saves nine deterministic online matching with delays"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"):
  with members:
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "online primal dual for non linear optimization with applications to speed scaling"
    - "ranking with submodular valuations"
    - "a truthful mechanism for offline ad slot scheduling"

Connected through hyperedge HE-4 (induced by source paper "ranking with diverse intents and correlated contents"):
  with members:
    - "approximation algorithms for maximum independent set of pseudo disks"
    - "a note on the generalized min sum set cover problem"
    - "when lp is the cure for your matching woes improved bounds for stochastic matchings"
    - "ranking with submodular valuations"
    - "dependent randomized rounding for matroid polytopes and applications"
    - "a unified approach to ranking in probabilistic databases"
    - "combinatorial auctions with decreasing marginal utilities"

Connected through hyperedge HE-5 (induced by source paper "approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover"):
  with members:
    - "near optimal bayesian active learning with noisy observations"
    - "adaptive submodularity theory and applications in active learning and stochastic optimization"

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)