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: "index coding with coded side information"
  Abstract: This letter investigates a new class of index coding problems. One sender broadcasts packets to multiple users, each desiring a subset, by exploiting prior knowledge of linear combinations of packets. We refer to this class of problems as index coding with  coded  side-information. Our aim is to characterize the minimum index code length that the sender needs to transmit to simultaneously satisfy all user requests. We show that the optimal binary vector index code length is equal to the minimum rank (minrank) of a matrix whose elements consist of the sets of desired packet indices and side-information encoding matrices. This is the natural extension of matrix minrank in the presence of coded side information. Using the derived expression, we propose a greedy randomized algorithm to minimize the rank of the derived matrix.

Connected through hyperedge HE-1 (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"
    - "blind index coding"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "on the capacity region for index coding"

Connected through hyperedge HE-2 (induced by source paper "on the capacity of computation broadcast"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "the capacity of private computation"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"
    - "interference channels with arbitrarily correlated sources"

Connected through hyperedge HE-3 (induced by source paper "codes for updating linear functions over small fields"):
  with members:
    - "updating content in cache aided coded multicast"
    - "multi version coding for consistent distributed storage of correlated data updates"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "fundamental limits on communication for oblivious updates in storage networks"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-4 (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"
    - "blind index coding"
    - "topological interference management through index coding"
    - "an equivalence between network coding and index coding"
    - "dynamic index coding for wireless broadcast networks"
    - "error correction for index coding with side information"

Connected through hyperedge HE-5 (induced by source paper "subspace aware index codes"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "a sparse and low rank optimization framework for index coding via riemannian optimization"
    - "index coding and network coding via rank minimization"
    - "caching and coded multicasting multiple groupcast index coding"
    - "quasi linear network coding"
    - "rank minimization over finite fields fundamental limits and coding theoretic interpretations"
    - "an equivalence between network coding and index coding"
    - "sparse subspace clustering algorithm theory and applications"

Connected through hyperedge HE-6 (induced by source paper "generalized index coding problem and discrete polymatroids"):
  with members:
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "linear network coding linear index coding and representable discrete polymatroids"
    - "optimal index codes for a class of multicast networks with receiver side information"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-7 (induced by source paper "throughput analysis of decentralized coded content caching in cellular networks"):
  with members:
    - "multihop caching aided coded multicasting for the next generation of cellular networks"
    - "wireless device to device caching networks basic principles and system performance"
    - "capacity of cellular networks with femtocache"
    - "caching in wireless multihop device to device networks"
    - "hierarchical coded caching"
    - "fundamental limits of caching in wireless d2d networks"
    - "fundamental limits of caching improved bounds for small buffer users"
    - "multi level coded caching"

Connected through hyperedge HE-8 (induced by source paper "capacity of cellular networks with femtocache"):
  with members:
    - "multihop caching aided coded multicasting for the next generation of cellular networks"
    - "wireless device to device caching networks basic principles and system performance"
    - "caching in wireless multihop device to device networks"
    - "hierarchical coded caching"
    - "modified index coding increases capacity of information centric networks"
    - "fundamental limits of caching in wireless d2d networks"
    - "fundamental limits of caching improved bounds for small buffer users"
    - "multi level coded 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)