human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "spectral mle top k rank aggregation from pairwise comparisons"):
  Abstract: This paper explores the preference-based top-$K$ rank aggregation problem. Suppose that a collection of items is repeatedly compared in pairs, and one wishes to recover a consistent ordering that emphasizes the top-$K$ ranked items, based on partially revealed preferences. We focus on the Bradley-Terry-Luce (BTL) model that postulates a set of latent preference scores underlying all items, where the odds of paired comparisons depend only on the relative scores of the items involved. #R##N#We characterize the minimax limits on identifiability of top-$K$ ranked items, in the presence of random and non-adaptive sampling. Our results highlight a separation measure that quantifies the gap of preference scores between the $K^{\text{th}}$ and $(K+1)^{\text{th}}$ ranked items. The minimum sample complexity required for reliable top-$K$ ranking scales inversely with the separation measure irrespective of other preference distribution metrics. To approach this minimax limit, we propose a nearly linear-time ranking scheme, called \emph{Spectral MLE}, that returns the indices of the top-$K$ items in accordance to a careful score estimate. In a nutshell, Spectral MLE starts with an initial score estimate with minimal squared loss (obtained via a spectral method), and then successively refines each component with the assistance of coordinate-wise MLEs. Encouragingly, Spectral MLE allows perfect top-$K$ item identification under minimal sample complexity. The practical applicability of Spectral MLE is further corroborated by numerical experiments.

Includes members:
  Member "information recovery from pairwise measurements a shannon theoretic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the projected power method an efficient algorithm for joint alignment from pairwise differences")
  Member "solving random quadratic systems of equations is nearly as easy as solving linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "phase retrieval via wirtinger flow theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "learning mixtures of ranking models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "supporting hard queries over probabilistic preferences")
  Member "renyi divergence and kullback leibler divergence":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "a statistical decision theoretic framework for social choice":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "top k ranking from pairwise comparisons when spectral ranking is optimal")
  Member "multiple identifications in multi armed bandits":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polynomial time algorithms for multiple arm identification with full bandit feedback")
  Member "active ranking using pairwise comparisons":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "learning from noisy similar and dissimilar data")

Question: Please tell me which class the source paper 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)