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: "throughput delay tradeoffs in content centric wireless networks"
  Abstract: We study the throughput and delay characteristics of wireless networks based on a content-centric network architecture, where users are mainly interested in retrieving content stored in the network, rather than in maintaining source-destination communication. Nodes are assumed to be uniformly distributed in the network area. Each node has a limited-capacity content store, which it uses to cache contents according to the proposed caching scheme. Requested content follows a general popularity distribution, and users employ multi-hop communication to retrieve the requested content from the closest cache. We derive the throughput-delay tradeoff of the content-centric wireless network model and solve the caching optimization problem. We then evaluate the network performance for a Zipf content popularity distribution, letting the number of content types and the network size both go to infinity. Finally, we extend our analysis to heterogeneous wireless networks where, in addition to wireless nodes, there are a number of base stations uniformly distributed at random in the network area. We show that in order to achieve a better performance in a heterogeneous network in the order sense, the number of base stations needs to be greater than the ratio of the number of nodes to the number of content types. Furthermore, we show that the heterogeneous network does not yield performance advantages in the order sense if the Zipf content popularity distribution exponent exceeds 3/2.

Connected through hyperedge HE-1 (induced by source paper "optimal caching in mobile hetnets a throughput delay trade off perspective"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "caching in wireless multihop device to device networks"
    - "parallel opportunistic routing in wireless networks"
    - "the throughput outage tradeoff of wireless one hop caching networks"
    - "asymptotic laws for joint content replication and delivery in wireless networks"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "improved capacity scaling in wireless networks with infrastructure"

Connected through hyperedge HE-2 (induced by source paper "optimal caching placement for wireless femto caching network"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "caching and coded multicasting multiple groupcast index coding"
    - "fundamental limits of caching in wireless d2d networks"
    - "living on the edge the role of proactive caching in 5g wireless networks"
    - "cache enabled opportunistic cooperative mimo for video streaming in wireless systems"
    - "online coded caching"
    - "mixed timescale precoding and cache control in cached mimo interference network"

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)