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: "low density parity check codes for nonergodic block fading channels"
  Abstract: We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Since optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding, we introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes favorably with multiplexed parallel turbo codes for nonergodic channels.

Connected through hyperedge HE-1 (induced by source paper "protograph ldpc code design for asynchronous random access"):
  with members:
    - "enhancing contention resolution aloha using combining techniques"
    - "finite length analysis of irregular repetition slotted aloha in the waterfall region"
    - "random access channel coding in the finite blocklength regime"
    - "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "aloha random access that operates as a rateless code"

Connected through hyperedge HE-2 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components"):
  with members:
    - "a bound on rate of codes with locality with sequential recovery from multiple erasures"
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "codes with locality for two erasures"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "irregular product codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-3 (induced by source paper "spatially coupled ldpc ensembles on burst erasure channels"):
  with members:
    - "spatially coupled ldpc codes affected by a single random burst of erasures"
    - "band splitting permutations for spatially coupled ldpc codes enhancing burst erasure immunity"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "scaling behavior of convolutional ldpc ensembles over the bec"

Connected through hyperedge HE-4 (induced by source paper "spatially coupled ldpc codes affected by a single random burst of erasures"):
  with members:
    - "band splitting permutations for spatially coupled ldpc codes enhancing burst erasure immunity"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-5 (induced by source paper "diversity of low density lattices"):
  with members:
    - "fundamental limits of infinite constellations in mimo fading channels"
    - "low density lattice codes"

Connected through hyperedge HE-6 (induced by source paper "challenges and some new directions in channel coding"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "non binary ldpc decoding using truncated messages in the walsh hadamard domain"
    - "expectation propagation for approximate bayesian inference"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "universal polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-7 (induced by source paper "bounds on the second order coding rate of the mimo rayleigh block fading channel"):
  with members:
    - "quasi static simo fading channels at finite blocklength"
    - "diversity versus channel knowledge at finite block length"
    - "information spectrum approach to second order coding rate in channel coding"
    - "gallager s exponent for mimo channels a reliability rate tradeoff"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-8 (induced by source paper "low density graph codes for coded cooperation on slow fading relay channels"):
  with members:
    - "bilayer low density parity check codes for decode and forward in relay channels"

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)