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: "effective capacity of a rayleigh fading channel in the presence of interference"
  Abstract: In recent years the concept of the effective capacity that relates the physical layer characteristics of a wireless channel to the data link layer has gained a lot of attraction in wireless networking research community. The effective capacity is based on G\"artner-Ellis' large deviation theorem and it is used to provide the statistical QoS provisioning in the wireless networks. Effective capacity also helps in the analysis of the resource allocation or scheduling policies in various wireless systems such as Relay networks, multi-user systems and multi-carrier systems subject to statistical QoS requirements. The effective capacity in noise limited wireless network has already been investigated in the recent works. Considering the interference limited wireless channels, in this paper we propose an analytical approach based on Laplace's method for the effective capacity of uncorrelated Rayleigh fading channel in the presence of uncorrelated Rayleigh fading interference. The accuracy of the analytical model for the effective capacity is validated by numerical simulations. We also provide the evaluation of tail probability of the delay and maximum sustainable rate. The validation results reveal that the proposed mathematical approach to the effective capacity can open the path for further researches in statistical QoS provisioning in interference limited wireless networks.

Connected through hyperedge HE-1 (induced by source paper "effective capacity in wireless networks a comprehensive survey"):
  with members:
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "performance analysis of noma for ultra reliable and low latency communications"
    - "wireless access for ultra reliable low latency communication urllc principles and building blocks"
    - "secure transmission of delay sensitive data over wireless fading channels"
    - "energy efficient ofdma networks maintaining statistical qos guarantees for delay sensitive traffic"
    - "statistical qos analysis of full duplex and half duplex heterogeneous cellular networks"
    - "effective capacity of retransmission schemes a recurrence relation approach"
    - "backlog and delay reasoning in harq systems"

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.NI(Networking and Internet Architecture)