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 an optimal coded caching scheme with small buffers"
  Abstract: Optimal delivery scheme for coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server was proposed by Chen, Fan and Letaief ["Fundamental limits of caching: improved bounds for users with small buffers," (IET Communications), 2016]. This scheme is referred to as the CFL scheme. In this paper, the link between the server and the users is assumed to be error prone only during the delivery phase. Closed form expressions for average rate and peak rate of error correcting delivery scheme for CFL prefetching scheme is obtained. An optimal error correcting delivery scheme for caching problems employing CFL prefetching is proposed.

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"
    - "fundamental limits of caching in heterogeneous networks with uncoded prefetching"
    - "optimal error correcting delivery scheme for coded caching with symmetric batch 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 coded caching with symmetric batch prefetching"
    - "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"

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)