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 "retrorenting an online policy for service caching at the edge"):
  Abstract: The rapid proliferation of shared edge computing platforms has enabled application service providers to deploy a wide variety of services with stringent latency and high bandwidth requirements. A key advantage of these platforms is that they provide pay-as-you-go flexibility by charging clients in proportion to their resource usage through short-term contracts. This affords the client significant cost-saving opportunities, by dynamically deciding when to host (cache) its service on the platform, depending on the changing intensity of requests. A natural caching policy for our setting is the Time-To-Live (TTL) policy. We show that TTL performs poorly both in the adversarial arrival setting, i.e., in terms of the competitive ratio, and for i.i.d. stochastic arrivals with low arrival rates, irrespective of the value of the TTL timer. We propose an online caching policy called RetroRenting (RR) and show that in the class of deterministic online policies, RR is order-optimal with respect to the competitive ratio. In addition, we provide performance guarantees for RR for i.i.d. stochastic arrival processes and prove that it compares well with the optimal online policy. Further, we conduct simulations using both synthetic and real world traces to compare the performance of RR and its variants with the optimal offline and online policies. The simulations show that the performance of RR is near optimal for all settings considered. Our results illustrate the universality of RR.

Includes members:
  Member "budget constrained edge service provisioning with demand estimation via bandit learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stochastic linear contextual bandits with diverse contexts")
  Member "service placement with provable guarantees in heterogeneous edge computing systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maxhedge maximising a maximum online")
  Member "joint optimization of service caching placement and computation offloading in mobile edge computing system":
    also connected through other hyperedges:
      (none)
  Member "joint service caching and task offloading for mobile edge computing in dense networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperative service caching and workload scheduling in mobile edge computing")
  Member "a survey on mobile edge computing the communication perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "collaborative service caching for edge computing in dense small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatio temporal edge service placement a bandit learning approach")
  Member "a comprehensive survey on fog computing state of the art and research challenges":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fog computing systems state of the art research issues and future trends")
  Member "dynamic service migration in mobile edge clouds":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "upper confidence primal dual optimization stochastically constrained markov decision processes with adversarial losses and unknown transitions")

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.NI(Networking and Internet Architecture)