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: "channel coding the road to channel capacity"
  Abstract: Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to capacity-approaching codes. We focus on the contributions that have led to the most significant improvements in performance vs. complexity for practical applications, particularly on the additive white Gaussian noise (AWGN) channel. We discuss algebraic block codes, and why they did not prove to be the way to get to the Shannon limit. We trace the antecedents of today's capacity-approaching codes: convolutional codes, concatenated codes, and other probabilistic coding schemes. Finally, we sketch some of the practical applications of these codes.

Connected through hyperedge HE-1 (induced by source paper "optimal constant weight codes under l_1 metric"):
  with members:
    - "single error detection and correction for duplication and substitution channels"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "constructions of optimal and near optimal multiply constant weight codes"
    - "systematic error correcting codes for rank modulation"
    - "error correction in flash memories via codes in the ulam metric"

Connected through hyperedge HE-2 (induced by source paper "sparse regression codes"):
  with members:
    - "the error probability of sparse superposition codes with approximate message passing decoding"
    - "sparcs for unsourced random access"
    - "spatially coupled sparse regression codes design and state evolution analysis"
    - "techniques for improving the finite length performance of sparse superposition codes"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "the rate distortion function and excess distortion exponent of sparse regression codes with optimal encoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"

Connected through hyperedge HE-3 (induced by source paper "construction and encoding of qc ldpc codes using group rings"):
  with members:
    - "ldpc lattice codes for full duplex relay channels"
    - "codes from zero divisors and units in group rings"

Connected through hyperedge HE-4 (induced by source paper "an efficient flicker free fec coding scheme for dimmable visible light communication based on polar codes"):
  with members:
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "channel capacity of polar coding with a given polar mismatched successive cancellation decoder"):
  with members:
    - "a simple proof of fast polarization"
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "a split reduced successive cancellation list decoder for polar codes"
    - "a low latency list successive cancellation decoding implementation for polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "fast list decoders for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "polar coding for processes with memory"

Connected through hyperedge HE-6 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "a joint typicality approach to algebraic network information theory"
    - "secure compute and forward in a bidirectional relay"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiple access via compute and forward"
    - "lattices over eisenstein integers for compute and forward"
    - "uplink downlink duality for integer forcing"

Connected through hyperedge HE-7 (induced by source paper "advances in detection and error correction for coherent optical communications regular irregular and spatially coupled ldpc code designs"):
  with members:
    - "spatially coupled sparse codes on graphs theory and practice"
    - "improving soft fec performance for higher order modulations via optimized bit channel mappings"
    - "on the convergence speed of spatially coupled ldpc ensembles"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "staircase codes fec for 100 gb s otn"
    - "analysis and design of binary message passing decoders"

Connected through hyperedge HE-8 (induced by source paper "code design for short blocks a survey"):
  with members:
    - "coded random access applying codes on graphs to design random access protocols"
    - "reliability output decoding of tail biting convolutional codes"
    - "advanced channel coding for space mission telecommand links"
    - "five disruptive technology directions for 5g"
    - "list decoding of polar codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "multiple bases belief propagation decoding of high density cyclic codes"
    - "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the 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)