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 "caching at base stations with heterogeneous user demands and spatial locality"):
  Abstract: The existing proactive caching policies are designed by assuming that all users request contents with identical activity level at uniformly distributed or known locations, among which most of the policies are optimized by assuming that user preference is identical to content popularity. However, these assumptions are not true based on the recent data analysis. In this paper, we investigate what happens without these assumptions. To this end, we establish a framework to optimize caching policy for base stations exploiting heterogeneous user preference, activity level, and spatial locality. We derive success probability and average rate of each user as utility function, respectively, and obtain the optimal caching policy maximizing a weighted sum of average utility (reflecting network performance) and minimal utility of users (reflecting user fairness). To investigate the intertwined impact of individual user request behavior on caching, we provide an algorithm to synthesize user preference from given content popularity and activity level with controlled preference similarity and validate the algorithm with the real datasets. Analysis and simulation results show that exploiting individual user behavior can improve both network performance and user fairness, and the gain increases with the skewness of spatial locality, and the heterogeneity of user preference and activity level.

Includes members:
  Member "when exploiting individual user preference is beneficial for caching at base stations":
    also connected through other hyperedges:
      (none)
  Member "optimal cache leasing from a mobile network operator to a content provider":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "consistent user traffic allocation and load balancing in mobile edge caching")
  Member "3gpp inspired hetnet model using poisson cluster process sum product functionals and downlink coverage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "caching policy optimization for d2d communications by learning user preference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "individual preference aware caching policy design in wireless d2d networks")
  Member "modeling analysis and optimization of coded caching in small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "understanding performance of edge content caching for mobile video streaming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "pa cache learning based popularity aware content caching in edge networks")
  Member "wireless caching technical misconceptions and business barriers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "big data caching for networking moving from cloud to edge":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fog computing systems state of the art research issues and future trends")

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)