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 "spatial multi lru caching for wireless networks with coverage overlaps"):
  Abstract: This article introduces a novel family of decentralised caching policies for wireless networks, referred to as spatial multi-LRU. Based on these, cache inventories are updated in a way that provides content diversity to users that are covered by, and thus have access to, more than one station. Two variations are proposed, the multi-LRU-One and -All, which differ in the number of replicas inserted in the involved edge caches. Che-like approximations are proposed to accurately predict their hit probability under the Independent Reference Model (IRM). For IRM traffic multi-LRU-One outperforms multi-LRU-All, whereas when the traffic exhibits temporal locality the -All variation can perform better.

Includes members:
  Member "optimal geographic caching in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online convex optimization for caching networks")
  Member "unravelling the impact of temporal and geographical locality in content caching systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the study of dynamic caching via state transition field the case of time invariant popularity")
  Member "modeling and analysis of content caching in wireless small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "catalog dynamics impact of content publishing and perishing on the performance of a lru cache":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online convex optimization for caching networks")
  Member "on the complexity of optimal routing and content caching in heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a ttl based approach for content placement in edge networks")
  Member "a unified approach to the performance analysis of caching systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")
  Member "sinr based k coverage probability in cellular networks with arbitrary shadowing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sir meta distribution of k tier downlink heterogeneous cellular networks with cell range expansion")
  Member "equivalence and comparison of heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "analyzing lora long range low power wide area networks using stochastic geometry")

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.PF(Performance)