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: "decentralized coded caching with distinct cache capacities"
  Abstract: Decentralized coded caching is studied for a content server with $N$ files, each of size $F$ bits, serving $K$ active users, each equipped with a cache of distinct capacity. It is assumed that the users' caches are filled in advance during the off-peak traffic period without the knowledge of the number of active users, their identities, or the particular demands. User demands are revealed during the peak traffic period, and are served simultaneously through an error-free shared link. A new decentralized coded caching scheme is proposed for this scenario, and it is shown to improve upon the state-of-the-art in terms of the required delivery rate over the shared link, when there are more users in the system than the number of files. Numerical results indicate that the improvement becomes more significant as the cache capacities of the users become more skewed.

Connected through hyperedge HE-1 (induced by source paper "an approximation algorithm for optimal clique cover delivery in coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "capacity of some index coding problems with symmetric neighboring interference"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "novel delivery schemes for decentralized coded caching in the finite file size regime"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "finite length analysis of caching aided coded multicasting"
    - "an efficient multiple groupcast coded multicasting scheme for finite fractional caching"

Connected through hyperedge HE-2 (induced by source paper "decentralized caching schemes and performance limits in two layer networks"):
  with members:
    - "riding on the primary a new spectrum sharing paradigm for wireless powered iot devices"
    - "low subpacketization schemes for coded caching"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "on edge caching with secrecy constraints"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "fundamental limits of secretive coded caching"
    - "caching aided coded multicasting with multiple random requests"
    - "order optimal rate of caching and coded multicasting with random demands"

Connected through hyperedge HE-3 (induced by source paper "on coded caching with heterogeneous distortion requirements"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "benefits of cache assignment on degraded 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"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "a rate distortion approach to caching"

Connected through hyperedge HE-4 (induced by source paper "simplifying wireless social caching via network coding"):
  with members:
    - "optimizing mds coded caching in wireless networks with device to device communication"
    - "wireless device to device caching networks basic principles and system performance"
    - "optimal storage allocation for wireless cloud caching systems with a limited sum storage capacity"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "multi level coded caching"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "distributed storage allocations"

Connected through hyperedge HE-5 (induced by source paper "centralized caching with unequal cache sizes"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "hierarchical coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-6 (induced by source paper "optimization of heterogeneous coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "alpha fair coded caching"
    - "benefits of cache assignment on degraded broadcast channels"
    - "opportunistic content delivery in fading broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "noisy broadcast networks with receiver caching"
    - "on the coded caching delivery design over wireless networks"

Connected through hyperedge HE-7 (induced by source paper "degrees of freedom of interference networks with transmitter side caches"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "degrees of freedom of cache aided wireless interference networks"
    - "cloud and cache aided wireless networks fundamental latency trade offs"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "multi server coded caching"

Connected through hyperedge HE-8 (induced by source paper "coded caching in a multi server system with random topology"):
  with members:
    - "cooperative multi sender index coding"
    - "coded caching with distributed storage"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "wireless content caching for small cell and d2d networks"
    - "caching and delivery via interference elimination"
    - "decentralized caching and coded delivery with distinct cache capacities"
    - "distributed index coding"
    - "on the optimality of uncoded cache placement"

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)