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: "joint power allocation and caching optimization in fiber wireless access networks"
  Abstract: Fiber-Wireless (FiWi) access networks have been widely deployed due to the complementary advantages of high-capacity fiber backhaul and ubiquitous wireless front end. To meet the increasing demands for bandwidth-hungry applications, access points (APs) are densely deployed and new wireless network standards have been published for higher data rates. Hence, fiber backhaul in FiWi access networks is still facing the incoming bandwidth capacity crunch. In this paper, we involve caches in FiWi access networks to cope with fiber backhaul bottleneck and enhance the network throughput. On the other hand, power consumption is an important issue in wireless access networks. As both power budget in wireless access networks and bandwidth of fiber backhaul are constrained, it is challenging to properly leverage power for caching and that for wireless transmission to achieve optimal system performance. To address this challenge, we formulate the downlink wireless access throughput maximization problem by joint consideration of power allocation and caching strategy in FiWi access networks. To solve the problem, firstly, we propose a volume adjustable backhaul-constrained water-filling method (VABWF) to derive the expression of optimal wireless transmission power allocation. Then, we reformulate the problem as a multiple-choice knapsack problem (MCKP) and propose a dynamic programming algorithm to find the optimal solution of the MCKP problem. Simulation results show that the proposed algorithm significantly outperforms existing algorithms in terms of system throughput under different FiWi access network scenarios.

Connected through hyperedge HE-1 (induced by source paper "on throughput optimization and bound analysis in cache enabled fiber wireless access networks"):
  with members:
    - "cache enabled hetnets with millimeter wave small cells"
    - "content placement in cache enabled sub 6 ghz and millimeter wave multi antenna dense small cell networks"
    - "energy efficiency of downlink networks with caching at base stations"
    - "caching placement in stochastic wireless caching helper networks channel selection diversity via caching"
    - "coverage in heterogeneous downlink millimeter wave cellular networks"
    - "stochastic geometry modeling and analysis of multi tier millimeter wave cellular networks"
    - "analysis on cache enabled wireless heterogeneous networks"
    - "tractable model for rate in self backhauled millimeter wave 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.NI(Networking and Internet Architecture)