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 coded caching with heterogeneous distortion requirements"
  Abstract: This paper considers heterogeneous coded caching where the users have unequal distortion requirements. The server is connected to the users via an error-free multicast link and designs the users' cache sizes subject to a total memory budget. In particular, in the placement phase, the server jointly designs the users' cache sizes and the cache contents. To serve the users' requests, in the delivery phase, the server transmits signals that satisfy the users' distortion requirements. An optimization problem with the objective of minimizing the worst-case delivery load subject to the total cache memory budget and users' distortion requirements is formulated. The optimal solution for uncoded placement and linear delivery is characterized explicitly and is shown to exhibit a threshold policy with respect to the total cache memory budget. As a byproduct of the study, a caching scheme for systems with fixed cache sizes that outperforms the state-of-art is presented.

Connected through hyperedge HE-1 (induced by source paper "device to device coded caching with distinct cache sizes"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "device to device secure coded caching"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "optimization of heterogeneous coded caching"
    - "coded caching in partially cooperative d2d communication networks"
    - "a novel index coding scheme and its application to coded caching"
    - "structural properties of uncoded placement optimization for coded delivery"

Connected through hyperedge HE-2 (induced by source paper "rate distortion memory trade offs in heterogeneous caching networks"):
  with members:
    - "on coding for cache aided delivery of dynamic correlated content"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "noisy broadcast networks with receiver caching"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "a rate distortion approach to caching"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "distortion memory tradeoffs in cache aided wireless video delivery"
    - "on the average performance of caching and coded multicasting with random demands"

Connected through hyperedge HE-3 (induced by source paper "coded caching for heterogeneous systems an optimization perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "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"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"

Connected through hyperedge HE-4 (induced by source paper "benefits of coded placement for networks with heterogeneous cache sizes"):
  with members:
    - "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"
    - "from uncoded prefetching to coded prefetching in coded caching"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "fundamental limits of 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"
    - "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"
    - "improved converses and gap results for coded 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)