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: "coded caching with heterogeneous cache sizes and link qualities the two user case"
  Abstract: The centralized coded caching problem is studied under heterogeneous cache sizes and channel qualities from the server to the users, focusing on the two-user case. More specifically, a server holding $N$ files is considered to be serving two users with different cache sizes, each requesting a single file, and it is assumed that in addition to the shared common link, each user also has a private link from the server available during the delivery phase. Optimal caching and delivery strategies that minimize the worst-case delivery time are presented for any number of files, $N$. The converse proof benefits from Tian's observation that it suffices to consider file-index symmetric caching schemes, while the achievability scheme is obtained through memory-sharing among certain special points. The optimal scheme is shown to exploit all of the private link capacities by transmitting part of the corresponding user's request in an uncoded manner. When there are no private links, the results presented here improve upon the known results in the literature for i) equal cache sizes and arbitrary number of files; and ii) unequal cache sizes and $N=2$ files.

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"
    - "optimization of heterogeneous coded caching"
    - "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 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"

Connected through hyperedge HE-3 (induced by source paper "the caching broadcast channel with a wire and cache tapping adversary of type ii"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"
    - "secrecy capacity memory tradeoff of erasure broadcast channels"
    - "a new wiretap channel model and its strong secrecy capacity"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "combination networks with or without secrecy constraints the impact of caching relays"
    - "information theoretic caching the multi user case"

Connected through hyperedge HE-4 (induced by source paper "full coded caching gains for cache less users"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "benefits of coded placement for networks with heterogeneous cache sizes"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "centralized caching with unequal cache sizes"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "achieving spatial scalability for coded caching over wireless networks"
    - "optimization of heterogeneous coded caching"

Connected through hyperedge HE-5 (induced by source paper "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "benefits of coded placement for networks with heterogeneous cache sizes"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "centralized caching with unequal cache sizes"
    - "efficient file delivery for coded prefetching in shared cache networks with multiple requests per user"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "noisy broadcast networks with receiver caching"

Connected through hyperedge HE-6 (induced by source paper "benefits of coded placement for networks with heterogeneous cache sizes"):
  with members:
    - "on coded caching with heterogeneous distortion requirements"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "benefits of cache assignment on degraded broadcast channels"
    - "from uncoded prefetching to coded prefetching in coded caching"
    - "coded caching and content delivery with heterogeneous distortion requirements"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "fundamental limits of caching"

Connected through hyperedge HE-7 (induced by source paper "centralized caching with unequal cache sizes"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "decentralized coded caching with distinct cache capacities"
    - "hierarchical coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

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)