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: "on the asymptotic weight and stopping set distribution of regular ldpc ensembles"
  Abstract: In this correspondence, we estimate the variance of weight and stopping set distribution of regular low-density parity-check (LDPC) ensembles. Using this estimate and the second moment method we obtain bounds on the probability that a randomly chosen code from regular LDPC ensemble has its weight distribution and stopping set distribution close to respective ensemble averages. We are able to show that a large fraction of total number of codes have their weight and stopping set distribution close to the average

Connected through hyperedge HE-1 (induced by source paper "the approximate maximum likelihood certificate"):
  with members:
    - "improved linear programming decoding of ldpc codes and bounds on the minimum and fractional distance"
    - "linear programming decoding of nonbinary linear codes"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "towards low complexity linear programming decoding"

Connected through hyperedge HE-2 (induced by source paper "second order weight distributions"):
  with members:
    - "good random matrices over finite fields"
    - "weight distributions of regular low density parity check codes over finite fields"
    - "linear codes based lossless joint source channel coding for multiple access channels"
    - "growth rate of the weight distribution of doubly generalized ldpc codes general case and efficient evaluation"

Connected through hyperedge HE-3 (induced by source paper "weight distributions of regular low density parity check codes over finite fields"):
  with members:
    - "constructing linear encoders with good spectra"
    - "growth rate of the weight distribution of doubly generalized ldpc codes general case and efficient evaluation"
    - "constructing linear codes with good joint spectra"

Connected through hyperedge HE-4 (induced by source paper "stopping set distributions of some linear codes"):
  with members:
    - "single exclusion number and the stopping redundancy of mds codes"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "results on parity check matrices with optimal stopping and or dead end set enumerators"
    - "complete enumeration of stopping sets of full rank parity check matrices of hamming codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-5 (induced by source paper "bounds on thresholds related to maximum satisfiability of regular random formulas"):
  with members:
    - "bounds on threshold of regular random k sat"

Connected through hyperedge HE-6 (induced by source paper "bounds on threshold of regular random k sat"):
  with members:
    - "bounds on thresholds related to maximum satisfiability of regular random formulas"

Connected through hyperedge HE-7 (induced by source paper "modern coding theory the statistical mechanics and computer science point of view"):
  with members:
    - "counting good truth assignments of random k sat formulae"
    - "the generalized area theorem and some of its consequences"
    - "tight bounds for ldpc and ldgm codes under map decoding"
    - "density evolution for asymmetric memoryless channels"
    - "finite length scaling for iteratively decoded ldpc ensembles"
    - "a new look at survey propagation and its generalizations"

Connected through hyperedge HE-8 (induced by source paper "barriers and local minima in energy landscapes of stochastic local search"):
  with members:
    - "on the solution space geometry of random constraint satisfaction problems"
    - "a new look at survey propagation and its generalizations"
    - "threshold values of random k sat from the cavity method"
    - "when gravity fails local search topology"

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)