human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a queueing approach to the latency of decoupled ul dl with flexible tdd and asymmetric services"):
  Abstract: One of the main novelties in 5G is theflexible Time Division Duplex (TDD) frame, which allows adaptation to the latency requirements. However, this flexibility is not sufficient to support heterogeneous latency requirements, in which different traffic instances have different switching requirements between Uplink (UL) and Downlink(DL). This is visible in a traffic mix of enhanced mobile broadband (eMBB) and ultra-reliable low-latency communications (URLLC). In this paper we address this problem through the use of a decoupled UL/DL access, where the UL and the DL of a device are not necessarily served by the same base station. The latency gain over coupled access is quantified in the form of queueing sojourn time in a Rayleigh channel, as well as an upper bound for a priority user.

Includes members:
  Member "why to decouple the uplink and downlink in cellular networks and how to do it":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance of network assisted full duplex for cell free massive mimo")
  Member "interference spins scheduling of multiple interfering two way wireless links":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal centralized dynamic time division duplex")
  Member "analysis of the decoupled access for downlink and uplink in wireless heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic time frequency division duplex")

Question: Please tell me which class the source paper 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)