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 "community recovery in graphs with locality"):
  Abstract: Motivated by applications in domains such as social networks and computational biology, we study the problem of community recovery in graphs with locality. In this problem, pairwise noisy measurements of whether two nodes are in the same community or different communities come mainly or exclusively from nearby nodes rather than uniformly sampled between all nodes pairs, as in most existing models. We present an algorithm that runs nearly linearly in the number of measurements and which achieves the information theoretic limit for exact recovery.

Includes members:
  Member "stochastic block model and community detection in the sparse graphs a spectral algorithm with optimal rate of recovery":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "randomized spectral clustering in large scale stochastic block models")
  Member "information recovery from pairwise measurements a shannon theoretic approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "information theoretic bounds for exact recovery in weighted stochastic block models using the renyi divergence":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spectral clustering of signed graphs via matrix power means")
  Member "optimal haplotype assembly from high throughput mate pair reads":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi observation regression")
  Member "phase retrieval via wirtinger flow theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "near optimal joint object matching via convex relaxation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rgb d individual segmentation")
  Member "decoding binary node labels from censored edge measurements phase transition and efficient recovery":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spectral clustering of signed graphs via matrix power means")

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.IT(Information Theory)