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: "optimal error correcting delivery scheme for coded caching with symmetric batch prefetching"
  Abstract: Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be error-free. During non-peak hours, all the users have full access to the files and they fill their local cache with portions of the files available. During delivery phase, each user requests a file and the server delivers coded transmissions to meet the demands taking into consideration their cache contents. In this paper we assume that the shared link is error prone. A new delivery scheme is required to meet the demands of each user even after receiving finite number of transmissions in error. We characterize the minimum average rate and minimum peak rate for this problem. We find closed form expressions of these rates for a particular caching scheme namely \textit{symmetric batch prefetching}. We also propose an optimal error correcting delivery scheme for coded caching problem with symmetric batch prefetching.

Connected through hyperedge HE-1 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimal error correcting delivery scheme for an optimal coded caching scheme with small buffers"
    - "fundamental limits of caching in heterogeneous networks with uncoded prefetching"
    - "noisy broadcast networks with receiver caching"
    - "caching and delivery via interference elimination"
    - "online coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-2 (induced by source paper "on the optimality of ali niesen decentralized coded caching scheme with and without error correction"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimal error correcting delivery scheme for an optimal coded caching scheme with small buffers"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "online coded caching"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "optimal index codes with near extreme rates"

Connected through hyperedge HE-3 (induced by source paper "optimal error correcting delivery scheme for an optimal coded caching scheme with small buffers"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "error correction for index coding with coded side information"
    - "online 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)