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: "multi dueling bandits and their application to online ranker evaluation"
  Abstract: New ranking algorithms are continually being developed and refined, necessitating the development of efficient methods for evaluating these rankers. Online ranker evaluation focuses on the challenge of efficiently determining, from implicit user feedback, which ranker out of a finite set of rankers is the best. Online ranker evaluation can be modeled by dueling ban- dits, a mathematical model for online learning under limited feedback from pairwise comparisons. Comparisons of pairs of rankers is performed by interleaving their result sets and examining which documents users click on. The dueling bandits model addresses the key issue of which pair of rankers to compare at each iteration, thereby providing a solution to the exploration-exploitation trade-off. Recently, methods for simultaneously comparing more than two rankers have been developed. However, the question of which rankers to compare at each iteration was left open. We address this question by proposing a generalization of the dueling bandits model that uses simultaneous comparisons of an unrestricted number of rankers. We evaluate our algorithm on synthetic data and several standard large-scale online ranker evaluation datasets. Our experimental results show that the algorithm yields orders of magnitude improvement in performance compared to stateof- the-art dueling bandit algorithms.

Connected through hyperedge HE-1 (induced by source paper "regret minimization in stochastic contextual dueling bandits"):
  with members:
    - "combinatorial bandits with relative feedback"
    - "pac ranking from pairwise and listwise queries lower bounds and upper bounds"
    - "a nearly instance optimal algorithm for top k ranking under the multinomial logit model"
    - "provably optimal algorithms for generalized linear contextual bandits"
    - "multi dueling bandits with dependent arms"
    - "data driven rank breaking for efficient rank aggregation"
    - "double thompson sampling for dueling bandits"
    - "copeland dueling bandits"

Connected through hyperedge HE-2 (induced by source paper "combinatorial bandits with relative feedback"):
  with members:
    - "pac ranking from pairwise and listwise queries lower bounds and upper bounds"
    - "pac battling bandits in the plackett luce model"
    - "a nearly instance optimal algorithm for top k ranking under the multinomial logit model"
    - "mnl bandit a dynamic learning approach to assortment selection"
    - "multi dueling bandits with dependent arms"
    - "thompson sampling for the mnl bandit"
    - "dcm bandits learning to rank with multiple clicks"
    - "data driven rank breaking for efficient rank aggregation"

Connected through hyperedge HE-3 (induced by source paper "from pac to instance optimal sample complexity in the plackett luce model"):
  with members:
    - "active ranking with subset wise preferences"
    - "pac ranking from pairwise and listwise queries lower bounds and upper bounds"
    - "pac battling bandits in the plackett luce model"
    - "a nearly instance optimal algorithm for top k ranking under the multinomial logit model"
    - "multi dueling bandits with dependent arms"
    - "competitive analysis of the top k ranking problem"
    - "data driven rank breaking for efficient rank aggregation"
    - "noisy sorting without resampling"

Connected through hyperedge HE-4 (induced by source paper "preference based online learning with dueling bandits a survey"):
  with members:
    - "multi dueling bandits with dependent arms"
    - "dueling bandits with dependent arms"
    - "double thompson sampling for dueling bandits"
    - "reducing dueling bandits to cardinal bandits"
    - "further optimal regret bounds for thompson sampling"
    - "contextual bandit algorithms with supervised learning guarantees"
    - "online convex optimization in the bandit setting gradient descent without a gradient"

Connected through hyperedge HE-5 (induced by source paper "merge double thompson sampling for large scale online ranker evaluation"):
  with members:
    - "preference based online learning with dueling bandits a survey"
    - "multi dueling bandits with dependent arms"
    - "double thompson sampling for dueling bandits"
    - "contextual dueling bandits"
    - "reducing dueling bandits to cardinal bandits"
    - "relative upper confidence bound for the k armed dueling bandit problem"

Connected through hyperedge HE-6 (induced by source paper "dependencies formalising semantic catenae for information retrieval"):
  with members:
    - "fixed versus dynamic co occurrence windows in textrank term weights for information retrieval"
    - "preliminary experiments using subjective logic for the polyrepresentation of information needs"
    - "rhetorical relations for information retrieval"
    - "time series adaptive estimation of vaccination uptake using web search queries"
    - "part of speech based term weighting for information retrieval"
    - "learning to generate compositional color descriptions"
    - "adaptive distributional extensions to dfr ranking"
    - "exploiting the bipartite structure of entity grids for document coherence and retrieval"

Connected through hyperedge HE-7 (induced by source paper "multi dueling bandits with dependent arms"):
  with members:
    - "a relative exponential weighing algorithm for adversarial utility based dueling bandits"
    - "double thompson sampling for dueling bandits"
    - "contextual dueling bandits"
    - "reducing dueling bandits to cardinal bandits"
    - "learning to optimize via posterior sampling"
    - "analysis of thompson sampling for the multi armed bandit problem"

Connected through hyperedge HE-8 (induced by source paper "evaluation measures for relevance and credibility in ranked lists"):
  with members:
    - "an improved multileaving algorithm for online ranker evaluation"
    - "a study of factuality objectivity and relevance three desiderata in large scale information retrieval"
    - "assessing the quality of web content"

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.IR(Information Retrieval)