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: "on the coded caching delivery design over wireless networks"
  Abstract: Coded caching scheme is a promising technique to migrate the network burden in peak hours, which attains more prominent gains than the uncoded caching. The coded caching scheme can be classified into two types, namely, the centralized and the decentralized scheme, according to whether the placement procedures are carefully designed or operated at random. However, most of the previous analysis assumes that the connected links between server and users are error-free. In this paper, we explore the coded caching based delivery design in wireless networks, where all the connected wireless links are different. For both centralized and decentralized cases, we proposed two delivery schemes, namely, the orthogonal delivery scheme and the concurrent delivery scheme. We focus on the transmission time slots spent on satisfying the system requests, and prove that for both the centralized and the decentralized cases, the concurrent delivery always outperforms orthogonal delivery scheme. Furthermore, for the orthogonal delivery scheme, we derive the gap in terms of transmission time between the decentralized and centralized case, which is essentially no more than 1.5.

Connected through hyperedge HE-1 (induced by source paper "resolving a feedback bottleneck of multi antenna coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "full coded caching gains for cache less users"
    - "on multi server coded caching in the low memory regime"
    - "alpha fair coded caching"
    - "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"
    - "multi antenna interference management for coded caching"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "on coded caching in the overloaded miso broadcast channel"

Connected through hyperedge HE-2 (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"
    - "correlation aware distributed caching and coded delivery"

Connected through hyperedge HE-3 (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"
    - "wireless coded caching a topological perspective"

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.IT(Information Theory)