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: "block markov superposition transmission construction of big convolutional codes from short codes"
  Abstract: A construction of big convolutional codes from short codes called block Markov superposition transmission (BMST) is proposed. The BMST is very similar to superposition blockMarkov encoding (SBME), which has been widely used to prove multiuser coding theorems. The encoding process of BMST can be as fast as that of the involved short code, while the decoding process can be implemented as an iterative sliding-window decoding algorithm with a tunable delay. More importantly, the performance of BMST can be simply lower-bounded in terms of the transmission memory given that the performance of the short code is available. Numerical results show that, 1) the lower bounds can be matched with a moderate decoding delay in the low bit-error-rate (BER) region, implying that the iterative slidingwindow decoding algorithm is near optimal; 2) BMST with repetition codes and single parity-check codes can approach the Shannon limit within 0.5 dB at BER of 10^{-5} for a wide range of code rates; and 3) BMST can also be applied to nonlinear codes.

Connected through hyperedge HE-1 (induced by source paper "compressed coding amp based decoding and analog spatial coupling"):
  with members:
    - "analysis of approximate message passing with non separable denoisers and markov random field priors"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"
    - "state evolution for approximate message passing with non separable functions"
    - "generalized approximate message passing decoder for universal sparse superposition codes"
    - "threshold saturation of spatially coupled sparse superposition codes for all memoryless channels"
    - "spatially coupled ldpc codes constructed from protographs"

Connected through hyperedge HE-2 (induced by source paper "systematic convolutional low density generator matrix code"):
  with members:
    - "systematic block markov superposition transmission of repetition codes"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "threshold saturation on bms channels via spatial coupling"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "statistical learning aided list decoding of semi random block oriented convolutional codes"):
  with members:
    - "decoding reed muller and polar codes by successive factor graph permutations"
    - "performance analysis of block markov superposition transmission of short codes"
    - "a new class of multiple rate codes based on block markov superposition transmission"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "statistical learning aided decoding of bmst of tail biting convolutional code"):
  with members:
    - "block markov superposition transmission of run codes"
    - "performance analysis of block markov superposition transmission of short codes"

Connected through hyperedge HE-5 (induced by source paper "block markov superposition transmission of bch codes with iterative erasures and errors decoders"):
  with members:
    - "performance analysis of block markov superposition transmission of short codes"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-6 (induced by source paper "systematic block markov superposition transmission of repetition codes"):
  with members:
    - "performance analysis of block markov superposition transmission of short codes"
    - "a new class of multiple rate codes based on block markov superposition transmission"
    - "design of spatially coupled ldpc codes over gf q for windowed decoding"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "lossy source coding via spatially coupled ldgm ensembles"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"

Connected through hyperedge HE-7 (induced by source paper "partially block markov superposition transmission of gaussian source with nested lattice codes"):
  with members:
    - "joint source channel coding for deep space image transmission using rateless codes"
    - "joint source channel coding with side information using hybrid digital analog codes"

Connected through hyperedge HE-8 (induced by source paper "performance analysis of block markov superposition transmission of short codes"):
  with members:
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "exit chart analysis of block markov superposition transmission of short codes"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "spatially coupled sparse codes on graphs theory and practice"
    - "a new class of multiple rate codes based on block markov superposition transmission"
    - "design of spatially coupled ldpc codes over gf q for windowed decoding"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms 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)