human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "linear index coding with multiple senders and extension to a cellular network"):
  Abstract: In this paper, linear index codes with multiple senders are studied, where every receiver receives encoded messages from all senders. A new fitting matrix for the multiple senders is proposed and it is proved that the minimum rank of the proposed fitting matrices is the optimal codelength of linear index codes for the multiple senders. In addition, a new type of a side information graph related with the optimal codelength is proposed and whether given side information is critical or not is studied. Furthermore, linear index codes for the cellular network scenario are studied, where each receiver can receive a subset of sub-codewords. Since some receivers cannot receive the entire codeword in the cellular network scenario, the encoding method based on the fitting matrix has to be modified. In the cellular network scenario, we propose another fitting matrix and prove that an optimal generator matrix can be found based on these fitting matrices. In addition, some properties on the optimal codelength of linear index codes for the cellular network case are studied.

Includes members:
  Member "cooperative multi sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "embedded index coding")
  Member "index coding with erroneous side information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "code equivalences between network codes with link errors and index codes with side information errors")
  Member "structural characteristics of two sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal weakly secure linear codes for some classes of the two sender index coding problem")
  Member "interlinked cycles for index coding generalizing cycles and cliques":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "embedded index coding")
  Member "the single uniprior index coding problem the single sender case and the multi sender extension":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure decentralized pliable index coding")
  Member "graph theoretic approaches to two sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cooperative multi sender index coding")
  Member "distributed index coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "embedded index coding")
  Member "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "embedded index coding")

Question: Please tell me which class the source paper 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)