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 "cache aided full duplex small cells"):
  Abstract: Caching popular contents at the edge of the network can positively impact the performance and future sustainability of wireless networks in several ways, e.g., end-to-end access delay reduction and peak rate increase. In this paper, we aim at showing that non-negligible performance enhancements can be observed in terms of network interference footprint as well. To this end, we consider a full-duplex small-cell network consisting of non-cooperative cache-aided base stations, which communicate simultaneously with both downlink users and wireless backhaul nodes. We propose a novel caching model seeking to mimic a geographical policy based on local files popularity and calculate the corresponding cache hit probability. Subsequently we study the performance of the considered network in terms of throughput gain with respect to its cache-free half-duplex counterpart. Numerical results corroborate our theoretical findings and highlight remarkable performance gains when moving from cache-free to cache-aided full-duplex small-cell networks.

Includes members:
  Member "effect of user mobility on the performance of device to device networks with distributed caching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mobility aware content preference learning in decentralized caching networks")
  Member "wireless caching technical misconceptions and business barriers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "user scheduling and optimal power allocation for full duplex cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "full duplex hybrid a d beamforming with reduced complexity multi tap analog cancellation")
  Member "optimal low complexity self interference cancellation for full duplex mimo small cells":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "low complexity full duplex mimo novel analog cancellation architectures and transceiver design")
  Member "optimization and analysis of probabilistic caching in n tier heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "mean field games for distributed caching in ultra dense small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed edge caching via reinforcement learning in fog radio access networks")
  Member "full duplex mimo small cell networks with interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff")
  Member "interference cancellation at receivers in cache enabled wireless networks":
    also connected through other hyperedges:
      (none)

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)