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: "prophet secretary for combinatorial auctions and matroids"
  Abstract: The secretary and the prophet inequality problems are central to the field of Stopping Theory. Recently, there has been a lot of work in generalizing these models to multiple items because of their applications in mechanism design. The most important of these generalizations are to matroids and to combinatorial auctions (extends bipartite matching). Kleinberg-Weinberg \cite{KW-STOC12} and Feldman et al. \cite{feldman2015combinatorial} show that for adversarial arrival order of random variables the optimal prophet inequalities give a $1/2$-approximation. For many settings, however, it's conceivable that the arrival order is chosen uniformly at random, akin to the secretary problem. For such a random arrival model, we improve upon the $1/2$-approximation and obtain $(1-1/e)$-approximation prophet inequalities for both matroids and combinatorial auctions. This also gives improvements to the results of Yan \cite{yan2011mechanism} and Esfandiari et al. \cite{esfandiari2015prophet} who worked in the special cases where we can fully control the arrival order or when there is only a single item. #R##N#Our techniques are threshold based. We convert our discrete problem into a continuous setting and then give a generic template on how to dynamically adjust these thresholds to lower bound the expected total welfare.

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"
    - "online allocation with traffic spikes mixing adversarial and stochastic models"

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"
    - "combinatorial prophet inequalities"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "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 "predict and match prophet inequalities with uncertain supply"):
  with members:
    - "prophet secretary through blind strategies"
    - "prophet secretary surpassing the 1 1 e barrier"
    - "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs"
    - "combinatorial prophet inequalities"
    - "combinatorial auctions via posted prices"
    - "matroid prophet inequalities"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "approximation algorithms for correlated knapsacks and non martingale bandits"

Connected through hyperedge HE-5 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders"):
  with members:
    - "complement free couples must communicate a hardness result for two player combinatorial auctions"
    - "beyond 1 2 approximation for submodular maximization on massive data streams"
    - "on simultaneous two player combinatorial auctions"
    - "combinatorial auctions do need modest interaction"
    - "breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders"
    - "computational efficiency requires simple taxation"
    - "online matroid intersection beating half for random arrival"
    - "inapproximability of truthful mechanisms via generalizations of the vc dimension"

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"
    - "combinatorial prophet inequalities"
    - "beyond matroids secretary problem and prophet inequality with general constraints"

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"
    - "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-8 (induced by source paper "beating greedy for stochastic bipartite matching"):
  with members:
    - "the price of information in combinatorial optimization"
    - "the stochastic matching problem beating half with a non adaptive algorithm"
    - "almost optimal stochastic weighted matching with few queries"
    - "stochastic packing integer programs with few queries"
    - "new algorithms better bounds and a novel model for online stochastic matching"
    - "ignorance is almost bliss near optimal stochastic matching with few queries"
    - "improved approximation algorithms for stochastic matching"
    - "the query commit problem"

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)