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: "efficient file delivery for coded prefetching in shared cache networks with multiple requests per user"
  Abstract: We consider a centralized caching network, where a server serves several groups of users, each having a common shared fixed-size cache and requesting multiple files. An existing coded prefetching scheme is employed where each file is broken into multiple fragments and each cache stores multiple coded packets each formed by XORing fragments from different files. For such a system, we propose an efficient file delivery scheme by the server to meet the multi-requests of all user-groups. Specifically, the stored coded packets of each cache are classified into four types based on the composition of the file fragments. For each packet type, the corresponding delivery strategy is developed. The rate as well as the worst rate of the proposed delivery scheme are analyzed. We show that our caching model and delivery scheme can incorporate some existing coded caching schemes as special cases. Moreover, for the special case of uniform requests and uncoded prefetching, we make a comparison with an existing scheme, and show that our approach achieves better performance. We also provide numerical results on the delivery rate for the proposed scheme.

Connected through hyperedge HE-1 (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-2 (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"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "optimization of heterogeneous coded caching"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "noisy broadcast networks with receiver 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)