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: "sharp bounds for optimal decoding of low density parity check codes"
  Abstract: Consider communication over a binary-input memoryless output-symmetric channel with low density parity check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic formula for the average input-output conditional entropy per bit in the infinite block length limit. Montanari proved a lower bound for this entropy, in the case of LDPC ensembles with convex check degree polynomial, which matches the replica formula. Here we extend this lower bound to any irregular LDPC ensemble. The new feature of our work is an analysis of the second derivative of the conditional input-output entropy with respect to noise. A close relation arises between this second derivative and correlation or mutual information of codebits. This allows us to extend the realm of the interpolation method, in particular we show how channel symmetry allows to control the fluctuations of the overlap parameters.

Connected through hyperedge HE-1 (induced by source paper "overlap matrix concentration in optimal bayesian inference"):
  with members:
    - "optimal errors and phase transitions in high dimensional generalized linear models"
    - "asymptotics of map inference in deep networks"
    - "entropy and mutual information in models of deep neural networks"
    - "mutual information for low rank even order symmetric tensor factorization"
    - "the committee machine computational to statistical gaps in learning a two layers neural network"
    - "rank one matrix estimation analysis of algorithmic and information theoretic limits by the spatial coupling method"
    - "the mutual information in random linear estimation beyond i i d matrices"
    - "adaptive path interpolation for sparse systems application to a simple censored block model"

Connected through hyperedge HE-2 (induced by source paper "concentration of the matrix valued minimum mean square error in optimal bayesian inference"):
  with members:
    - "overlap matrix concentration in optimal bayesian inference"
    - "optimal errors and phase transitions in high dimensional generalized linear models"
    - "asymptotics of map inference in deep networks"
    - "entropy and mutual information in models of deep neural networks"
    - "mutual information for low rank even order symmetric tensor factorization"
    - "the committee machine computational to statistical gaps in learning a two layers neural network"
    - "rank one matrix estimation analysis of algorithmic and information theoretic limits by the spatial coupling method"
    - "the mutual information in random linear estimation beyond i i d matrices"

Connected through hyperedge HE-3 (induced by source paper "adaptive path interpolation for sparse systems application to a simple censored block model"):
  with members:
    - "optimal errors and phase transitions in high dimensional generalized linear models"
    - "entropy and mutual information in models of deep neural networks"
    - "the committee machine computational to statistical gaps in learning a two layers neural network"
    - "information theoretic thresholds from the cavity method"
    - "the layered structure of tensor estimation and its mutual information"
    - "mutual information and optimality of approximate message passing in random linear estimation"
    - "the replica symmetric prediction for compressed sensing with gaussian matrices is exact"
    - "the mutual information in random linear estimation"

Connected through hyperedge HE-4 (induced by source paper "the stochastic interpolation method a simple scheme to prove replica formulas in bayesian inference"):
  with members:
    - "optimal errors and phase transitions in high dimensional generalized linear models"
    - "entropy and mutual information in models of deep neural networks"
    - "the mutual information in random linear estimation beyond i i d matrices"
    - "adaptive path interpolation for sparse systems application to a simple censored block model"
    - "information theoretic thresholds from the cavity method"
    - "the layered structure of tensor estimation and its mutual information"
    - "i mmse relations in random linear estimation and a sub extensive interpolation method"
    - "mutual information and optimality of approximate message passing in random linear estimation"

Connected through hyperedge HE-5 (induced by source paper "the mutual information of ldgm codes"):
  with members:
    - "the computer science and physics of community detection landscapes phase transitions and hardness"
    - "multi layer generalized linear estimation"
    - "i mmse relations in random linear estimation and a sub extensive interpolation method"
    - "threshold saturation of spatially coupled sparse superposition codes for all memoryless channels"
    - "phase transitions and sample complexity in bayes optimal matrix factorization"
    - "community detection thresholds and the weak ramanujan property"
    - "hiding satisfying assignments two are better than one"
    - "tight bounds for ldpc and ldgm codes under map decoding"

Connected through hyperedge HE-6 (induced by source paper "analysis of regularized ls reconstruction and random matrix ensembles in compressed sensing"):
  with members:
    - "isotropically random orthogonal matrices performance of lasso and minimum conic singular values"
    - "on the performance of turbo signal recovery with partial dft sensing matrices"
    - "inference for generalized linear models via alternating directions and bethe free energy minimization"
    - "s amp approximate message passing for general matrix ensembles"
    - "signal recovery using expectation consistent approximation for linear observations"
    - "on sparse vector recovery performance in structurally orthogonal matrices via lasso"
    - "asymptotic mmse analysis under sparse representation modeling"
    - "statistical mechanics approach to sparse noise denoising"

Connected through hyperedge HE-7 (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"
    - "decay of correlations for sparse graph error correcting codes"
    - "the generalized area theorem and some of its consequences"
    - "tight bounds for ldpc and ldgm codes under map decoding"

Connected through hyperedge HE-8 (induced by source paper "a simple proof of maxwell saturation for coupled scalar recursions"):
  with members:
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "spatial coupling as a proof technique"
    - "a simple proof of threshold saturation for coupled scalar recursions"

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)