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: "centralized coded caching for heterogeneous lossy requests"
  Abstract: Centralized coded caching of popular contents is studied for users with heterogeneous distortion requirements, corresponding to diverse processing and display capabilities of mobile devices. Users' distortion requirements are assumed to be fixed and known, while their particular demands are revealed only after the placement phase. Modeling each file in the database as an independent and identically distributed Gaussian vector, the minimum delivery rate that can satisfy any demand combination within the corresponding distortion target is studied. The optimal delivery rate is characterized for the special case of two users and two files for any pair of distortion requirements. For the general setting with multiple users and files, a layered caching and delivery scheme, which exploits the successive refinability of Gaussian sources, is proposed. This scheme caches each content in multiple layers, and it is optimized by solving two subproblems: lossless caching of each layer with heterogeneous cache capacities, and allocation of available caches among layers. The delivery rate minimization problem for each layer is solved numerically, while two schemes, called the proportional cache allocation (PCA) and ordered cache allocation (OCA), are proposed for cache allocation. These schemes are compared with each other and the cut-set bound through numerical simulations.

Connected through hyperedge HE-1 (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"
    - "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"
    - "wireless content caching for small cell and d2d networks"

Connected through hyperedge HE-2 (induced by source paper "noisy broadcast networks with receiver caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "opportunistic content delivery in fading 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"
    - "multi antenna coded caching"
    - "information theoretic caching the multi user case"

Connected through hyperedge HE-3 (induced by source paper "coded caching and content delivery with heterogeneous distortion requirements"):
  with members:
    - "cache aided content delivery over erasure broadcast channels"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "caching and coded delivery over gaussian broadcast channels for energy efficiency"
    - "coded caching for a large number of users"
    - "speeding up future video distribution via channel aware caching aided coded multicast"
    - "decentralized coded caching with distinct cache capacities"
    - "wireless content caching for small cell and d2d networks"
    - "a rate distortion approach to caching"

Connected through hyperedge HE-4 (induced by source paper "content delivery in erasure broadcast channels with cache and feedback"):
  with members:
    - "information theoretic caching the multi user case"
    - "fundamental limits of cache aided interference management"
    - "wireless caching technical misconceptions and business barriers"
    - "joint cache channel coding over erasure broadcast channels"
    - "critical database size for effective caching"
    - "on the benefits of edge caching for mimo interference alignment"
    - "content caching and delivery over heterogeneous wireless networks"
    - "order optimal rate of caching and coded multicasting with random demands"

Connected through hyperedge HE-5 (induced by source paper "coded caching for a large number of users"):
  with members:
    - "fundamental limits of cache aided interference management"
    - "fundamental limits of caching improved delivery rate cache capacity trade off"
    - "wireless content caching for small cell and d2d networks"
    - "a rate distortion approach to caching"
    - "on caching with more users than files"
    - "joint cache channel coding over erasure broadcast channels"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "the performance analysis of coded cache in wireless fading channel"

Connected through hyperedge HE-6 (induced by source paper "fundamental limits of caching improved delivery rate cache capacity trade off"):
  with members:
    - "noisy broadcast networks with receiver caching"
    - "decentralized coded caching with distinct cache capacities"
    - "wireless content caching for small cell and d2d networks"
    - "on caching with more users than files"
    - "joint cache channel coding over erasure broadcast channels"
    - "the performance analysis of coded cache in wireless fading channel"
    - "distortion memory tradeoffs in cache aided wireless video delivery"
    - "a note on the fundamental limits of coded caching"

Connected through hyperedge HE-7 (induced by source paper "a rate distortion approach to caching"):
  with members:
    - "second order region for gray wyner network"
    - "benefits of cache assignment on degraded broadcast channels"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "noisy broadcast networks with receiver caching"
    - "content delivery in erasure broadcast channels with cache and feedback"
    - "coded caching for a large number of users"
    - "information theoretic caching sequential coding for computing"
    - "content caching and delivery over heterogeneous 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.IT(Information Theory)