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 design of universal ldpc codes"
  Abstract: Low-density parity-check (LDPC) coding for a multitude of equal-capacity channels is studied. First, based on numerous observations, a conjecture is stated that when the belief propagation decoder converges on a set of equal-capacity channels, it would also converge on any convex combination of those channels. Then, it is proved that when the stability condition is satisfied for a number of channels, it is also satisfied for any channel in their convex hull. For the purpose of code design, a method is proposed which can decompose every symmetric channel with capacity C into a set of identical-capacity basis channels. We expect codes that work on the basis channels to be suitable for any channel with capacity C. Such codes are found and in comparison with existing LDPC codes that are designed for specific channels, our codes obtain considerable coding gains when used across a multitude of channels.

Connected through hyperedge HE-1 (induced by source paper "performance prediction of nonbinary forward error correction in optical transmission experiments"):
  with members:
    - "information rates of next generation long haul optical fiber systems using coded modulation"
    - "sensitivity gains by mismatched probabilistic shaping for optical communication systems"
    - "advances in detection and error correction for coherent optical communications regular irregular and spatially coupled ldpc code designs"
    - "impact of 4d channel distribution on the achievable rates in coherent optical communication experiments"
    - "on achievable rates for long haul fiber optic communications"
    - "four dimensional coded modulation with bit wise decoders for future optical communications"
    - "capacity of a nonlinear optical channel with finite memory"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-2 (induced by source paper "on universal properties of capacity approaching ldpc code ensembles"):
  with members:
    - "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"
    - "capacity achieving codes with bounded graphical complexity on noisy channels"
    - "tight bounds for ldpc and ldgm codes under map decoding"
    - "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)