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: "combinatorial semi bandit with known covariance"
  Abstract: The combinatorial stochastic semi-bandit problem is an extension of the classical multi-armed bandit problem in which an algorithm pulls more than one arm at each stage and the rewards of all pulled arms are revealed. One difference with the single arm variant is that the dependency structure of the arms is crucial. Previous works on this setting either used a worst-case approach or imposed independence of the arms. We introduce a way to quantify the dependency structure of the problem and design an algorithm that adapts to it. The algorithm is based on linear regression and the analysis develops techniques from the linear bandit literature. By comparing its performance to a new lower bound, we prove that it is optimal, up to a poly-logarithmic factor in the number of pulled arms.

Connected through hyperedge HE-1 (induced by source paper "tight lower bounds for combinatorial multi armed bandits"):
  with members:
    - "top k combinatorial bandits with full bandit feedback"
    - "thompson sampling for combinatorial network optimization in unknown environments"
    - "thompson sampling for combinatorial semi bandits"
    - "improving regret bounds for combinatorial semi bandits with probabilistically triggered arms and its applications"
    - "nearly instance optimal sample complexity bounds for top k arm selection"
    - "combinatorial multi armed bandit with general reward functions"
    - "combinatorial cascading bandits"
    - "combinatorial bandits revisited"

Connected through hyperedge HE-2 (induced by source paper "online joint bid daily budget optimization of internet advertising campaigns"):
  with members:
    - "bid optimization by multivariable control in display advertising"
    - "budget constrained bidding by model free reinforcement learning in display advertising"
    - "combinatorial semi bandits with knapsacks"
    - "display advertising with real time bidding rtb and behavioural targeting"
    - "feedback control of real time display advertising"
    - "multi touch attribution based budget allocation in online advertising"
    - "thompson sampling for budgeted multi armed bandits"
    - "smart pacing for effective online ad campaign optimization"

Connected through hyperedge HE-3 (induced by source paper "batch size independent regret bounds for the combinatorial multi armed bandit problem"):
  with members:
    - "thompson sampling for combinatorial semi bandits"
    - "thompson sampling for combinatorial multi armed bandit with probabilistically triggered arms"
    - "improving regret bounds for combinatorial semi bandits with probabilistically triggered arms and its applications"
    - "combinatorial multi armed bandit with general reward functions"
    - "online influence maximization under independent cascade model with semi bandit feedback"
    - "unifying count based exploration and intrinsic motivation"
    - "combinatorial cascading bandits"
    - "combinatorial bandits revisited"

Connected through hyperedge HE-4 (induced by source paper "online linear optimization with the log determinant regularizer"):
  with members:
    - "online learning without prior information"
    - "hardness of online sleeping combinatorial optimization problems"

Connected through hyperedge HE-5 (induced by source paper "regret of queueing bandits"):
  with members:
    - "combinatorial bandits revisited"
    - "learning to optimize via posterior sampling"
    - "regret bounds for restless markov bandits"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"
    - "analysis of thompson sampling for the multi armed bandit problem"
    - "stability and capacity regions or discrete time queueing networks"

Connected through hyperedge HE-6 (induced by source paper "learning unknown service rates in queues a multi armed bandit approach"):
  with members:
    - "regret of queueing bandits"
    - "combinatorial bandits revisited"
    - "congestion control of tcp flows in internet routers by means of index policy"
    - "regret bounds for restless markov bandits"
    - "analysis of thompson sampling for the multi armed bandit 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.LG(Machine Learning)