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: "online independent set beyond the worst case secretaries prophets and periods"
  Abstract: We investigate online algorithms for maximum (weight) independent set on graph classes with bounded inductive independence number like, e.g., interval and disk graphs with applications to, e.g., task scheduling and spectrum allocation. In the online setting, it is assumed that nodes of an unknown graph arrive one by one over time. An online algorithm has to decide whether an arriving node should be included into the independent set. Unfortunately, this natural and practically relevant online problem cannot be studied in a meaningful way within a classical competitive analysis as the competitive ratio on worst-case input sequences is lower bounded by $\Omega(n)$. #R##N#As a worst-case analysis is pointless, we study online independent set in a stochastic analysis. Instead of focussing on a particular stochastic input model, we present a generic sampling approach that enables us to devise online algorithms achieving performance guarantees for a variety of input models. In particular, our analysis covers stochastic input models like the secretary model, in which an adversarial graph is presented in random order, and the prophet-inequality model, in which a randomly generated graph is presented in adversarial order. Our sampling approach bridges thus between stochastic input models of quite different nature. In addition, we show that our approach can be applied to a practically motivated admission control setting. #R##N#Our sampling approach yields an online algorithm for maximum independent set with competitive ratio $O(\rho^2)$ with respect to all of the mentioned stochastic input models. for graph classes with inductive independence number $\rho$. The approach can be extended towards maximum-weight independent set by losing only a factor of $O(\log n)$ in the competitive ratio with $n$ denoting the (expected) number of nodes.

Connected through hyperedge HE-1 (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"
    - "beyond matroids secretary problem and prophet inequality with general constraints"

Connected through hyperedge HE-2 (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-3 (induced by source paper "prophets secretaries and maximizing the probability of choosing the best"):
  with members:
    - "stochastic k server how should uber work"
    - "prophet secretary for combinatorial auctions and matroids"
    - "online matroid intersection beating half for random arrival"
    - "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"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "mechanism design via correlation gap"
    - "algorithms for secretary problems on graphs and hypergraphs"

Connected through hyperedge HE-4 (induced by source paper "the secretary recommendation problem"):
  with members:
    - "delegated search approximates efficient search"
    - "combinatorial secretary problems with ordinal information"
    - "algorithmic persuasion with no externalities"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "algorithmic bayesian persuasion"

Connected through hyperedge HE-5 (induced by source paper "effective wireless scheduling via hypergraph sketches"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "jamming resistant learning in wireless networks"
    - "dynamic packet scheduling in wireless networks"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "algorithms for wireless capacity"

Connected through hyperedge HE-6 (induced by source paper "spanning trees with edge conflicts and wireless connectivity"):
  with members:
    - "wireless link capacity under shadowing and fading"
    - "the price of local power control in wireless scheduling"
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "dynamic packet scheduling in wireless networks"
    - "algorithms for wireless capacity"
    - "graph products revisited tight approximation hardness of induced matching poset dimension and more"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"

Connected through hyperedge HE-7 (induced by source paper "packing returning secretaries"):
  with members:
    - "combinatorial secretary problems with ordinal information"
    - "beyond matroids secretary problem and prophet inequality with general constraints"
    - "submodular secretary problems cardinality matching and linear constraints"
    - "the temp secretary problem"
    - "the submodular secretary problem goes linear"
    - "o log log rank competitive ratio for the matroid secretary problem"
    - "algorithms for secretary problems on graphs and hypergraphs"

Connected through hyperedge HE-8 (induced by source paper "a framework for the secretary problem on the intersection of matroids"):
  with members:
    - "secretary problems with non uniform arrival order"
    - "online contention resolution schemes"
    - "prophet inequalities with limited information"
    - "polymatroid prophet inequalities"
    - "matroid prophet inequalities"
    - "advances on matroid secretary problems free order model and laminar case"
    - "matroid secretary for regular and decomposable matroids"
    - "on variants of the matroid secretary 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)