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: "low latency short packet transmissions fixed length or harq"
  Abstract: We study short-packet communications, subject to latency and reliability constraints, under the premises of limited frequency diversity and no time diversity. The question addressed is whether, and when, hybrid automatic repeat request (HARQ) outperforms fixed-blocklength schemes with no feedback (FBL-NF) in such a setting. We derive an achievability bound for HARQ, under the assumption of a limited number of transmissions. The bound relies on pilot-assisted transmission to estimate the fading channel and scaled nearest-neighbor decoding at the receiver. We compare our achievability bound for HARQ to stateof-the-art achievability bounds for FBL-NF communications and show that for a given latency, reliability, number of information bits, and number of diversity branches, HARQ may significantly outperform FBL-NF. For example, for an average latency of 1 ms, a target error probability of 10^-3, 30 information bits, and 3 diversity branches, the gain in energy per bit is about 4 dB.

Connected through hyperedge HE-1 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes"):
  with members:
    - "effective capacity and power allocation for machine type communication"
    - "on the effective energy efficiency of ultra reliable networks in the finite blocklength regime"
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "energy efficient adaptive power allocation for incremental mimo systems"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-2 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback"):
  with members:
    - "fast harq over finite blocklength codes a technique for low latency reliable communication"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "energy latency tradeoff in ultra reliable low latency communication with retransmissions"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "moderate deviation asymptotics for variable length codes with feedback"
    - "coherent multiple antenna block fading channels at finite blocklength"
    - "common message broadcast channels with feedback in the nonasymptotic regime full feedback"

Connected through hyperedge HE-3 (induced by source paper "dynamic harq with guaranteed delay"):
  with members:
    - "fast harq over finite blocklength codes a technique for low latency reliable communication"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "ultra reliable low latency cellular networks use cases challenges and approaches"
    - "harq buffer management an information theoretic view"
    - "finite block length analysis of the incremental redundancy harq"
    - "coding versus arq in fading channels how reliable should the phy be"

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"
    - "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"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"

Connected through hyperedge HE-5 (induced by source paper "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "5g wireless network slicing for embb urllc and mmtc a communication theoretic view"
    - "delay and peak age violation probability in short packet transmissions"
    - "content based status updates"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "status updates through m g 1 1 queues with harq"
    - "age optimal information updates in multihop networks"
    - "status updates over unreliable multiaccess channels"

Connected through hyperedge HE-6 (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"
    - "efficient error correcting codes in the short blocklength regime"
    - "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)