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 universal properties of capacity approaching ldpc code ensembles"
  Abstract: This paper is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels. Properties of the degree distributions, graphical complexity, and the number of fundamental cycles in the bipartite graphs are considered via the derivation of information-theoretic bounds. These bounds are expressed in terms of the target block/bit error probability and the gap (in rate) to capacity. Most of the bounds are general for any decoding algorithm, and some others are proved under belief propagation (BP) decoding. Proving these bounds under a certain decoding algorithm, validates them automatically also under any suboptimal decoding algorithm. A proper modification of these bounds makes them universal for the set of all MBIOS channels which exhibit a given capacity. Bounds on the degree distributions and graphical complexity apply to finite-length LDPC codes and to the asymptotic case of an infinite block length. The bounds are compared with capacity-approaching LDPC code ensembles under BP decoding, and they are shown to be informative and are easy to calculate. Finally, some interesting open problems are considered.

Connected through hyperedge HE-1 (induced by source paper "one and two bit message passing for sc ldpc codes with higher order modulation"):
  with members:
    - "a novel soft aided bit marking decoder for product codes"
    - "binary message passing decoding of product like codes"
    - "protograph based ldpc code design for ternary message passing decoding"
    - "energy efficient soft assisted product decoders"
    - "information rates and error exponents for probabilistic amplitude shaping"
    - "constant composition distribution matching"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-2 (induced by source paper "replacing the soft fec limit paradigm in the design of optical communication systems"):
  with members:
    - "four dimensional coded modulation with bit wise decoders for future optical communications"
    - "high snr asymptotics of mutual information for discrete constellations with applications to bicm"
    - "improving soft fec performance for higher order modulations via optimized bit channel mappings"
    - "on the information loss of the max log approximation in bicm systems"
    - "probabilistic signal shaping for bit metric decoding"
    - "achievable rates for four dimensional coded modulation with a bit wise receiver"
    - "on the exact ber of bit wise demodulators for one dimensional constellations"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-3 (induced by source paper "on the energy complexity of ldpc decoder circuits"):
  with members:
    - "energy consumption of vlsi decoders"

Connected through hyperedge HE-4 (induced by source paper "optimal rate and maximum erasure probability ldpc codes in binary erasure channel"):
  with members:
    - "how to find good finite length codes from art towards science"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

Connected through hyperedge HE-5 (induced by source paper "polymer expansions for cycle ldpc codes"):
  with members:
    - "decay of correlations for sparse graph error correcting codes"

Connected through hyperedge HE-6 (induced by source paper "extremes of error exponents"):
  with members:
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "on refined versions of the azuma hoeffding inequality with applications in information theory"):
  with members:
    - "moderate deviations analysis of binary hypothesis testing"
    - "on the concentration of the crest factor for ofdm signals"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"
    - "information spectrum approach to second order coding rate in channel coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "tight bounds on the capacity of binary input random cdma systems"
    - "on the rate of channel polarization"
    - "tight bounds for ldpc and ldgm codes under map decoding"

Connected through hyperedge HE-8 (induced by source paper "optimal rate for irregular ldpc codes in binary erasure channel"):
  with members:
    - "channel coding the road to channel capacity"
    - "how to find good finite length codes from art towards science"
    - "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)