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 stochastic probing problem with applications"
  Abstract: We study a general stochastic probing problem defined on a universe V, where each element e in V is "active" independently with probability p_e. Elements have weights {w_e} and the goal is to maximize the weight of a chosen subset S of active elements. However, we are given only the p_e values-- to determine whether or not an element e is active, our algorithm must probe e. If element e is probed and happens to be active, then e must irrevocably be added to the chosen set S; if e is not active then it is not included in S. Moreover, the following conditions must hold in every random instantiation: (1) the set Q of probed elements satisfy an "outer" packing constraint, and (2) the set S of chosen elements satisfy an "inner" packing constraint. #R##N#The kinds of packing constraints we consider are intersections of matroids and knapsacks. Our results provide a simple and unified view of results in stochastic matching and Bayesian mechanism design, and can also handle more general constraints. As an application, we obtain the first polynomial-time $\Omega(1/k)$-approximate "Sequential Posted Price Mechanism" under k-matroid intersection feasibility constraints.

Connected through hyperedge HE-1 (induced by source paper "learning optimal search algorithms from data"):
  with members:
    - "learning to prune speeding up repeated computations"
    - "the markovian price of information"
    - "learning to branch"
    - "competitive caching with machine learned advice"
    - "leapsandbounds a method for approximately optimal algorithm configuration"
    - "the price of information in combinatorial optimization"
    - "dispersion for data driven algorithm design online learning and private optimization"
    - "adaptivity gaps for stochastic probing submodular and xos functions"

Connected through hyperedge HE-2 (induced by source paper "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint"):
  with members:
    - "understanding the correlation gap for matchings"
    - "submodular maximization through the lens of linear programming"
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "constrained submodular maximization beyond 1 e"
    - "online contention resolution schemes"
    - "non negative submodular stochastic probing via stochastic contention resolution schemes"
    - "a k 3 2 approximation algorithm for monotone submodular k set packing and general k exchange systems"
    - "symmetry and approximability of submodular maximization problems"

Connected through hyperedge HE-3 (induced by source paper "the markovian price of information"):
  with members:
    - "the price of information in combinatorial optimization"
    - "optimal data acquisition for statistical estimation"
    - "adaptivity gaps for stochastic probing submodular and xos functions"
    - "descending price optimally coordinates search"
    - "descending price coordinates approximately efficient search"
    - "online contention resolution schemes"
    - "improved approximation algorithms for stochastic matching"
    - "submodular stochastic probing on matroids"

Connected through hyperedge HE-4 (induced by source paper "near optimal adaptivity gaps for stochastic multi value probing"):
  with members:
    - "a ptas for a class of stochastic dynamic programs"
    - "adaptivity gaps for stochastic probing submodular and xos functions"
    - "combinatorial prophet inequalities"
    - "discrete stochastic submodular maximization adaptive vs non adaptive vs offline"
    - "improved approximation algorithms for stochastic matching"
    - "approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover"
    - "submodular stochastic probing on matroids"
    - "on the adaptivity gap of stochastic orienteering"

Connected through hyperedge HE-5 (induced by source paper "algorithms and adaptivity gaps for stochastic k tsp"):
  with members:
    - "an fptas for stochastic unbounded min knapsack problem"
    - "a ptas for a class of stochastic dynamic programs"
    - "the price of information in combinatorial optimization"
    - "descending price coordinates approximately efficient search"
    - "approximation algorithms for correlated knapsacks and non martingale bandits"

Connected through hyperedge HE-6 (induced by source paper "attenuate locally win globally an attenuation based framework for online stochastic matching with timeouts"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "new algorithms better bounds and a novel model for online stochastic matching"
    - "improved approximation algorithms for stochastic matching"
    - "fast algorithms for online stochastic convex programming"
    - "when lp is the cure for your matching woes improved bounds for stochastic matchings"
    - "online stochastic matching online actions based on offline statistics"
    - "online stochastic packing applied to display ad allocation"
    - "a dynamic near optimal algorithm for online linear programming"

Connected through hyperedge HE-7 (induced by source paper "optimal online contention resolution schemes via ex ante prophet inequalities"):
  with members:
    - "random order contention resolution schemes"
    - "prophet secretary surpassing the 1 1 e barrier"
    - "understanding the correlation gap for matchings"
    - "matroid prophet inequalities"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"
    - "mechanism design via correlation gap"
    - "price of anarchy for greedy auctions"

Connected through hyperedge HE-8 (induced by source paper "submodular stochastic probing with prices"):
  with members:
    - "random order contention resolution schemes"
    - "the price of information in combinatorial optimization"
    - "online contention resolution schemes"
    - "non negative submodular stochastic probing via stochastic contention resolution schemes"
    - "submodular stochastic probing on matroids"
    - "optimal approximation for submodular and supermodular optimization with bounded curvature"
    - "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)