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 generalized random energy model and its application to the statistical physics of ensembles of hierarchical codes"):
  Abstract: In an earlier work, the statistical physics associated with finite-temperature decoding of code ensembles, along with the relation to their random coding error exponents, were explored in a framework that is analogous to Derrida's random energy model (REM) of spin glasses, according to which the energy levels of the various spin configurations are independent random variables. The generalized REM (GREM) extends the REM in that it introduces correlations between energy levels in an hierarchical structure. In this paper, we explore some analogies between the behavior of the GREM and that of code ensembles which have parallel hierarchical structures. In particular, in analogy to the fact that the GREM may have different types of phase transition effects, depending on the parameters of the model, then the above-mentioned hierarchical code ensembles behave substantially differently in the various domains of the design parameters of these codes. We make an attempt to explore the insights that can be imported from the statistical mechanics of the GREM and be harnessed to serve for code design considerations and guidelines.

Includes members:
  Member "error exponents of erasure list decoding revisited via moments of distance enumerators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exact error and erasure exponents for the asymmetric broadcast channel")
  Member "modern coding theory the statistical mechanics and computer science point of view":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on universal properties of capacity approaching ldpc code ensembles")
  Member "a statistical mechanical interpretation of instantaneous codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a statistical mechanical interpretation of algorithmic information theory")
  Member "relations between random coding exponents and the statistical physics of random codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the reliability function of distributed hypothesis testing under optimal detection")
  Member "tight bounds for ldpc and ldgm codes under map decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "accuracy memory tradeoffs and phase transitions in belief propagation")

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)