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: "random order contention resolution schemes"
  Abstract: Contention resolution schemes have proven to be an incredibly powerful concept which allows to tackle a broad class of problems. The framework has been initially designed to handle submodular optimization under various types of constraints, that is, intersections of exchange systems (including matroids), knapsacks, and unsplittable flows on trees. Later on, it turned out that this framework perfectly extends to optimization under uncertainty, like stochastic probing and online selection problems, which further can be applied to mechanism design. #R##N#We add to this line of work by showing how to create contention resolution schemes for intersection of matroids and knapsacks when we work in the random order setting. More precisely, we do know the whole universe of elements in advance, but they appear in an order given by a random permutation. Upon arrival we need to irrevocably decide whether to take an element or not. We bring a novel technique for analyzing procedures in the random order setting that is based on the martingale theory. This unified approach makes it easier to combine constraints, and we do not need to rely on the monotonicity of contention resolution schemes. #R##N#Our paper fills the gaps, extends, and creates connections between many previous results and techniques. The main application of our framework is a $k+4+\varepsilon$ approximation ratio for the Bayesian multi-parameter unit-demand mechanism design under the constraint of $k$ matroids intersection, which improves upon the previous bounds of $4k-2$ and $e(k+1)$. Other results include improved approximation ratios for stochastic $k$-set packing and submodular stochastic probing over arbitrary non-negative submodular objective function, whereas previous results required the objective to be monotone.

Connected through hyperedge HE-1 (induced by source paper "optimal single choice prophet inequalities from samples"):
  with members:
    - "prophet inequality for bipartite matching merits of being simple and non adaptive"
    - "prophet secretary through blind strategies"
    - "nearly optimal pricing algorithms for production constrained and laminar bayesian selection"
    - "prophet secretary surpassing the 1 1 e barrier"
    - "pricing for online resource allocation intervals and paths"
    - "prophet secretary for combinatorial auctions and matroids"
    - "combinatorial prophet inequalities"
    - "beyond matroids secretary problem and prophet inequality with general constraints"

Connected through hyperedge HE-2 (induced by source paper "the outer limits of contention resolution on matroids and connections to the secretary problem"):
  with members:
    - "the prophet inequality can be solved optimally with a single set of samples"
    - "optimal online contention resolution schemes via ex ante prophet inequalities"
    - "prophet secretary surpassing the 1 1 e barrier"
    - "prophet secretary for combinatorial auctions and matroids"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "online contention resolution schemes"
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem"

Connected through hyperedge HE-3 (induced by source paper "optimal online contention resolution schemes via ex ante prophet inequalities"):
  with members:
    - "prophet secretary surpassing the 1 1 e barrier"
    - "understanding the correlation gap for matchings"
    - "a stochastic probing problem with applications"
    - "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-4 (induced by source paper "submodular stochastic probing with prices"):
  with members:
    - "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"
    - "a stochastic probing problem with applications"
    - "optimal approximation for submodular and supermodular optimization with bounded curvature"
    - "online stochastic matching beating 1 1 e"

Connected through hyperedge HE-5 (induced by source paper "guess free maximization of submodular and linear sums"):
  with members:
    - "a new approximation guarantee for monotone submodular function maximization via discrete convexity"
    - "constrained submodular maximization beyond 1 e"
    - "online contention resolution schemes"
    - "maximizing symmetric submodular functions"
    - "a stochastic probing problem with applications"
    - "optimal approximation for submodular and supermodular optimization with bounded curvature"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"

Connected through hyperedge HE-6 (induced by source paper "algorithms to approximate column sparse packing problems"):
  with members:
    - "attenuate locally win globally an attenuation based framework for online stochastic matching with timeouts"
    - "adaptivity gaps for stochastic probing submodular and xos functions"
    - "improved algorithmic bounds for discrepancy of sparse set systems"
    - "deterministic discrepancy minimization via the multiplicative weight update method"
    - "constrained submodular maximization via a non symmetric technique"
    - "constrained submodular maximization beyond 1 e"
    - "non negative submodular stochastic probing via stochastic contention resolution schemes"
    - "improved approximation algorithms for stochastic matching"

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)