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 policy for cache enabled d2d communications by learning user preference"):
  Abstract: Prior works in designing caching policy do not distinguish content popularity with user preference. In this paper, we illustrate the caching gain by exploiting individual user behavior in sending requests. After showing the connection between the two concepts, we provide a model for synthesizing user preference from content popularity. We then optimize the caching policy with the knowledge of user preference and active level to maximize the offloading probability for cache-enabled device-to-device communications, and develop a low-complexity algorithm to find the solution. In order to learn user preference, we model the user request behavior resorting to probabilistic latent semantic analysis, and learn the model parameters by expectation maximization algorithm. By analyzing a Movielens dataset, we find that the user preferences are less similar, and the active level and topic preference of each user change slowly over time. Based on this observation, we introduce a prior knowledge based learning algorithm for user preference, which can shorten the learning time. Simulation results show remarkable performance gain of the caching policy with user preference over existing policy with content popularity, both with realistic dataset and synthetic data validated by the real dataset.

Includes members:
  Member "caching policy optimization for d2d communications by learning user preference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "individual preference aware caching policy design in wireless d2d networks")
  Member "cache enabled device to device communications offloading gain and energy cost":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "caching at the wireless edge design aspects challenges and future directions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "wireless device to device caching networks basic principles and system performance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "energy efficiency of downlink networks with caching at base stations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "aoi delay tradeoff in mobile edge caching with freshness aware content refreshing")
  Member "placing dynamic content in caches with small population":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online convex optimization for caching networks")
  Member "cooperative local caching under heterogeneous file preferences":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "individual preference aware caching policy design in wireless d2d networks")

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)