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: "accumulate repeat accumulate codes capacity achieving ensembles of systematic codes for the erasure channel with bounded complexity"
  Abstract: This paper introduces ensembles of systematic accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity, per information bit, of encoding and decoding. It also introduces symmetry properties which play a central role in the construction of new capacity-achieving ensembles for the BEC. The results here improve on the tradeoff between performance and complexity provided by previous constructions of capacity-achieving code ensembles defined on graphs. The superiority of ARA codes with moderate to large block length is exemplified by computer simulations which compare their performance with those of previously reported capacity-achieving ensembles of low-density parity-check (LDPC) and irregular repeat-accumulate (IRA) codes. ARA codes also have the advantage of being systematic.

Connected through hyperedge HE-1 (induced by source paper "log logarithmic time pruned polar coding"):
  with members:
    - "polar like codes and asymptotic tradeoff among block length code rate and error probability"
    - "polar codes with exponentially small error at finite block length"
    - "general strong polarization"
    - "polar code moderate deviation recovering the scaling exponent"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"
    - "flexible length polar codes through graph based augmentation"
    - "a packing lemma for polar codes"

Connected through hyperedge HE-2 (induced by source paper "efficient error correcting codes in the short blocklength regime"):
  with members:
    - "low complexity joint channel estimation and list decoding of short codes"
    - "low latency short packet transmissions fixed length or harq"
    - "design of polar codes in 5g new radio"
    - "joint design of convolutional code and crc under serial list viterbi decoding"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "polar code construction for list decoding"
    - "ultra sparse non binary ldpc codes for probabilistic amplitude shaping"

Connected through hyperedge HE-3 (induced by source paper "log logarithmic time pruned polar coding on binary erasure channels"):
  with members:
    - "relaxed polar codes"
    - "flexible length polar codes through graph based augmentation"
    - "a packing lemma for polar codes"
    - "on the origin of polar coding"
    - "fast polar decoders algorithm and implementation"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-4 (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"
    - "channel coding the road to channel capacity"

Connected through hyperedge HE-5 (induced by source paper "tree structure expectation propagation for ldpc decoding over the bec"):
  with members:
    - "expectation propagation for approximate bayesian inference"
    - "analytical solution of covariance evolution for irregular ldpc codes"
    - "structured region graphs morphing ep into gbp"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "tree structure expectation propagation for decoding ldpc codes over binary erasure channels"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"
    - "on the stopping distance and the stopping redundancy of codes"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-6 (induced by source paper "spatially coupled codes and threshold saturation on intersymbol interference channels"):
  with members:
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation on channels with memory via spatial coupling"
    - "exact free distance and trapping set growth rates for ldpc convolutional codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "universality for the noisy slepian wolf problem via spatial coupling"
    - "coupled graphical models and their thresholds"
    - "universal codes for the gaussian mac via spatial coupling"
    - "spatially coupled codes over the multiple access channel"

Connected through hyperedge HE-7 (induced by source paper "spatially coupled mackay neal codes and hsu anastasopoulos codes"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "threshold saturation on bms channels via spatial coupling"
    - "new families of ldpc block codes formed by terminating irregular protograph based ldpc convolutional codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "the generalized area theorem and some of its consequences"

Connected through hyperedge HE-8 (induced by source paper "decoding complexity of irregular ldgm ldpc codes over the bisom channels"):
  with members:
    - "low density graph codes that are optimal for source channel coding and binning"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"
    - "applications of ldpc codes to the wiretap channel"

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)