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: "from uncoded prefetching to coded prefetching in coded caching"
  Abstract: In the coded caching framework proposed by Maddah Ali and Niesen, there are two classes of coding schemes known in the literature, namely uncoded prefetching schemes and coded prefetching schemes. In this work, we provide a connection between the uncoded prefetching scheme proposed by Maddah Ali and Niesen (and its improved version by Yu et al.) and the coded prefetching scheme proposed by Tian and Chen, when the number of files is no larger than that of users. We make a critical observation that a coding component in the Tian-Chen scheme can be replaced by a binary code, which enables us to view the two schemes as the extremes of a more general scheme. The intermediate operating points of this general scheme can in fact provide new tradeoff points previously not known in the literature, however, explicit characterizing the performance of this general scheme appears rather difficult.

Connected through hyperedge HE-1 (induced by source paper "coded caching for heterogeneous systems an optimization perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coded caching with heterogeneous distortion requirements"
    - "benefits of cache assignment on degraded broadcast channels"
    - "optimization of heterogeneous coded caching"
    - "cache aided content delivery over erasure broadcast channels"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "combination networks with or without secrecy constraints the impact of caching relays"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"

Connected through hyperedge HE-2 (induced by source paper "efficient file delivery for coded prefetching in shared cache networks with multiple requests per user"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "novel decentralized coded caching through coded prefetching"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "caching and delivery via interference elimination"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "content caching and delivery over heterogeneous wireless networks"
    - "on the optimality of uncoded cache placement"

Connected through hyperedge HE-3 (induced by source paper "novel decentralized coded caching through coded prefetching"):
  with members:
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "caching and delivery via interference elimination"
    - "on the optimality of uncoded cache placement"
    - "hierarchical coded caching"
    - "fundamental limits of caching improved bounds for small buffer users"
    - "online coded caching"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-4 (induced by source paper "benefits of coded placement for networks with heterogeneous cache sizes"):
  with members:
    - "on coded caching with heterogeneous distortion requirements"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "benefits of cache assignment on degraded broadcast channels"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "fundamental limits of caching"

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)