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: "protograph based raptor like ldpc codes"
  Abstract: This paper proposes a class of rate-compatible LDPC codes, called protograph-based Raptor-like (PBRL) codes. The construction is focused on binary codes for BI-AWGN channels. As with the Raptor codes, additional parity bits are produced by exclusive-OR operations on the precoded bits, providing extensive rate compatibility. Unlike Raptor codes, the structure of each additional parity bit in the protograph is explicitly designed through density evolution. The construction method provides low iterative decoding thresholds and the lifted codes result in excellent error rate performance for long-blocklength PBRL codes. For short-blocklength PBRL codes the protograph design and lifting must avoid undesired graphical structures such as trapping sets and absorbing sets while also seeking to minimize the density evolution threshold. Simulation results are shown in information block sizes of $k=192$, $16368$ and $16384$. Comparing at the same information block size of $k=16368$ bits, the PBRL codes outperform the best known standardized code, the AR4JA codes in the waterfall region. The PBRL codes also perform comparably to DVB-S2 codes even though the DVB-S2 codes use LDPC codes with longer blocklengths and are concatenated with outer BCH codes.

Connected through hyperedge HE-1 (induced by source paper "low density majority codes and the problem of graceful degradation"):
  with members:
    - "a lower bound on the expected distortion of joint source channel coding"
    - "low complexity concatenated ldpc staircase codes"
    - "comparison of channels criteria for domination by a symmetric channel"
    - "deep joint source channel coding for wireless image transmission"
    - "strong data processing inequalities for channels and bayesian networks"
    - "a source channel separation theorem with application to the source broadcast problem"
    - "intermediate performance of rateless codes"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"

Connected through hyperedge HE-2 (induced by source paper "ultrareliable and low latency communication techniques for tactile internet services"):
  with members:
    - "map based millimeter wave channel models an overview guidelines and data"
    - "multiple access for 5g new radio categorization evaluation and challenges"
    - "relationship between cross polarization discrimination xpd and spatial correlation in indoor small cell mimo systems"
    - "compact full duplex mimo radios in d2d underlaid cellular networks from system design to prototype results"
    - "rf lens embedded massive mimo systems fabrication issues and codebook design"
    - "degrees of freedom of full duplex cellular networks with reconfigurable antennas at base station"
    - "filtered ofdm enabler for flexible waveform in the 5th generation cellular networks"
    - "performance analysis of massive mimo for cell boundary users"

Connected through hyperedge HE-3 (induced by source paper "on low density majority codes"):
  with members:
    - "a lower bound on the expected distortion of joint source channel coding"
    - "low complexity concatenated ldpc staircase codes"
    - "deep joint source channel coding for wireless image transmission"
    - "a source channel separation theorem with application to the source broadcast problem"
    - "intermediate performance of rateless codes"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"

Connected through hyperedge HE-4 (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-5 (induced by source paper "flexible ir harq scheme for polar coded modulation"):
  with members:
    - "an incremental redundancy harq scheme for polar code"
    - "efficient polar code construction for higher order modulation"
    - "bit permuted coded modulation for polar codes"
    - "capacity achieving rateless polar codes"
    - "capacity achieving rate compatible polar codes"
    - "list decoding of polar codes"
    - "a practical approach to polar codes"

Connected through hyperedge HE-6 (induced by source paper "an efficient construction of rate compatible punctured polar rcpp codes using hierarchical puncturing"):
  with members:
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "capacity achieving rateless polar codes"
    - "capacity achieving rate compatible polar codes"
    - "a hybrid arq scheme based on polar codes"
    - "list decoding of polar codes"
    - "a practical approach to polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "design of improved quasi cyclic protograph based raptor like ldpc codes for short block lengths"):
  with members:
    - "the bethe permanent of a nonnegative matrix"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"

Connected through hyperedge HE-8 (induced by source paper "analysis and design of raptor codes using a multi edge framework"):
  with members:
    - "raptor codes in the low snr regime"

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)