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 "optimal scheduling of content caching subject to deadline"):
  Abstract: Content caching at the edge of network is a promising technique to alleviate the burden of backhaul networks. In this paper, we consider content caching along time in a base station with limited cache capacity. As the popularity of contents may vary over time, the contents of cache need to be updated accordingly. In addition, a requested content may have a delivery deadline within which the content need to be obtained. Motivated by these, we address optimal scheduling of content caching in a time-slotted system under delivery deadline and cache capacity constraints. The objective is to minimize a cost function that captures the load of backhaul links. For our optimization problem we prove its NP-hardness via a reduction from the Partition problem. For problem solving, via a mathematical reformulation, we develop a solution approach based on repeatedly applying a column generation algorithm and a problem-tailored rounding algorithm. In addition, two greedy algorithms are developed based on existing algorithms from the literature. Finally, we present extensive simulations that verify the effectiveness of our solution approach in obtaining near-to-optimal solutions in comparison to greedy algorithms. The solutions obtained from our solution approach are within 1% from the global optimum.

Includes members:
  Member "on optimal proactive and retention aware caching with user mobility":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "accounting for information freshness in scheduling of content caching")
  Member "caching at base stations with heterogeneous user demands and spatial locality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm")
  Member "a rolling horizon dynamic programming approach for collaborative caching":
    also connected through other hyperedges:
      (none)
  Member "accounting for information freshness in scheduling of content caching":
    also connected through other hyperedges:
      (none)
  Member "using grouped linear prediction and accelerated reinforcement learning for online content caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "caching with time varying popularity profiles a learning theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the study of dynamic caching via state transition field the case of time invariant popularity")
  Member "optimal geographic caching in cellular networks with linear content coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "accounting for information freshness in scheduling of content caching")
  Member "cost optimal caching for d2d networks with user mobility modeling analysis and computational approaches":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "throughput outage analysis and evaluation of cache aided d2d networks with measured popularity distributions")

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)