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 "a ttl based approach for content placement in edge networks"):
  Abstract: Edge networks are promising to provide better services to users by provisioning computing and storage resources at the edge of networks. However, due to the uncertainty and diversity of user interests, content popularity, distributed network structure, cache sizes, it is challenging to decide where to place the content, and how long it should be cached. In this paper, we study the utility optimization of content placement at edge networks through timer-based (TTL) policies. We propose provably optimal distributed algorithms that operate at each network cache to maximize the overall network utility. Our TTL-based optimization model provides theoretical answers to how long each content must be cached, and where it should be placed in the edge network. Extensive evaluations show that our algorithm significantly outperforms path replication with conventional caching algorithms over some network topologies.

Includes members:
  Member "cache version selection and content placement for adaptive video streaming in wireless edge networks":
    also connected through other hyperedges:
      (none)
  Member "jointly optimal routing and caching for arbitrary network topologies":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online convex optimization for caching networks")
  Member "a utility optimization approach to network cache design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online convex optimization for caching networks")
  Member "adaptive caching networks with optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cache optimization models and algorithms")
  Member "on the complexity of optimal routing and content caching in heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "consistent user traffic allocation and load balancing in mobile edge caching")
  Member "a unified approach to the performance analysis of caching systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")

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)