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: "wi fi coexistence with duty cycled lte u"
  Abstract: Coexistence of Wi-Fi and LTE-Unlicensed (LTE-U) technologies has drawn significant concern in industry. In this paper, we investigate the Wi-Fi performance in the presence of duty cycle based LTE-U transmission on the same channel. More specifically, one LTE-U cell and one Wi-Fi basic service set (BSS) coexist by allowing LTE-U devices transmit their signals only in predetermined duty cycles. Wi-Fi stations, on the other hand, simply contend the shared channel using the distributed coordination function (DCF) protocol without cooperation with the LTE-U system or prior knowledge about the duty cycle period or duty cycle of LTE-U transmission. We define the fairness of the above scheme as the difference between Wi-Fi performance loss ratio (considering a defined reference performance) and the LTE-U duty cycle (or function of LTE-U duty cycle). Depending on the interference to noise ratio (INR) being above or below -62dbm, we classify the LTE-U interference as strong or weak and establish mathematical models accordingly. The average throughput and average service time of Wi-Fi are both formulated as functions of Wi-Fi and LTE-U system parameters using probability theory. Lastly, we use the Monte Carlo analysis to demonstrate the fairness of Wi-Fi and LTE-U air time sharing.

Connected through hyperedge HE-1 (induced by source paper "impact of lte s periodic interference on heterogeneous wi fi transmissions"):
  with members:
    - "fair coexistence of scheduled and random access wireless networks unlicensed lte wifi"
    - "unlicensed lte wifi coexistence is lbt inherently fairer than csat"

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)