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 "flexible content placement in cache networks using reinforced counters"):
  Abstract: In this paper we study the problem of content placement in a ca che network. We consider a network where routing of requests is b ased on random walks. Content placement is done using a novel mechanism ref erred to as "rein- forced counters". To each content we associate a counter, wh ich is incremented every time the content is requested, and which is decremente d at a fixed rate. We model and analyse this mechanism, tuning its parameters s o as to achieve desired performance goals for a single cache or for a cache ne twork. We also show that the optimal static content placement, without rei nforced counters, is NP hard under different design goals.

Includes members:
  Member "exact analysis of ttl cache networks the case of caching policies driven by stopping times":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "practical bounds on optimal caching with variable object sizes")
  Member "enabling information centric networks through opportunistic search routing and caching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "q caching an integrated reinforcement learning approach for caching and routing in information centric networks")
  Member "a general tractable and accurate model for a cascade of caches":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "q caching an integrated reinforcement learning approach for caching and routing in information centric networks")

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)