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 versus arq in fading channels how reliable should the phy be"
  Abstract: This paper studies the tradeoff between channel coding and ARQ (automatic repeat request) in Rayleigh block-fading channels. A heavily coded system corresponds to a low transmission rate with few ARQ re-transmissions, whereas lighter coding corresponds to a higher transmitted rate but more re-transmissions. The optimum error probability, where optimum refers to the maximization of the average successful throughput, is derived and is shown to be a decreasing function of the average signal-to-noise ratio and of the channel diversity order. A general conclusion of the work is that the optimum error probability is quite large (e.g., 10% or larger) for reasonable channel parameters, and that operating at a very small error probability can lead to a significantly reduced throughput. This conclusion holds even when a number of practical ARQ considerations, such as delay constraints and acknowledgement feedback errors, are taken into account.

Connected through hyperedge HE-1 (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"
    - "low latency short packet transmissions fixed length or harq"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "balance queueing and retransmission latency optimal massive mimo design"):
  with members:
    - "delay performance of the multiuser miso downlink under imperfect csi and finite length coding"
    - "outage of periodic downlink wireless networks with hard deadlines"
    - "massive mimo has unlimited capacity"
    - "on the ergodic rate lower bounds with applications to massive mimo"
    - "delay performance of miso wireless communications"
    - "massive mimo ten myths and one critical question"
    - "massive mimo performance evaluation based on measured propagation data"
    - "on noisy arq in block fading channels"

Connected through hyperedge HE-3 (induced by source paper "constrained thompson sampling for wireless link optimization"):
  with members:
    - "beyond the click through rate web link selection with multi level feedback"
    - "efficient beam alignment in millimeter wave systems using contextual bandits"
    - "unimodal thompson sampling for graph structured arms"
    - "dynamic rate and channel selection in cognitive radio systems"
    - "bandits with knapsacks"
    - "optimal rate sampling in 802 11 systems"
    - "further optimal regret bounds for thompson sampling"
    - "multi armed bandits in metric spaces"

Connected through hyperedge HE-4 (induced by source paper "dynamic harq with guaranteed delay"):
  with members:
    - "fast harq over finite blocklength codes a technique for low latency reliable communication"
    - "low latency short packet transmissions fixed length or harq"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "energy latency tradeoff in ultra reliable low latency communication with retransmissions"):
  with members:
    - "generalized harq protocols with delayed channel state information and average latency constraints"
    - "finite block length analysis of the incremental redundancy harq"
    - "a rate compatible sphere packing analysis of feedback coding with limited retransmissions"
    - "information spectrum approach to second order coding rate in channel coding"

Connected through hyperedge HE-6 (induced by source paper "resource allocation for low latency vehicular communications with packet retransmission"):
  with members:
    - "stable throughput and delay analysis of a random access network with queue aware transmission"
    - "low latency millimeter wave communications traffic dispersion or network densification"
    - "vehicular communications a network layer perspective"

Connected through hyperedge HE-7 (induced by source paper "enhanced cellular coverage and throughput using rateless codes"):
  with members:
    - "downlink coordinated joint transmission for mutual information accumulation"
    - "fountain codes with nonuniform selection distributions through feedback"
    - "user point processes in cellular networks"
    - "asymptotics and approximation of the sir distribution in general cellular networks"
    - "the meta distribution of the sir in poisson bipolar and cellular networks"
    - "the mean interference to signal ratio and its key role in cellular and amorphous networks"
    - "what will 5g be"
    - "a stochastic geometry analysis of inter cell interference coordination and intra cell diversity"

Connected through hyperedge HE-8 (induced by source paper "optimal scheduling of reliability constrained relaying system under outdated csi in the finite blocklength regime"):
  with members:
    - "on the performance of ultra reliable decode and forward relaying under the finite blocklength"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "on the capacity of decode and forward relaying over rician fading channels"
    - "finite block length analysis of the incremental redundancy harq"
    - "impact of propagation environment on energy efficient relay placement model and performance analysis"
    - "throughput of cognitive radio systems with finite blocklength codes"
    - "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay 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)