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: "optimal online contention resolution schemes via ex ante prophet inequalities"
  Abstract: Online contention resolution schemes (OCRSs) were proposed by Feldman, Svensson, and Zenklusen as a generic technique to round a fractional solution in the matroid polytope in an online fashion. It has found applications in several stochastic combinatorial problems where there is a commitment constraint: on seeing the value of a stochastic element, the algorithm has to immediately and irrevocably decide whether to select it while always maintaining an independent set in the matroid. Although OCRSs immediately lead to prophet inequalities, these prophet inequalities are not optimal. Can we instead use prophet inequalities to design optimal OCRSs? #R##N#We design the first optimal $1/2$-OCRS for matroids by reducing the problem to designing a matroid prophet inequality where we compare to the stronger benchmark of an ex-ante relaxation. We also introduce and design optimal $(1-1/e)$-random order CRSs for matroids, which are similar to OCRSs but the arrival is chosen uniformly at random.

Connected through hyperedge HE-1 (induced by source paper "prophet inequalities with linear correlations and augmentations"):
  with members:
    - "optimal single choice prophet inequalities from samples"
    - "robust algorithms for the secretary problem"
    - "prophet secretary through blind strategies"
    - "stochastic bandits robust to adversarial corruptions"
    - "prophet secretary surpassing the 1 1 e barrier"
    - "robustly learning a gaussian getting optimal error efficiently"
    - "prophet secretary for combinatorial auctions and matroids"
    - "online allocation with traffic spikes mixing adversarial and stochastic models"

Connected through hyperedge HE-2 (induced by source paper "simple mechanisms for non linear agents"):
  with members:
    - "optimal auctions vs anonymous pricing beyond linear utility"
    - "a simple mechanism for a budget constrained buyer"
    - "online contention resolution schemes"
    - "bayesian optimal auctions via multi to single agent reduction"
    - "the simple economics of approximately optimal auctions"
    - "mechanism design via correlation gap"
    - "correlation robust stochastic optimization"

Connected through hyperedge HE-3 (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"
    - "random order contention resolution schemes"
    - "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-4 (induced by source paper "prophet inequalities on the intersection of a matroid and a graph"):
  with members:
    - "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"
    - "combinatorial auctions via posted prices"

Connected through hyperedge HE-5 (induced by source paper "random order contention resolution schemes"):
  with members:
    - "algorithms to approximate column sparse packing problems"
    - "online contention resolution schemes"
    - "submodular stochastic probing on matroids"
    - "a stochastic probing problem with applications"
    - "matroid prophet inequalities"
    - "when lp is the cure for your matching woes improved bounds for stochastic matchings"
    - "on k column sparse packing programs"

Connected through hyperedge HE-6 (induced by source paper "the prophet inequality can be solved optimally with a single set of samples"):
  with members:
    - "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "online contention resolution schemes"
    - "matroid prophet inequalities"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"

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)