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: "delay performance of wireless communications with imperfect csi and finite length coding"
  Abstract: With the rise of critical machine-to-machine applications, next generation wireless communication systems must be designed with strict constraints on the latency and reliability. A key question in this context relates to channel state estimation, which allows the transmitter to adapt the code rate to the channel. In this work, we characterize the trade-off between the estimation sequence length and data codeword length: shorter channel estimation leaves more time for the actual payload transmission but reduces the estimation accuracy and causes more decoding errors. Using lower coding rates can mitigate this effect, but may result in a higher backlog of data at the transmitter. We analyze this trade-off using queueing analysis on top of accurate models of the physical layer, which also account for the finite blocklength of the channel code. Based on a novel closed-form approximation for the error probability given the rate, we show that finding the optimal rate adaptation strategy becomes a convex problem. The optimal rate adaptation strategy and the optimal training sequence length, which both depend on the latency and reliability constraints of the application, can improve the delay performance by an order of magnitude, compared to suboptimal strategies that do not consider those constraints.

Connected through hyperedge HE-1 (induced by source paper "noma in the uplink delay analysis with imperfect csi and finite length coding"):
  with members:
    - "delay performance of the multiuser miso downlink under imperfect csi and finite length coding"
    - "on the delay performance of interference channels"
    - "fairness for non orthogonal multiple access in 5g systems"
    - "the dispersion of nearest neighbor decoding for additive non gaussian channels"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "transmission strategies in multiple access fading channels with statistical qos constraints"
    - "multiuser mimo achievable rates with downlink training and channel state feedback"

Connected through hyperedge HE-2 (induced by source paper "peak age violation guarantees for the transmission of short packets over fading channels"):
  with members:
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "pilot assisted short packet transmission over multiantenna fading channels a 5g case study"
    - "delay and peak age violation probability in short packet transmissions"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "update or wait how to keep your data fresh"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "cross layer transmission design for tactile internet"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-3 (induced by source paper "unsupervised deep learning for ultra reliable and low latency communications"):
  with members:
    - "fast harq over finite blocklength codes a technique for low latency reliable communication"
    - "risk sensitive reinforcement learning for urllc traffic in wireless networks"
    - "federated learning for ultra reliable low latency v2v communications"
    - "joint uplink and downlink resource configuration for ultra reliable and low latency communications"
    - "reinforcement learning based scheduling algorithm for optimizing age of information in ultra reliable low latency networks"
    - "realizing the tactile internet haptic communications over next generation 5g cellular networks"
    - "quasi static multiple antenna fading channels at finite blocklength"

Connected through hyperedge HE-4 (induced by source paper "in band pilot overhead in ultra reliable low latency decode and forward relaying"):
  with members:
    - "performance analysis of ultra reliable short message decode and forward relaying protocols"
    - "ultra reliable short message cooperative relaying protocols under nakagami m fading"
    - "on the performance of ultra reliable decode and forward relaying under the finite blocklength"
    - "finite block length analysis of the incremental redundancy harq"
    - "optimum pilot overhead in wireless communication a unified treatment of continuous and block fading channels"

Connected through hyperedge HE-5 (induced by source paper "zero forcing detection for short packet transmission under channel estimation errors"):
  with members:
    - "resource allocation and harq optimization for urllc traffic in 5g wireless networks"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "solutions to integrals involving the marcum q function and applications"
    - "power scaling of uplink massive mimo systems with arbitrary rank channel means"
    - "finite block length analysis of the incremental redundancy harq"

Connected through hyperedge HE-6 (induced by source paper "rate analysis of ultra reliable low latency communications in random wireless networks"):
  with members:
    - "delay performance of the multiuser miso downlink under imperfect csi and finite length coding"
    - "on the optimal feedback rate in interference limited multi antenna cellular systems"
    - "finite block length analysis of the incremental redundancy harq"

Connected through hyperedge HE-7 (induced by source paper "outage of periodic downlink wireless networks with hard deadlines"):
  with members:
    - "throughput maximization for delay sensitive random access communication"
    - "low latency millimeter wave communications traffic dispersion or network densification"
    - "latency and reliability aware task offloading and resource allocation for mobile edge computing"
    - "ultra reliable and low latency communication in mmwave enabled massive mimo networks"
    - "base station cooperation on the downlink large system analysis"

Connected through hyperedge HE-8 (induced by source paper "delay performance of the multiuser miso downlink"):
  with members:
    - "analysis of wireless communications with finite blocklength and imperfect channel knowledge"
    - "multi user diversity vs accurate channel state information in mimo downlink channels"
    - "multi mode transmission for the mimo broadcast channel with imperfect channel state information"
    - "mimo wireless communications under statistical queueing constraints"

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)