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 "the mutual information of ldgm codes"):
  Abstract: We provide matching upper and lower bounds on the mutual information in noisy reconstruction of parity check codes and thereby prove a long-standing conjecture by Montanari [IEEE Transactions on Information Theory 2005]. Besides extending a prior concentration result of Abbe and Montanari [Theory of Computing 2015] to the case of odd check degrees, we precisely determine the conjectured formula for code ensembles of arbitrary degree distribution, thus capturing a broad class of capacity approaching codes.

Includes members:
  Member "the computer science and physics of community detection landscapes phase transitions and hardness":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mean field theory of graph neural networks in graph partitioning")
  Member "multi layer generalized linear estimation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deep s 3 pr simultaneous source separation and phase retrieval using deep generative models")
  Member "i mmse relations in random linear estimation and a sub extensive interpolation method":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the stochastic interpolation method a simple scheme to prove replica formulas in bayesian inference")
  Member "threshold saturation of spatially coupled sparse superposition codes for all memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "compressed coding amp based decoding and analog spatial coupling")
  Member "phase transitions and sample complexity in bayes optimal matrix factorization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "community detection thresholds and the weak ramanujan property":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "from tree matching to sparse graph alignment")
  Member "sharp bounds for optimal decoding of low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "overlap matrix concentration in optimal bayesian inference")
  Member "hiding satisfying assignments two are better than one":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "community based 3 sat formulas with a predefined solution")

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)