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 growth rate of the weight distribution of irregular doubly generalized ldpc codes"
  Abstract: In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expression is compact and generalizes existing results for LDPC and generalized LDPC (GLDPC) codes. Ensembles with check or variable node minimum distance greater than 2 are shown to be have good growth rate behavior, while for other ensembles a fundamental parameter is identified which discriminates between an asymptotically small and an asymptotically large expected number of small linear-weight codewords. Also, in the latter case it is shown that the growth rate depends only on the check and variable nodes with minimum distance 2. An important connection between this new result and the stability condition of D-GLDPC codes over the BEC is highlighted. Such a connection, previously observed for LDPC and GLDPC codes, is now extended to the case of D-GLDPC codes. Finally, it is shown that the analysis may be extended to include the growth rate of the stopping set size distribution of irregular D-GLDPC codes.

Connected through hyperedge HE-1 (induced by source paper "counting in graph covers a combinatorial characterization of the bethe entropy function"):
  with members:
    - "the bethe permanent of a nonnegative matrix"
    - "beyond log supermodularity lower bounds and the bethe partition function"
    - "new generalizations of the bethe approximation via asymptotic expansion"
    - "central approximation in statistical physics and information theory"
    - "the bethe partition function of log supermodular graphical models"
    - "pseudocodewords from bethe permanents"
    - "connection between annealed free energy and belief propagation on random factor graph ensembles"
    - "normal factor graphs and holographic transformations"

Connected through hyperedge HE-2 (induced by source paper "spectral shape of doubly generalized ldpc codes efficient and exact evaluation"):
  with members:
    - "weight distributions of regular low density parity check codes over finite fields"
    - "weight distributions of multi edge type ldpc codes"
    - "on a class of doubly generalized ldpc codes with single parity check variable nodes"
    - "doubly generalized ldpc codes stability bound over the bec"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"

Connected through hyperedge HE-3 (induced by source paper "minimum distance distribution of irregular generalized ldpc code ensembles"):
  with members:
    - "spectral shape of doubly generalized ldpc codes efficient and exact evaluation"
    - "weight distribution and decoding of codes on hypergraphs"

Connected through hyperedge HE-4 (induced by source paper "stability of iterative decoding of multi edge type doubly generalized ldpc codes over the bec"):
  with members:
    - "weight distributions of multi edge type ldpc codes"
    - "doubly generalized ldpc codes stability bound over the bec"

Connected through hyperedge HE-5 (induced by source paper "growth rate of the weight distribution of doubly generalized ldpc codes general case and efficient evaluation"):
  with members:
    - "on a class of doubly generalized ldpc codes with single parity check variable nodes"
    - "doubly generalized ldpc codes stability bound over the bec"

Connected through hyperedge HE-6 (induced by source paper "on a class of doubly generalized ldpc codes with single parity check variable nodes"):
  with members:
    - "doubly generalized ldpc codes stability bound over the bec"

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)