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: "serving content with unknown demand the high dimensional regime"
  Abstract: In this paper we look at content placement in the high-dimensional regime: there are n servers, and O(n) distinct types of content. Each server can store and serve O(1) types at any given time. Demands for these content types arrive, and have to be served in an online fashion; over time, there are a total of O(n) of these demands. We consider the algorithmic task of content placement: determining which types of content should be on which server at any given time, in the setting where the demand statistics (i.e. the relative popularity of each type of content) are not known a-priori, but have to be inferred from the very demands we are trying to satisfy. This is the high- dimensional regime because this scaling (everything being O(n)) prevents consistent estimation of demand statistics; it models many modern settings where large numbers of users, servers and videos/webpages interact in this way. We characterize the performance of any scheme that separates learning and placement (i.e. which use a portion of the demands to gain some estimate of the demand statistics, and then uses the same for the remaining demands), showing it is order-wise strictly suboptimal. We then study a simple adaptive scheme - which myopically attempts to store the most recently requested content on idle servers - and show it outperforms schemes that separate learning and placement. Our results also generalize to the setting where the demand statistics change with time. Overall, our results demonstrate that separating the estimation of demand, and the subsequent use of the same, is strictly suboptimal.

Connected through hyperedge HE-1 (induced by source paper "resource pooling in large scale content delivery systems"):
  with members:
    - "effects of storage heterogeneity in distributed cache systems"
    - "content replication in large distributed caches"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "coded caching for multi level popularity and access"
    - "multi level coded caching"
    - "online coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-2 (induced by source paper "optimal content replication and request matching in large caching systems"):
  with members:
    - "insensitivity of the mean field limit of loss systems under power of d routing"
    - "randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay"
    - "on the complexity of optimal routing and content caching in heterogeneous networks"
    - "femtocaching wireless video content delivery through distributed caching helpers"

Connected through hyperedge HE-3 (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-4 (induced by source paper "gibbsian on line distributed content caching strategy for cellular networks"):
  with members:
    - "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets"
    - "a low complexity approach to distributed cooperative caching with geographic constraints"
    - "on optimal geographical caching in heterogeneous cellular networks"
    - "a learning based approach to caching in heterogenous small cell networks"
    - "edge caching for coverage and capacity aided heterogeneous networks"
    - "on the delay of geographical caching methods in two tiered heterogeneous networks"
    - "placing dynamic content in caches with small population"
    - "optimization of caching devices with geometric constraints"

Connected through hyperedge HE-5 (induced by source paper "placing dynamic content in caches with small population"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "catalog dynamics impact of content publishing and perishing on the performance of a lru cache"
    - "modeling and predicting popularity dynamics via reinforced poisson processes"
    - "what will 5g be"
    - "exploring the memory bandwidth tradeoff in an information centric network"
    - "asymptotic laws for joint content replication and delivery in wireless networks"
    - "fundamental limits of caching"
    - "femtocaching wireless video content delivery through distributed caching helpers"

Connected through hyperedge HE-6 (induced by source paper "content replication in large distributed caches"):
  with members:
    - "content caching and delivery over heterogeneous wireless networks"
    - "multi level coded caching"
    - "online coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "impact of traffic mix on caching performance in a content centric network"
    - "fundamental limits of caching"
    - "small world file sharing communities"

Connected through hyperedge HE-7 (induced by source paper "paging with multiple caches"):
  with members:
    - "adaptive replication in distributed content delivery networks"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "impact of traffic mix on caching performance in a content centric network"
    - "fundamental limits of caching"
    - "small world file sharing communities"
    - "competitive paging algorithms"

Connected through hyperedge HE-8 (induced by source paper "request patterns and caching for vod services with recommendation systems"):
  with members:
    - "understanding the characteristics of internet short video sharing youtube as a case study"

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)