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: "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.

Connected through hyperedge HE-1 (induced by source paper "full duplex enabled mobile edge caching from distributed to cooperative caching"):
  with members:
    - "modeling and performance analysis of full duplex communications in cache enabled d2d networks"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "edge caching wireless networks performance analysis and optimization"
    - "delivery time minimization in edge caching synergistic benefits of subspace alignment and zero forcing"
    - "wireless device to device caching networks basic principles and system performance"
    - "octopus a cooperative hierarchical caching strategy for cloud radio access networks"
    - "wireless content caching for small cell and d2d networks"
    - "energy efficiency of downlink networks with caching at base stations"

Connected through hyperedge HE-2 (induced by source paper "flexible cache aided networks with backhauling"):
  with members:
    - "cache aided heterogeneous networks coverage and delay analysis"
    - "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets"
    - "downlink cellular network analysis with los nlos propagation and elevated base stations"
    - "optimization and analysis of probabilistic caching in n tier heterogeneous networks"
    - "joint caching routing and channel assignment for collaborative small cell cellular networks"
    - "full duplex mimo small cell networks with interference cancellation"
    - "what will 5g be"
    - "a tractable approach to coverage and rate in cellular networks"

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)