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: "critical database size for effective caching"
  Abstract: Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the performance gain of caching was thought to result from making part of the requested data available closer to end users. Recently, it has been shown that by using a carefully designed technique to store the contents in the cache and coding across data streams a much more significant gain can be achieved in reducing the network load. Inner and outer bounds on the network load v/s cache memory tradeoff were obtained in (Maddah-Ali and Niesen, 2012). We give an improved outer bound on the network load v/s cache memory tradeoff. We address the question of to what extent caching is effective in reducing the server load when the number of files becomes large as compared to the number of users. We show that the effectiveness of caching become small when the number of files becomes comparable to the square of the number of users.

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 "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-4 (induced by source paper "fog aided wireless networks for content delivery fundamental latency tradeoffs"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "fundamental limits of cache aided interference management"
    - "a learning based approach to caching in heterogenous small cell networks"
    - "fundamental storage latency tradeoff in cache aided mimo interference networks"
    - "fog computing based radio access networks issues and challenges"
    - "a new converse bound for coded caching"
    - "joint optimization of cloud and edge processing for fog radio access networks"
    - "placing dynamic content in caches with small population"

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 "cloud and cache aided wireless networks fundamental latency trade offs"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "a learning based approach to caching in heterogenous small cell networks"
    - "fog computing based radio access networks issues and challenges"
    - "a new converse bound for coded caching"
    - "placing dynamic content in caches with small population"
    - "on caching with more users than files"
    - "multi library coded caching"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"

Connected through hyperedge HE-7 (induced by source paper "feedback aided coded caching for the miso bc with small caches"):
  with members:
    - "optimal sum dof of the k user miso bc with current and delayed feedback"
    - "the synergistic gains of coded caching and delayed feedback"
    - "information theoretic caching sequential coding for computing"
    - "joint cache channel coding over erasure broadcast channels"
    - "on the benefits of edge caching for mimo interference alignment"
    - "finite length analysis of caching aided coded multicasting"
    - "a transfer learning approach for cache enabled wireless networks"
    - "effect of number of users in multi level coded caching"

Connected through hyperedge HE-8 (induced by source paper "improved approximation of storage rate tradeoff for caching with multiple demands"):
  with members:
    - "fundamental limits of cache aided interference management"
    - "a new converse bound for coded caching"
    - "fundamental limits of caching improved delivery rate cache capacity trade off"
    - "on caching with more users than files"
    - "on the optimality of uncoded cache placement"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "caching aided coded multicasting with multiple random requests"
    - "fundamental limits of caching with secure 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)