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: "throughput analysis of buffer constrained wireless systems in the finite blocklength regime"
  Abstract: In this paper, wireless systems operating under queueing constraints in the form of limitations on the buffer violation probabilities are considered. The throughput under such constraints is captured by the effective capacity formulation. It is assumed that finite blocklength codes are employed for transmission. Under this assumption, a recent result on the channel coding rate in the finite blocklength regime is incorporated into the analysis and the throughput achieved with such codes in the presence of queueing constraints and decoding errors is identified. Performance of different transmission strategies (e.g., variable-rate, variable-power, and fixed-rate transmissions) is studied. Interactions between the throughput, queueing constraints, coding blocklength, decoding error probabilities, and signal-to-noise ratio are investigated and several conclusions with important practical implications are drawn.

Connected through hyperedge HE-1 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime"):
  with members:
    - "on the effective energy efficiency of ultra reliable networks in the finite blocklength regime"
    - "short packet communications in non orthogonal multiple access systems"
    - "on the effective capacity of mtc networks in the finite blocklength regime"
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "non orthogonal multiple access noma in cellular uplink and downlink challenges and enabling techniques"
    - "low latency ultra reliable 5g communications finite blocklength bounds and coding schemes"
    - "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 "a game theoretic approach to covert communications"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"

Connected through hyperedge HE-3 (induced by source paper "statistical qos provisioning for mtc networks under finite blocklength"):
  with members:
    - "on the effective capacity of mtc networks in the finite blocklength regime"
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "low latency ultra reliable 5g communications finite blocklength bounds and coding schemes"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "next generation m2m cellular networks challenges and practical considerations"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-4 (induced by source paper "cross layer optimization for ultra reliable and low latency radio access networks"):
  with members:
    - "uplink transmission design with massive machine type devices in tactile internet"
    - "cross layer transmission design for tactile internet"
    - "quasi static multiple antenna fading channels at finite blocklength"

Connected through hyperedge HE-5 (induced by source paper "cross layer transmission design for tactile internet"):
  with members:
    - "quasi static multiple antenna fading channels at finite blocklength"

Connected through hyperedge HE-6 (induced by source paper "throughput of cognitive radio systems with finite blocklength codes"):
  with members:
    - "the effects of limited channel knowledge on cognitive radio system capacity"
    - "a unified framework for the ergodic capacity of spectrum sharing cognitive radio systems"
    - "performance analysis of cognitive radio systems under qos constraints and channel uncertainty"
    - "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity"

Connected through hyperedge HE-7 (induced by source paper "channel coding over multiple coherence blocks with queueing constraints"):
  with members:
    - "coding versus arq in fading channels how reliable should the phy be"
    - "the impact of qos constraints on the energy efficiency of fixed rate wireless transmissions"
    - "analysis of energy efficiency in fading channels under qos constraints"

Connected through hyperedge HE-8 (induced by source paper "transmission strategies in multiple access fading channels with statistical qos constraints"):
  with members:
    - "channel coding over multiple coherence blocks with queueing constraints"
    - "analysis of energy efficiency in fading channels under qos 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)