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: "when lp is the cure for your matching woes approximating stochastic matchings"
  Abstract: This results in this paper have been merged with the result in arXiv:1002.3763v1#R##N#The authors would like to withdraw this version. #R##N#Please see arXiv:1008.5356v1 for the merged version.

Connected through hyperedge HE-1 (induced by source paper "maximizing expected utility for stochastic combinatorial optimization problems"):
  with members:
    - "stochastic combinatorial optimization via poisson approximation"
    - "when lp is the cure for your matching woes improved bounds for stochastic matchings"
    - "a unified approach to ranking in probabilistic databases"
    - "adaptive uncertainty resolution in bayesian combinatorial optimization problems"
    - "consensus answers for queries over probabilistic databases"
    - "stochastic combinatorial optimization under probabilistic constraints"

Connected through hyperedge HE-2 (induced by source paper "the query commit problem"):
  with members:
    - "improved bounds for stochastic matching"

Connected through hyperedge HE-3 (induced by source paper "when lp is the cure for your matching woes improved bounds for stochastic matchings"):
  with members:
    - "approximation algorithms for correlated knapsacks and non martingale bandits"
    - "greedy algorithm for stochastic matching is a 2 approximation"
    - "online stochastic matching online actions based on offline statistics"
    - "on k column sparse packing programs"
    - "budget constrained auctions with heterogeneous items"
    - "online stochastic matching beating 1 1 e"

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)