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: "k users caching two files an improved achievable rate"
  Abstract: Caching is an approach to smoothen the variability of traffic over time. Recently it has been proved that the local memories at the users can be exploited for reducing the peak traffic in a much more efficient way than previously believed. In this work we improve upon the existing results and introduce a novel caching strategy that takes advantage of simultaneous coded placement and coded delivery in order to decrease the worst case achievable rate with $2$ files and $K$ users. We will show that for any cache size $\frac{1}{K}<M<1$ our scheme outperforms the state of the art.

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 "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-3 (induced by source paper "improved converses and gap results for coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "centralized caching and delivery of correlated contents over a gaussian broadcast channel"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "physical layer schemes for wireless coded caching"
    - "rate memory trade off for the two user broadcast caching network with correlated sources"
    - "noisy broadcast networks with receiver caching"

Connected through hyperedge HE-4 (induced by source paper "benefits of cache assignment on degraded broadcast channels"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on coded caching with heterogeneous distortion requirements"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "characterizing the rate memory tradeoff in cache networks within a factor of 2"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "information theoretic caching the multi user case"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of cache aided interference management"
    - "coded caching for a large number of users"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "a new converse bound for coded caching"
    - "fundamental limits of caching improved delivery rate cache capacity trade off"

Connected through hyperedge HE-6 (induced by source paper "from uncoded prefetching to coded prefetching in coded caching"):
  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"
    - "improved converses and gap results for coded caching"
    - "coded caching for a large number of users"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "caching and delivery via interference elimination"
    - "symmetry outer bounds and code constructions a computer aided investigation on the fundamental limits of caching"
    - "on caching with more users than files"

Connected through hyperedge HE-7 (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-8 (induced by source paper "symmetry outer bounds and code constructions a computer aided investigation on the fundamental limits of caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching for a large number of users"
    - "caching and delivery via interference elimination"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "on caching with more users than files"
    - "critical database size for effective caching"
    - "a note on the rate region of exact repair regenerating codes"
    - "order optimal rate of caching and coded multicasting with random demands"

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)