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: "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"
  Abstract: In this paper, we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime. The chosen converse and random coding union bounds were taken from the recent work of Polyanskyi–Poor–Verdu, and are investigated under parallel AWGN channels, the AWGN channel, the BI-AWGN channel, and the BSC. The technique we use, which is a generalization of some recent results available from the literature, is to map the probabilities of interest into a Laplace integral, and then solve (or approximate) the integral by use of a steepest descent technique. The proposed results are particularly useful for short packet lengths, where the normal approximation may provide unreliable results.

Connected through hyperedge HE-1 (induced by source paper "resource allocation for secure multi user downlink miso urllc systems"):
  with members:
    - "secure short packet communications for mission critical iot applications"
    - "resource allocation for multi user downlink miso ofdma urllc systems"
    - "resource allocation for multi user downlink urllc ofdma systems"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "robust and secure resource allocation for full duplex miso multicarrier noma systems"
    - "wiretap channels nonasymptotic fundamental limits"
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"

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"
    - "efficient error correcting codes in the short blocklength regime"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "resource allocation for multi user downlink miso ofdma urllc systems"):
  with members:
    - "resource allocation for multi user downlink urllc ofdma systems"
    - "energy latency tradeoff in ultra reliable low latency communication with retransmissions"
    - "robust and secure resource allocation for full duplex miso multicarrier noma systems"
    - "joint sum rate and error probability optimization finite blocklength analysis"
    - "cross layer optimization for ultra reliable and low latency radio access networks"
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-4 (induced by source paper "interleaved polar i polar codes"):
  with members:
    - "does gaussian approximation work well for the long length polar code construction"
    - "llr based successive cancellation list decoding of polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-5 (induced by source paper "resource allocation for multi user downlink urllc ofdma systems"):
  with members:
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"
    - "power efficient resource allocation for full duplex radio distributed antenna networks"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-6 (induced by source paper "on list decoding of 5g nr polar codes"):
  with members:
    - "design of polar codes in 5g new radio"
    - "design and implementation of a polar codes blind detection scheme"
    - "list decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "design of polar codes in 5g new radio"):
  with members:
    - "on list decoding of 5g nr polar codes"
    - "parity check polar coding for 5g and beyond"
    - "design and implementation of a polar codes blind detection scheme"
    - "circular buffer rate matched polar codes"
    - "improved successive cancellation flip decoding of polar codes based on error distribution"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "on puncturing strategies for polar codes"

Connected through hyperedge HE-8 (induced by source paper "channel coding at low capacity"):
  with members:
    - "polar codes with a stepped boundary"
    - "recursive list decoding for reed muller codes"
    - "beta beta bounds finite blocklength analog of the golden formula"
    - "relaxed polar codes"
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn 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)