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 "cooperative local caching under heterogeneous file preferences"):
  Abstract: Local caching is an effective scheme for leveraging the memory of the mobile terminal (MT) and short range communications to save the bandwidth usage and reduce the download delay in the cellular communication system. Specifically, the MTs first cache in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity during peak hours. However, prior works largely overlook MTs’ heterogeneity in file preferences and their selfish behaviours. In this paper, we practically categorize the MTs into different interest groups according to the MTs’ preferences. Each group of MTs aims to increase the probability of successful file discovery from the neighbouring MTs (from the same or different groups). Hence, we define the groups’ utilities as the probability of successfully discovering the file in the neighbouring MTs, which should be maximized by deciding the caching strategies of different groups. By modelling MTs’ mobilities as homogeneous Poisson point processes (HPPPs), we analytically characterize MTs’ utilities in closed-form. We first consider the fully cooperative case where a centralizer helps all groups to make caching decisions. We formulate the problem as a weighted-sum utility maximization problem, through which the maximum utility trade-offs of different groups are characterized. Next, we study two benchmark cases under selfish caching, namely, partial and no cooperation, with and without inter-group file sharing, respectively. The optimal caching distributions for these two cases are derived. Finally, numerical examples are presented to compare the utilities under different cases and show the effectiveness of the fully cooperative local caching compared to the two benchmark cases. Part of this work is to appear in the IEEE International Conference on Communications (ICC), Kuala Lumpur, 2016. Y. Guo is with the Department of Electrical and Computer Engineering, National University of Singapore (e-mail: yinghao.guo@nus.edu.sg). L. Duan is with the Engineering Systems and Design Pillar, Singapore University of Technology and Design (e-mail: lingjie duan@sutd.edu.sg). R. Zhang is with the Department of Electrical and Computer Engineering, National University of Singapore (email:elezhang@nus.edu.sg). He is also with the Institute for Infocomm Research, A*STAR, Singapore.

Includes members:
  Member "caching incentive design in wireless d2d networks a stackelberg game approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a personalized preference learning framework for caching in mobile networks")
  Member "content centric sparse multicast beamforming for cache enabled cloud ran":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "on the optimality of uncoded cache placement":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "an efficient multiple groupcast coded multicasting scheme for finite fractional caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decentralized asynchronous coded caching design and performance analysis in fog radio access networks")
  Member "adaptive video streaming for wireless networks with multiple users and helpers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wireless caching helper system with heterogeneous traffic and random availability")
  Member "content centric multicast beamforming in cache enabled cloud radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "caching placement in stochastic wireless caching helper networks channel selection diversity via caching")
  Member "fundamental limits of caching in wireless d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "the throughput outage tradeoff of wireless one hop caching networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mobile communications computing and caching resources optimization for coded caching with device computing")

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)