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 "wireless coded caching a topological perspective"):
  Abstract: We explore the performance of coded caching in a SISO BC setting where some users have higher link capacities than others. Focusing on a binary and fixed topological model where strong links have a fixed normalized capacity 1, and where weak links have reduced normalized capacity $\tau<1$, we identify --- as a function of the cache size and $\tau$ --- the optimal throughput performance, within a factor of at most 8. The transmission scheme that achieves this performance, employs a simple form of interference enhancement, and exploits the property that weak links attenuate interference, thus allowing for multicasting rates to remain high even when involving weak users. This approach ameliorates the negative effects of uneven topology in multicasting, now allowing all users to achieve the optimal performance associated to $\tau=1$, even if $\tau$ is approximately as low as $\tau\geq 1-(1-w)^g$ where $g$ is the coded-caching gain, and where $w$ is the fraction of users that are weak. This leads to the interesting conclusion that for coded multicasting, the weak users need not bring down the performance of all users, but on the contrary to a certain extent, the strong users can lift the performance of the weak users without any penalties on their own performance. Furthermore for smaller ranges of $\tau$, we also see that achieving the near-optimal performance comes with the advantage that the strong users do not suffer any additional delays compared to the case where $\tau = 1$.

Includes members:
  Member "information theoretic caching the multi user case":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery")
  Member "noisy broadcast networks with receiver caching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental limits of cache aided interference management":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching")
  Member "complete interference mitigation through receiver caching in wyner s networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wyner s network on caches combining receiver caching with a flexible backhaul")
  Member "multi library coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fog aided wireless networks for content delivery fundamental latency tradeoffs")
  Member "effect of number of users in multi level coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "device to device coded caching with distinct cache sizes")
  Member "cache enabled broadcast packet erasure channels with state feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adding transmitters dramatically boosts coded caching gains for finite file sizes")
  Member "cache aided interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)