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 size allocation in backhaul limited wireless networks"
  Abstract: Caching popular content at base stations is a powerful supplement to existing limited backhaul links for accommodating the exponentially increasing mobile data traffic. Given the limited cache budget, we investigate the cache size allocation problem in cellular networks to maximize the user success probability (USP), taking wireless channel statistics, backhaul capacities and file popularity distributions into consideration. The USP is defined as the probability that one user can successfully download its requested file either from the local cache or via the backhaul link. We first consider a single-cell scenario and derive a closed-form expression for the USP, which helps reveal the impacts of various parameters, such as the file popularity distribution. More specifically, for a highly concentrated file popularity distribution, the required cache size is independent of the total number of files, while for a less concentrated file popularity distribution, the required cache size is in linear relation to the total number of files. Furthermore, we study the multi-cell scenario, and provide a bisection search algorithm to find the optimal cache size allocation. The optimal cache size allocation is verified by simulations, and it is shown to play a more significant role when the file popularity distribution is less concentrated.

Connected through hyperedge HE-1 (induced by source paper "edge caching in dense heterogeneous cellular networks with massive mimo aided self backhaul"):
  with members:
    - "random caching based cooperative transmission in heterogeneous wireless networks"
    - "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless networks"
    - "fog radio access networks mobility management interference mitigation and resource optimization"
    - "a new look at physical layer security caching and wireless energy harvesting for heterogeneous ultra dense networks"
    - "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks"
    - "wireless device to device caching networks basic principles and system performance"
    - "wireless caching technical misconceptions and business barriers"
    - "user association in 5g networks a survey and an outlook"

Connected through hyperedge HE-2 (induced by source paper "cost effective cache deployment in mobile heterogeneous networks"):
  with members:
    - "on optimal geographical caching in heterogeneous cellular networks"
    - "a learning based approach to caching in heterogenous small cell networks"
    - "optimal caching and user association in cache enabled heterogeneous wireless networks"
    - "on the delay of geographical caching methods in two tiered heterogeneous networks"
    - "mobility aware caching for content centric wireless networks modeling and methodology"
    - "wireless content caching for small cell and d2d networks"
    - "energy efficiency of downlink networks with caching at base stations"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"

Connected through hyperedge HE-3 (induced by source paper "mobility aware caching in d2d networks"):
  with members:
    - "effect of user mobility on the performance of device to device networks with distributed caching"
    - "wireless device to device caching networks basic principles and system performance"
    - "mobility aware caching for content centric wireless networks modeling and methodology"
    - "optimal geographic caching in cellular networks"
    - "large scale convex optimization for ultra dense cloud ran"
    - "backhaul aware caching placement for wireless networks"
    - "fundamental limits of caching in wireless d2d networks"
    - "what will 5g be"

Connected through hyperedge HE-4 (induced by source paper "a stackelberg game for incentive proactive caching mechanisms in wireless networks"):
  with members:
    - "caching incentive design in wireless d2d networks a stackelberg game approach"
    - "wireless caching technical misconceptions and business barriers"
    - "wireless content caching for small cell and d2d networks"
    - "towards a marketplace for mobile content dynamic pricing and proactive caching"
    - "living on the edge the role of proactive caching in 5g wireless networks"

Connected through hyperedge HE-5 (induced by source paper "mobility aware caching for content centric wireless networks modeling and methodology"):
  with members:
    - "context aware small cell networks how social metrics improve wireless resource allocation"
    - "backhaul aware caching placement for wireless networks"
    - "exploiting user mobility for wireless content delivery"
    - "base station assisted device to device communications for high throughput wireless video networks"
    - "fundamental limits of caching"

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)