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 "estimating random variables from random sparse observations"):
  Abstract: Let X_1,...., X_n be a collection of iid discrete random variables, and Y_1,..., Y_m a set of noisy observations of such variables. Assume each observation Y_a to be a random function of some a random subset of the X_i's, and consider the conditional distribution of X_i given the observations, namely \mu_i(x_i)\equiv\prob\{X_i=x_i|Y\} (a posteriori probability). #R##N#We establish a general relation between the distribution of \mu_i, and the fixed points of the associated density evolution operator. Such relation holds asymptotically in the large system limit, provided the average number of variables an observation depends on is bounded. We discuss the relevance of our result to a number of applications, ranging from sparse graph codes, to multi-user detection, to group testing.

Includes members:
  Member "sparsely spread cdma a statistical mechanics based analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of low density spreading noma with fading")
  Member "group testing with random pools optimal two stage algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal multistage group testing algorithm for 3 defectives")
  Member "detailed network measurements using sparse graph counters the theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asymptotic analysis and spatial coupling of counter braids")
  Member "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding phase transitions via mutual information and mmse")
  Member "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reed muller codes theory and algorithms")
  Member "the generalized area theorem and some of its consequences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reed muller codes theory and algorithms")
  Member "tight bounds for ldpc and ldgm codes under map decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "accuracy memory tradeoffs and phase transitions in belief propagation")
  Member "randomly spread cdma asymptotics via statistical physics":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")

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)