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: "improved converses and gap results for coded caching"
  Abstract: Improved lower bounds on the average and the worst-case rate-memory tradeoffs for the Maddah-Ali&Niesen coded caching scenario are presented. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is less than 2.315 in the worst-case scenario and less than 2.507 in the average-case scenario.

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"
    - "on the capacity for distributed index coding"
    - "coded caching for a large number of users"
    - "fundamental limits of caching improved bounds with coded prefetching"

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"
    - "uncoded placement optimization for coded delivery"
    - "a novel index coding scheme and its application to coded caching"
    - "novel outer bounds and inner bounds with uncoded cache placement for combination networks with end user caches"

Connected through hyperedge HE-3 (induced by source paper "demand private coded caching and the exact trade off for n k 2"):
  with members:
    - "on coded caching with private demands"
    - "subpacketization in coded caching with demand privacy"
    - "demand private coded caching"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "private coded caching"
    - "on the optimality of uncoded cache placement"
    - "fundamental limits of caching with secure delivery"

Connected through hyperedge HE-4 (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"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "a new converse bound for coded caching"
    - "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-5 (induced by source paper "demand private coded caching"):
  with members:
    - "on coded caching with private demands"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "private coded caching"
    - "on the optimality of uncoded cache placement"
    - "caching aided coded multicasting with multiple random requests"
    - "fundamental limits of caching with secure delivery"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-6 (induced by source paper "centralized coded caching with user cooperation"):
  with members:
    - "fundamental latency limits for d2d aided content delivery in fog wireless networks"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "optimizing mds coded caching in wireless networks with device to device communication"
    - "spatially correlated content caching for device to device communications"
    - "multi server coded caching"
    - "fundamental limits of caching in wireless d2d networks"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-7 (induced by source paper "fundamental limits of coded caching the memory rate pair k 1 1 k 1 k 1"):
  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"
    - "caching and delivery via interference elimination"
    - "on the optimality of uncoded cache placement"
    - "a note on the fundamental limits of coded caching"
    - "improved lower bounds for coded caching"
    - "fundamental limits of caching"

Connected through hyperedge HE-8 (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"

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)