human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "decay of correlations for sparse graph error correcting codes"
  Abstract: The subject of this paper is transmission over a general class of binary-input memoryless symmetric channels using error correcting codes based on sparse graphs, namely low-density generator-matrix and low-density parity-check codes. The optimal (or ideal) decoder based on the posterior measure over the code bits, and its relationship to the sub-optimal belief propagation decoder, are investigated. We consider the correlation (or covariance) between two codebits, averaged over the noise realizations, as a function of the graph distance, for the optimal decoder. Our main result is that this correlation decays exponentially fast for fixed general low-density generator-matrix codes and high enough noise parameter, and also for fixed general low-density parity-check codes and low enough noise parameter. This has many consequences. Appropriate performance curves - called GEXIT functions - of the belief propagation and optimal decoders match in high/low noise regimes. This means that in high/low noise regimes the performance curves of the optimal decoder can be computed by density evolution. Another interpretation is that the replica predictions of spin-glass theory are exact. Our methods are rather general and use cluster expansions first developed in the context of mathematical statistical mechanics.

Connected through hyperedge HE-1 (induced by source paper "a scaling law to predict the finite length performance of spatially coupled ldpc codes"):
  with members:
    - "spatially coupled sparse codes on graphs theory and practice"
    - "on the convergence speed of spatially coupled ldpc ensembles"
    - "on the minimum distance of generalized spatially coupled ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "analytical solution of covariance evolution for irregular ldpc codes"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "exact free distance and trapping set growth rates for ldpc convolutional codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-2 (induced by source paper "concentration to zero bit error probability for regular ldpc codes on the binary symmetric channel proof by loop calculus"):
  with members:
    - "the bethe free energy allows to compute the conditional entropy of graphical code instances a proof from the polymer expansion"
    - "spatial coupling as a proof technique"
    - "beyond the bethe free energy of ldpc codes via polymer expansions"
    - "sharp bounds for optimal decoding of low density parity check codes"
    - "the generalized area theorem and some of its consequences"
    - "tight bounds for ldpc and ldgm codes under map decoding"

Connected through hyperedge HE-3 (induced by source paper "the bethe free energy allows to compute the conditional entropy of graphical code instances a proof from the polymer expansion"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "beyond the bethe free energy of ldpc codes via polymer expansions"
    - "the bethe partition function of log supermodular graphical models"
    - "partition functions of normal factor graphs"
    - "sharp bounds for optimal decoding of low density parity check codes"
    - "sufficient conditions for convergence of the sum product algorithm"
    - "loop calculus and belief propagation for q ary alphabet loop tower"
    - "tight bounds for ldpc and ldgm codes under map decoding"

Connected through hyperedge HE-4 (induced by source paper "frozen variables in random boolean constraint satisfaction problems"):
  with members:
    - "on independent sets in random graphs"
    - "the set of solutions of random xorsat formulae"
    - "catching the k naesat threshold"
    - "the solution space geometry of random linear equations"
    - "on the concentration of the number of solutions of random satisfiability formulas"
    - "reconstruction and clustering in random constraint satisfaction problems"
    - "tight thresholds for cuckoo hashing via xorsat"
    - "on the solution space geometry of random constraint satisfaction problems"

Connected through hyperedge HE-5 (induced by source paper "beyond the bethe free energy of ldpc codes via polymer expansions"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "polymer expansions for cycle ldpc codes"
    - "sharp bounds for optimal decoding of low density parity check codes"
    - "tight bounds for ldpc and ldgm codes under map decoding"

Connected through hyperedge HE-6 (induced by source paper "polymer expansions for cycle ldpc codes"):
  with members:
    - "on universal properties of capacity approaching ldpc code ensembles"

Connected through hyperedge HE-7 (induced by source paper "sharp bounds for optimal decoding of low density parity check codes"):
  with members:
    - "on universal properties of capacity approaching ldpc code ensembles"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"
    - "tight bounds for ldpc and ldgm codes under map decoding"

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