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 of correlated contents"
  Abstract: Coded caching and delivery is studied taking into account the correlations among the contents in the library. Correlations are modeled as common parts shared by multiple contents; that is, each file in the database is composed of a group of subfiles, where each subfile is shared by a different subset of files. The number of files that include a certain subfile is defined as the level of commonness of this subfile. First, a correlation-aware uncoded caching scheme is proposed, and it is shown that the optimal placement for this scheme gives priority to the subfiles with the highest levels of commonness. Then a correlation-aware coded caching scheme is presented, and the cache capacity allocated to subfiles with different levels of commonness is optimized in order to minimize the delivery rate. The proposed correlation-aware coded caching scheme is shown to remarkably outperform state-of-the-art correlation-ignorant solutions, indicating the benefits of exploiting content correlations in coded caching and delivery in networks.

Connected through hyperedge HE-1 (induced by source paper "rate memory trade off for caching and delivery of correlated sources"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coding for cache aided delivery of dynamic correlated content"
    - "broadcast caching networks with two receivers and multiple correlated sources"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "information theoretic caching the multi user case"
    - "correlation aware distributed caching and coded delivery"

Connected through hyperedge HE-2 (induced by source paper "on coding for cache aided delivery of dynamic correlated content"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "correlation aware distributed caching and coded delivery"
    - "cache aided coded multicast for correlated sources"
    - "speeding up future video distribution via channel aware caching aided coded multicast"
    - "a rate distortion approach to caching"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"

Connected through hyperedge HE-3 (induced by source paper "updating content in cache aided coded multicast"):
  with members:
    - "coded multicast fronthauling and edge caching for multi connectivity transmission in fog radio access networks"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "cache aided coded multicast for correlated sources"
    - "adaptive caching networks with optimality guarantees"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "minimum cost multicast over coded packet networks"

Connected through hyperedge HE-4 (induced by source paper "broadcast caching networks with two receivers and multiple correlated sources"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "information theoretic caching the multi user case"
    - "correlation aware distributed caching and coded delivery"
    - "cache aided coded multicast for correlated sources"
    - "a rate distortion approach to caching"
    - "caching aided coded multicasting with multiple random requests"

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)