human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a unified approach to the performance analysis of caching systems"
  Abstract: We propose a unified methodology to analyse the performance of caches (both isolated and interconnected), by extending and generalizing a decoupling technique originally known as Che's approximation, which provides very accurate results at low computational cost. We consider several caching policies, taking into account the effects of temporal locality. In the case of interconnected caches, our approach allows us to do better than the Poisson approximation commonly adopted in prior work. Our results, validated against simulations and trace-driven experiments, provide interesting insights into the performance of caching systems.

Connected through hyperedge HE-1 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity"):
  with members:
    - "decentralized caching for content delivery based on blockchain a game theoretic perspective"
    - "cost effective cache deployment in mobile heterogeneous networks"
    - "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets"
    - "a survey on low latency towards 5g ran core network and caching solutions"
    - "wireless device to device caching networks basic principles and system performance"
    - "optimization and analysis of probabilistic caching in n tier heterogeneous networks"
    - "cache enabled heterogeneous cellular networks optimal tier level content placement"
    - "optimal geographic caching in cellular networks"

Connected through hyperedge HE-2 (induced by source paper "a ttl based approach for content placement in edge networks"):
  with members:
    - "cache version selection and content placement for adaptive video streaming in wireless edge networks"
    - "jointly optimal routing and caching for arbitrary network topologies"
    - "a utility optimization approach to network cache design"
    - "adaptive caching networks with optimality guarantees"
    - "on the complexity of optimal routing and content caching in heterogeneous networks"

Connected through hyperedge HE-3 (induced by source paper "a swiss army knife for dynamic caching in small cell networks"):
  with members:
    - "similarity caching theory and algorithms"
    - "learning to cache with no regrets"
    - "spatial multi lru caching for wireless networks with coverage overlaps"
    - "cooperative caching and transmission design in cluster centric small cell networks"
    - "placing dynamic content in caches with small population"
    - "optimal geographic caching in cellular networks"
    - "efficient analysis of caching strategies under dynamic content popularity"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-4 (induced by source paper "multi tier caching analysis in cdn based over the top video streaming systems"):
  with members:
    - "fasttrack minimizing stalls for cdn based over the top video streaming systems"
    - "optimized video streaming over cloud a stall quality trade off"
    - "generalization of lru cache replacement policy with applications to video streaming"
    - "video streaming in distributed erasure coded storage systems stall duration analysis"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "on the delay storage trade off in content download from coded distributed storage systems"

Connected through hyperedge HE-5 (induced by source paper "an analytical model for performance and lifetime estimation of hybrid dram nvm main memories"):
  with members:
    - "an operating system level data migration scheme in hybrid dram nvm memory architecture"
    - "eci cache a high endurance and cost efficient i o caching scheme for virtualized platforms"
    - "banshee bandwidth efficient dram caching via software hardware cooperation"
    - "the rowhammer problem and other issues we may face as memory becomes denser"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-6 (induced by source paper "worst case bounds and optimized cache on mth request cache insertion policies under elastic conditions"):
  with members:
    - "caching in the clouds optimized dynamic cache instantiation in content delivery systems"
    - "practical bounds on optimal caching with variable object sizes"
    - "a utility optimization approach to network cache design"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-7 (induced by source paper "a low complexity approach to distributed cooperative caching with geographic constraints"):
  with members:
    - "delivery latency regions in fog rans with edge caching and cloud processing"
    - "spatial multi lru caching for wireless networks with coverage overlaps"
    - "a stackelberg game for incentive proactive caching mechanisms in wireless networks"
    - "cloud and cache aided wireless networks fundamental latency trade offs"
    - "a utility optimization approach to network cache design"
    - "optimal geographic caching in cellular networks"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"
    - "cache aided interference channels"

Connected through hyperedge HE-8 (induced by source paper "practical bounds on optimal caching with variable object sizes"):
  with members:
    - "adaptive caching networks with optimality guarantees"
    - "general caching is hard even with small pages"
    - "tinylfu a highly efficient cache admission policy"
    - "a nearly linear time ptas for explicit fractional packing and covering linear programs"
    - "exact analysis of ttl cache networks the case of caching policies driven by stopping times"
    - "a combinatorial tilde o m 3 2 time algorithm for the min cost flow problem"
    - "performance evaluation of the random replacement policy for networks of caches"
    - "a versatile and accurate approximation for lru cache performance"

Question: Please tell me which class the center node 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)