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: "doubly generalized ldpc codes stability bound over the bec"
  Abstract: The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of the stability condition, and is here referred to as stability bound. In this paper, a stability bound over the BEC is developed for doubly-generalized LDPC codes, where variable and check nodes can be generic linear block codes, assuming maximum a posteriori erasure correction at each node. It is proved that also in this generalized context the bound depends only on the variable and check component codes with minimum distance 2. A condition is also developed, namely, the derivative matching condition, under which the bound is achieved with equality. The stability bound leads to consider single parity-check codes used as variable nodes as an appealing option to overcome common problems created by generalized check nodes.

Connected through hyperedge HE-1 (induced by source paper "coded slotted aloha a graph based method for uncoordinated multiple access"):
  with members:
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "the throughput of slotted aloha with diversity"
    - "aloha random access that operates as a rateless code"
    - "spatially coupled random access on graphs"
    - "stable throughput in a cognitive wireless network"
    - "frameless aloha protocol for wireless networks"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

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 the growth rate of the weight distribution of irregular doubly generalized ldpc codes"
    - "on a class of doubly generalized ldpc codes with single parity check variable nodes"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"

Connected through hyperedge HE-3 (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"
    - "on the growth rate of the weight distribution of irregular doubly generalized ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "on the growth rate of the weight distribution of irregular doubly generalized ldpc codes"):
  with members:
    - "weight distribution and decoding of codes on hypergraphs"
    - "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the erasure channel with bounded complexity"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"
    - "distance properties of expander codes"

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 the growth rate of the weight distribution of irregular doubly generalized ldpc codes"
    - "on a class of doubly generalized ldpc codes with single parity check variable nodes"

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:
    - "on the growth rate of the weight distribution of irregular doubly generalized ldpc codes"

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)