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 "full duplex cellular networks it works"):
  Abstract: Full-duplex (FD) communications with bidirectional transmitting and receiving at the same time and frequency radio resource have long been deemed a promising way to boost spectrum efficiency, but hindered by the techniques for self-interference cancellation (SIC). Recent breakthroughs in analog and digital signal processing yield the feasibility of beyond $100$ dB SIC capability and make it possible for FD communications to demonstrate nearly doubled spectrum efficiency for point-to-point links. Now it is time to shift at least partial of our focus to full duplex networking, such as in cellular networks, since it is not straightforward but demanding novel and more complicated interference management techniques. Before putting FD networking into practice, we need to understand that what scenarios FD communications should be applied in under the current technology maturity, how bad the performance will be if we do nothing to deal with the newly introduced interference, and most importantly, how much improvement could be achieved after applying advanced solutions. This article will shed light on these questions.

Includes members:
  Member "prototyping real time full duplex radios":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ultrareliable and low latency communication techniques for tactile internet services")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")

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)