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: "error correction for index coding with side information"
  Abstract: A problem of index coding with side information was first considered by Y. Birk and T. Kol (IEEE INFOCOM, 1998). In the present work, a generalization of index coding scheme, where transmitted symbols are subject to errors, is studied. Error-correcting methods for such a scheme, and their parameters, are investigated. In particular, the following question is discussed: given the side information hypergraph of index coding scheme and the maximal number of erroneous symbols $\delta$, what is the shortest length of a linear index code, such that every receiver is able to recover the required information? This question turns out to be a generalization of the problem of finding a shortest-length error-correcting code with a prescribed error-correcting capability in the classical coding theory. #R##N#The Singleton bound and two other bounds, referred to as the $\alpha$-bound and the $\kappa$-bound, for the optimal length of a linear error-correcting index code (ECIC) are established. For large alphabets, a construction based on concatenation of an optimal index code with an MDS classical code, is shown to attain the Singleton bound. For smaller alphabets, however, this construction may not be optimal. A random construction is also analyzed. It yields another implicit bound on the length of an optimal linear ECIC. #R##N#Further, the problem of error-correcting decoding by a linear ECIC is studied. It is shown that in order to decode correctly the desired symbol, the decoder is required to find one of the vectors, belonging to an affine space containing the actual error vector. The syndrome decoding is shown to produce the correct output if the weight of the error pattern is less or equal to the error-correcting capability of the corresponding ECIC. #R##N#Finally, the notion of static ECIC, which is suitable for use with a family of instances of an index coding problem, is introduced.

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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "code equivalences between network codes with link errors and index codes with side information errors"):
  with members:
    - "index coding with erroneous side information"
    - "an equivalence between secure network and index coding"
    - "a relation between network computation and functional index coding problems"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "index coding with coded side information"
    - "blind index coding"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"

Connected through hyperedge HE-3 (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"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "a field size independent code construction for groupcast index coding problems"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "a matrix completion approach to linear index coding problem"
    - "critical graphs in index coding"
    - "optimal index codes for a class of multicast networks with receiver side information"

Connected through hyperedge HE-5 (induced by source paper "linear codes for broadcasting with noisy side information"):
  with members:
    - "uniprior index coding"
    - "index coding with erroneous side information"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "optimal scalar linear index codes for one sided neighboring side information problems"
    - "error correction for index coding with coded side information"
    - "optimal vector linear index codes for some symmetric side information problems"
    - "blind index coding"
    - "local graph coloring and index coding"

Connected through hyperedge HE-6 (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"
    - "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"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "optimal scalar linear index codes for symmetric and neighboring side information problems"):
  with members:
    - "reduced dimensional optimal vector linear index codes for index coding problems with symmetric neighboring and consecutive side information"
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "topological interference management through index coding"
    - "index coding an interference alignment perspective"
    - "optimal index codes for a class of multicast networks with receiver side information"

Connected through hyperedge HE-8 (induced by source paper "index coding with erroneous side information"):
  with members:
    - "error correction for index coding with coded side information"
    - "capacity of coded index modulation"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "index coding with coded side information"
    - "blind index coding"
    - "topological interference management through index coding"
    - "an equivalence between network coding and index coding"
    - "dynamic index coding for wireless broadcast networks"

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)