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: "wireless peer to peer scheduling in mobile networks"
  Abstract: This paper considers peer-to-peer scheduling for a network with multiple wireless devices. A subset of the devices are mobile users that desire specific files. Each user may already have certain popular files in its cache. The remaining devices are access points that typically have access to a larger set of files. Users can download packets of their requested file from an access point or from a nearby user. Our prior work optimizes peer scheduling in a general setting, but the resulting delay can be large when applied to mobile networks. This paper focuses on the mobile case, and develops a new algorithm that reduces delay by opportunistically grabbing packets from current neighbors. However, it treats a simpler model where each user desires a single file with infinite length. An algorithm that provably optimizes throughput utility while incentivizing participation is developed for this case. The algorithm extends as a simple heuristic in more general cases with finite file sizes and random active and idle periods.

Connected through hyperedge HE-1 (induced by source paper "wiflix adaptive video streaming in massive mu mimo wireless networks"):
  with members:
    - "performance analysis of massive mimo for cell boundary users"
    - "a control theoretic approach to adaptive video streaming in dense wireless networks"
    - "adaptive video streaming for wireless networks with multiple users and helpers"
    - "achieving large multiplexing gain in distributed antenna systems via cooperation with pcell technology"
    - "optimal user cell association for massive mimo wireless networks"
    - "what will 5g be"
    - "nova qoe driven optimization of dash based video delivery in networks"
    - "loss visibility optimized real time video transmission over mimo systems"

Connected through hyperedge HE-2 (induced by source paper "adaptive video streaming for wireless networks with multiple users and helpers"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "adaptive video streaming in mu mimo networks"
    - "on the average performance of caching and coded multicasting with random demands"
    - "online coded caching"
    - "optimal throughput outage trade off in wireless one hop caching networks"
    - "coded caching with nonuniform demands"
    - "fundamental limits of distributed caching in d2d wireless networks"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-3 (induced by source paper "femtocaching wireless video content delivery through distributed caching helpers"):
  with members:
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "asymptotic laws for joint content replication and delivery in wireless networks"
    - "fundamental limits of caching"
    - "femtocaching and device to device collaboration a new architecture for wireless video distribution"
    - "an adaptive multi channel p2p video on demand system using plug and play helpers"
    - "on the index coding problem and its relation to network coding and matroid theory"
    - "femtocell networks a survey"

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)