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 "on the effective throughput of coded caching a game theoretic perspective"):
  Abstract: Recently coded caching has emerged as a promising means to handle continuously increasing wireless traffic. However, coded caching requires users to cooperate in order to minimize the overall transmission rate. How users with heterogeneous preferences cooperate in coded caching and how to calculate the resulting caching gains are still open problems. In this paper, a two-phase cache-aided network is investigated, in which users with heterogeneous preferences are served by a base station through a shared link. Effective throughput is considered as a performance metric. It is proved that the achievable domain of effective throughputs is a convex set and can be characterized by its boundary. A special type of caching schemes, named uncoded placement absolutely-fair (UPAF) caching, is studied. For the two-user case, games are formulated to allocate effective throughput gains for the two users. For the general multiuser case, a UPAF policy is proposed to organize user cooperation. It is shown that users with more concentrated preferences can obtain higher effective throughputs.

Includes members:
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "energy efficiency gains of caching for interference channels":
    also connected through other hyperedges:
      (none)
  Member "caching meets millimeter wave communications for enhanced mobility management in 5g networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a tutorial on beam management for 3gpp nr at mmwave frequencies")
  Member "on coded caching in the overloaded miso broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "a survey on low latency towards 5g ran core network and caching solutions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")
  Member "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal scheduling of content caching subject to deadline")
  Member "caching at the wireless edge design aspects challenges and future directions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "a stackelberg game for incentive proactive caching mechanisms in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "edge caching in delay constrained virtualized cellular networks analysis and market")

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)