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 "transmission policies for interference management in full duplex d2d communication"):
  Abstract: Full-Duplex (FD) wireless and Device-to-Device (D2D) communication are two promising technologies that aspire to enhance the spectrum and energy efficiency of wireless networks, thus fulfilling key requirements of the 5th generation (5G) of mobile networks. Both technologies, however, generate excessive interference, which, if not managed effectively, threatens to compromise system performance. To this direction, we propose two transmission policies that enhance the communication of two interfering FD-enabled D2D pairs, derived from game theory and optimization theory. The game-theoretic policy allows the pairs to choose their transmission modes independently and the optimal policy to maximize their throughput, achieving significant gains when the pairs interfere strongly with each other.

Includes members:
  Member "throughput analysis for full duplex wireless networks with imperfect self interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance trade off between uplink and downlink in full duplex communications")
  Member "a survey on device to device communication in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simultaneous energy harvesting and information transmission in a mimo full duplex system a machine learning based design")
  Member "pushing the limits of full duplex design and real time implementation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hybrid scheduling in heterogeneous half and full duplex wireless networks")

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)