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 the multiuser miso downlink under imperfect csi and finite length coding"
  Abstract: We use stochastic network calculus to investigate the delay performance of a multiuser MISO system with zero-forcing beamforming. First, we consider ideal assumptions with long codewords and perfect CSI at the transmitter, where we observe a strong channel hardening effect that results in very high reliability with respect to the maximum delay of the application. We then study the system under more realistic assumptions with imperfect CSI and finite blocklength channel coding. These effects lead to interference and to transmission errors, and we derive closed-form lower and upper bounds on the resulting error probability. Compared to the ideal case, imperfect CSI and finite length coding cause massive degradations in the average transmission rate. Surprisingly, the system nevertheless maintains the same qualitative behavior as in the ideal case: as long as the average transmission rate is higher than the arrival rate, the system can still achieve very high reliability with respect to the maximum delay.

Connected through hyperedge HE-1 (induced by source paper "balance queueing and retransmission latency optimal massive mimo design"):
  with members:
    - "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"
    - "massive mimo for next generation wireless systems"

Connected through hyperedge HE-2 (induced by source paper "noma in the uplink delay analysis with imperfect csi and finite length coding"):
  with members:
    - "delay performance of wireless communications with 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-3 (induced by source paper "rate analysis of ultra reliable low latency communications in random wireless networks"):
  with members:
    - "delay performance of wireless communications with 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"

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)