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: "a new converse bound for coded caching"
  Abstract: An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory--rate tradeoff is characterized to within a multiplicative gap of $4.7$ for the worst case, improving the previous analytical gap of $12$. Furthermore, for the case when users' requests follow the uniform distribution, the multiplicative gap is tightened to $4.7$, improving the previous analytical gap of $72$. As an independent result of interest, for the single-user average case in which the user requests multiple files, it is proved that caching the most requested files is optimal.

Connected through hyperedge HE-1 (induced by source paper "an index coding approach to caching with uncoded cache placement"):
  with members:
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "benefits of cache assignment on degraded broadcast channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "on the capacity for distributed index coding"
    - "coded caching for a large number of users"

Connected through hyperedge HE-2 (induced by source paper "rate memory trade off for multi access coded caching with uncoded placement"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "fundamental limits of caching in heterogeneous networks with uncoded prefetching"
    - "novel decentralized coded caching through coded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "uncoded placement optimization for coded delivery"
    - "a novel index coding scheme and its application to coded caching"

Connected through hyperedge HE-3 (induced by source paper "optimization based decentralized coded caching for files and caches with arbitrary size"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "improved lower bounds for coded caching"
    - "coded caching with nonuniform demands"

Connected through hyperedge HE-4 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching"):
  with members:
    - "coding for distributed fog computing"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "how to optimally allocate resources for coded distributed computing"
    - "information theoretic caching the multi user case"
    - "degrees of freedom of cache aided wireless interference networks"
    - "noisy broadcast networks with receiver caching"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "fundamental limits of cache aided interference management"

Connected through hyperedge HE-5 (induced by source paper "coded caching with heterogeneous cache sizes and link qualities the two user case"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "benefits of coded placement for networks with heterogeneous cache sizes"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching in a multi server system with random topology"
    - "benefits of cache assignment on degraded broadcast channels"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "cache aided content delivery over erasure broadcast channels"

Connected through hyperedge HE-6 (induced by source paper "the optimal memory rate trade off for the non uniform centralized caching problem with two files under uncoded placement"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "a novel centralized strategy for coded caching with non uniform demands"
    - "full characterization of optimal uncoded placement for the structured clique cover delivery of nonuniform demands"
    - "speeding up distributed machine learning using codes"
    - "uncoded caching and cross level coded delivery for non uniform file popularity"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "structural properties of uncoded placement optimization for coded delivery"

Connected through hyperedge HE-7 (induced by source paper "cache aided communications with multiple antennas at finite snr"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "state adaptive coded caching for symmetric broadcast channels"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "multi antenna coded caching"
    - "noisy broadcast networks with receiver caching"

Connected through hyperedge HE-8 (induced by source paper "linear coded caching scheme for centralized networks"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching via line graphs of bipartite graphs"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "optimal placement delivery arrays with minimum number of rows"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "uncoded placement optimization for coded delivery"

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)