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: "efficient error correcting codes in the short blocklength regime"
  Abstract: The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applications in wireless communication networks. In this paper, we review some of the most promising code constructions targeting the short block regime, and we compare them with both finite-length performance bounds and classical error-correction coding schemes. The work addresses the use of both binary and high-order modulations over the additive white Gaussian noise channel. We will illustrate how to effectively approach the theoretical bounds with various performance versus decoding complexity tradeoffs.

Connected through hyperedge HE-1 (induced by source paper "an efficient algorithm for designing optimal crcs for tail biting convolutional codes"):
  with members:
    - "convolutional code specific crc code design"

Connected through hyperedge HE-2 (induced by source paper "saddlepoint approximations for short packet wireless communications"):
  with members:
    - "secure short packet communications for mission critical iot applications"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "5g wireless network slicing for embb urllc and mmtc a communication theoretic view"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "joint sum rate and error probability optimization finite blocklength analysis"
    - "coherent multiple antenna block fading channels at finite blocklength"
    - "on single antenna rayleigh block fading channels at finite blocklength"
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"

Connected through hyperedge HE-3 (induced by source paper "transmission energy minimization for heterogeneous low latency noma downlink"):
  with members:
    - "joint power and time allocation for noma mec offloading"
    - "delay minimization for noma mec offloading"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "joint beamforming and power splitting control in downlink cooperative swipt noma systems"
    - "energy efficient non orthogonal transmission under reliability and finite blocklength constraints"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"
    - "downlink transmission of short packets framing and control information revisited"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"

Connected through hyperedge HE-4 (induced by source paper "successive cancellation list decoding of product codes with reed muller component codes"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "low complexity joint channel estimation and list decoding of short codes"
    - "soft decision decoding of reed muller codes recursive lists"
    - "recursive decoding and its performance for low rate reed muller codes"
    - "successive cancellation decoding of single parity check product codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-5 (induced by source paper "decoder in the loop genetic optimization based ldpc code design"):
  with members:
    - "decoder tailored polar code design using the genetic algorithm"
    - "scattered exit charts for finite length ldpc code design"
    - "sparse graphs for belief propagation decoding of polar codes"
    - "on the stopping distance and the stopping redundancy of codes"

Connected through hyperedge HE-6 (induced by source paper "low complexity joint channel estimation and list decoding of short codes"):
  with members:
    - "short codes with mismatched channel state information a case study"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "list decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "on single antenna rayleigh block fading channels at finite blocklength"):
  with members:
    - "low complexity joint channel estimation and list decoding of short codes"
    - "low latency short packet transmissions fixed length or harq"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "coherent multiple antenna block fading channels at finite blocklength"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "the third order term in the normal approximation for the awgn channel"
    - "diversity versus multiplexing at finite blocklength"
    - "optimum power control at finite blocklength"

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)