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: "optimization of heterogeneous coded caching"
  Abstract: This paper aims to provide an optimization framework for coded caching that accounts for various heterogeneous aspects of practical systems. An optimization theoretic perspective on the seminal work on the fundamental limits of caching by Maddah Ali and Niesen is first developed, whereas it is proved that the coded caching scheme presented in that work is the optimal scheme among a large, non-trivial family of possible caching schemes. The optimization framework is then used to develop a coded caching scheme capable of handling simultaneous non-uniform file length, non-uniform file popularity, and non-uniform user cache size. Although the resulting full optimization problem scales exponentially with the problem size, this paper shows that tractable simplifications of the problem that scale as a polynomial function of the problem size can still perform well compared to the original problem. By considering these heterogeneities both individually and in conjunction with one another, insights into their interactions and influence on optimal cache content are obtained.

Connected through hyperedge HE-1 (induced by source paper "device to device coded caching with distinct cache sizes"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "device to device secure coded caching"
    - "on coded caching with heterogeneous distortion requirements"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "coded caching in partially cooperative d2d communication networks"
    - "a novel index coding scheme and its application to coded caching"
    - "structural properties of uncoded placement optimization for coded delivery"

Connected through hyperedge HE-2 (induced by source paper "on the dynamic centralized coded caching design"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "uncoded placement optimization for coded delivery"
    - "coded caching with low subpacketization levels"
    - "centralized coded caching schemes a hypergraph theoretical approach"
    - "caching and delivery via interference elimination"
    - "on the optimality of uncoded cache placement"

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"
    - "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"
    - "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-4 (induced by source paper "structure of optimal cache placement for coded caching with heterogeneous demands"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "fundamental limits of caching in wireless d2d networks"
    - "living on the edge the role of proactive caching in 5g wireless networks"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-5 (induced by source paper "towards jointly optimal placement and delivery to code or not to code in wireless caching networks"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "economics of wifi offloading trading delay for cellular capacity"
    - "proactive resource allocation harnessing the diversity and multicast gains"
    - "proactive resource allocation turning predictable behavior into spectral gain"

Connected through hyperedge HE-6 (induced by source paper "optimal wireless caching with placement cost"):
  with members:
    - "towards jointly optimal placement and delivery to code or not to code in wireless caching networks"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "structural properties of uncoded placement optimization for coded delivery"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-7 (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"
    - "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"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"

Connected through hyperedge HE-8 (induced by source paper "on the fundamental limits of fog ran cache aided networks with downlink and sidelink communications"):
  with members:
    - "an optimal linear error correcting delivery scheme for coded caching with shared caches"
    - "how much can d2d communication reduce content delivery latency in fog networks with edge caching"
    - "a new design framework on device to device coded caching with optimal rate and significantly less subpacketizations"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "full coded caching gains for cache less users"
    - "benefits of coded placement for networks with heterogeneous cache sizes"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture"

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)