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: "the performance analysis of coded cache in wireless fading channel"
  Abstract: The rapid growth of data volume and the accompanying congestion problems over the wireless networks have been critical issues to content providers. A novel technique, termed as coded cache, is proposed to relieve the burden. Through creating coded-multicasting opportunities, the coded-cache scheme can provide extra performance gain over the conventional push technique that simply pre-stores contents at local caches during the network idle period. But existing works on the coded caching scheme assumed the availability of an error-free shared channel accessible by each user. This paper considers the more realistic scenario where each user may experience different link quality. In this case, the system performance would be restricted by the user with the worst channel condition. And the corresponding resource allocation schemes aimed at breaking this obstacles are developed. Specifically, we employ the coded caching scheme in time division and frequency division transmission mode and formulate the sub-optimal problems. Power and bandwidth are allocated respectively to maximum the system throughput. The simulation results show that the throughput of the technique in wireless scenario will be limited and would decrease as the number of users becomes sufficiently large.

Connected through hyperedge HE-1 (induced by source paper "cache aided communications with multiple antennas at finite snr"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "state adaptive coded caching for symmetric broadcast channels"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "multi antenna coded caching"
    - "noisy broadcast networks with receiver caching"

Connected through hyperedge HE-2 (induced by source paper "adaptive coded caching for fair delivery over fading channels"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "utility optimal scheduling for coded caching in general topologies"
    - "multi antenna coded caching"
    - "noisy broadcast networks with receiver caching"
    - "wireless caching technical misconceptions and business barriers"
    - "wireless coded caching a topological perspective"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"

Connected through hyperedge HE-3 (induced by source paper "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"):
  with members:
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching and coded delivery over gaussian broadcast channels for energy efficiency"
    - "physical layer schemes for wireless coded caching"
    - "noisy broadcast networks with receiver caching"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "wireless coded caching a topological perspective"
    - "decentralized caching and coded delivery with distinct cache capacities"

Connected through hyperedge HE-4 (induced by source paper "improved converses and gap results for coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "centralized caching and delivery of correlated contents over a gaussian broadcast channel"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "physical layer schemes for wireless coded caching"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "noisy broadcast networks with receiver caching"

Connected through hyperedge HE-5 (induced by source paper "benefits of cache assignment on degraded broadcast channels"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coded caching with heterogeneous distortion requirements"
    - "centralized caching and delivery of correlated contents over a gaussian broadcast channel"
    - "broadcast caching networks with two receivers and multiple correlated sources"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "on coded caching in the overloaded miso broadcast channel"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"

Connected through hyperedge HE-6 (induced by source paper "optimization of heterogeneous coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "alpha fair coded caching"
    - "benefits of cache assignment on degraded broadcast channels"
    - "opportunistic content delivery in fading broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "noisy broadcast networks with receiver caching"
    - "on the coded caching delivery design over wireless networks"

Connected through hyperedge HE-7 (induced by source paper "cache aided content delivery over erasure broadcast channels"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of cache aided interference management"
    - "centralized coded caching for heterogeneous lossy requests"
    - "content delivery in erasure broadcast channels with cache and feedback"
    - "coded caching for a large number of users"
    - "a new converse bound for coded caching"
    - "wireless coded caching a topological perspective"

Connected through hyperedge HE-8 (induced by source paper "caching and coded delivery over gaussian broadcast channels for energy efficiency"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "on coded caching in the overloaded miso broadcast channel"
    - "physical layer schemes for wireless coded caching"
    - "noisy broadcast networks with receiver caching"
    - "on the coded caching delivery design over wireless networks"

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)