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: "capacity achieving codes with bounded graphical complexity on noisy channels"
  Abstract: We introduce a new family of concatenated codes with an outer low-density parity-check (LDPC) code and an inner low-density generator matrix (LDGM) code, and prove that these codes can achieve capacity under any memoryless binary-input output-symmetric (MBIOS) channel using maximum-likelihood (ML) decoding with bounded graphical complexity, i.e., the number of edges per information bit in their graphical representation is bounded. In particular, we also show that these codes can achieve capacity on the binary erasure channel (BEC) under belief propagation (BP) decoding with bounded decoding complexity per information bit per iteration for all erasure probabilities in (0, 1). By deriving and analyzing the average weight distribution (AWD) and the corresponding asymptotic growth rate of these codes with a rate-1 inner LDGM code, we also show that these codes achieve the Gilbert-Varshamov bound with asymptotically high probability. This result can be attributed to the presence of the inner rate-1 LDGM code, which is demonstrated to help eliminate high weight codewords in the LDPC code while maintaining a vanishingly small amount of low weight codewords.

Connected through hyperedge HE-1 (induced by source paper "on universal properties of capacity approaching ldpc code ensembles"):
  with members:
    - "on the design of universal ldpc codes"
    - "modern coding theory the statistical mechanics and computer science point of view"
    - "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the erasure channel with bounded complexity"
    - "channel coding the road to channel capacity"
    - "how to find good finite length codes from art towards science"
    - "the generalized area theorem and some of its consequences"
    - "tight bounds for ldpc and ldgm codes under map decoding"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

Connected through hyperedge HE-2 (induced by source paper "the price of certainty waterslide curves and the gap to capacity"):
  with members:
    - "a channel that heats up"
    - "a hot channel"
    - "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the erasure channel with bounded complexity"
    - "optimal memoryless encoding for low power off chip data buses"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

Connected through hyperedge HE-3 (induced by source paper "tradeoff between decoding complexity and rate for codes on graphs"):
  with members:
    - "accumulate repeat accumulate codes systematic codes achieving the binary erasure channel capacity with bounded complexity"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

Connected through hyperedge HE-4 (induced by source paper "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the erasure channel with bounded complexity"):
  with members:
    - "channel coding the road to channel capacity"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

Connected through hyperedge HE-5 (induced by source paper "iterative decoding performance bounds for ldpc codes on noisy channels"):
  with members:
    - "why we can not surpass capacity the matching condition"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

Connected through hyperedge HE-6 (induced by source paper "performance versus complexity per iteration for low density parity check codes an information theoretic approach"):
  with members:
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"
    - "accumulate repeat accumulate codes systematic codes achieving the binary erasure channel capacity with bounded complexity"
    - "improved bounds on the parity check density and achievable rates of binary linear block codes with applications to ldpc codes"
    - "on achievable rates and complexity of ldpc codes for parallel channels with application to puncturing"
    - "why we can not surpass capacity the matching condition"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"
    - "life above threshold from list decoding to area theorem and mse"
    - "bounds on the decoding complexity of punctured codes on graphs"

Connected through hyperedge HE-7 (induced by source paper "accumulate repeat accumulate codes systematic codes achieving the binary erasure channel capacity with bounded complexity"):
  with members:
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

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)