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: "beyond matroids secretary problem and prophet inequality with general constraints"
  Abstract: We study generalizations of the "Prophet Inequality" and "Secretary Problem", where the algorithm is restricted to an arbitrary downward-closed set system. For {0,1}-values, we give O(log n)-competitive algorithms for both problems. This is close to the \Omega(log n / loglog n) lower bound due to Babaioff, Immorlica, and Kleinberg. For general values, our results translate to O(log n log r)-competitive algorithms, where r is the cardinality of the largest feasible set. This resolves (up to the O(log r loglog n) factors) an open question posed to us by Bobby Kleinberg.

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"
    - "optimal online contention resolution schemes via ex ante prophet inequalities"
    - "prophet secretary surpassing the 1 1 e barrier"
    - "robustly learning a gaussian getting optimal error efficiently"
    - "prophet secretary for combinatorial auctions and matroids"

Connected through hyperedge HE-2 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models"):
  with members:
    - "beating greedy for stochastic bipartite matching"
    - "online stochastic matching with edge arrivals"
    - "optimal single choice prophet inequalities from samples"
    - "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint"
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "prophet inequality for bipartite matching merits of being simple and non adaptive"
    - "tight competitive ratios of classic matching algorithms in the fully online model"
    - "how to match when all vertices arrive online"

Connected through hyperedge HE-3 (induced by source paper "random order models"):
  with members:
    - "robust algorithms for the secretary problem"
    - "prophet secretary for combinatorial auctions and matroids"
    - "combinatorial prophet inequalities"
    - "secretary problems with non uniform arrival order"
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "prophet inequalities with limited information"
    - "primal beats dual on online packing lps in the random order model"
    - "fast incremental and personalized pagerank"

Connected through hyperedge HE-4 (induced by source paper "prophet inequality for bipartite matching merits of being simple and non adaptive"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "tight competitive ratios of classic matching algorithms in the fully online model"
    - "how to match when all vertices arrive online"
    - "maximizing efficiency in dynamic matching markets"
    - "makespan minimization via posted prices"
    - "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs"
    - "online contention resolution schemes"
    - "the invisible hand of dynamic market pricing"

Connected through hyperedge HE-5 (induced by source paper "robust algorithms for the secretary problem"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "stochastic bandits robust to adversarial corruptions"
    - "learning geometric concepts with nasty noise"
    - "learning from untrusted data"
    - "agnostic estimation of mean and covariance"
    - "robust estimators in high dimensions without the computational intractability"
    - "combinatorial prophet inequalities"
    - "online and random order load balancing simultaneously"

Connected through hyperedge HE-6 (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"
    - "random order contention resolution schemes"
    - "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"

Connected through hyperedge HE-7 (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"
    - "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"
    - "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-8 (induced by source paper "competitive online optimization under inventory constraints"):
  with members:
    - "balancing cost and dissatisfaction in online ev charging under real time pricing"
    - "nested convex bodies are chaseable"
    - "online offering strategies for storage assisted renewable power producer in hour ahead market"
    - "online convex optimization using predictions"
    - "a tale of two metrics simultaneous bounds on competitiveness and regret"
    - "peak aware online economic dispatching for microgrids"
    - "the submodular secretary problem goes linear"
    - "online energy generation scheduling for microgrids with intermittent energy sources and co generation"

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)