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 "optimal linear broadcast rates of the two sender unicast index coding problem with fully participated interactions"):
  Abstract: The two-sender unicast index coding problem consists of finding optimal coded transmissions from the two senders which collectively know the messages demanded by all the receivers. Each receiver demands a unique message. One important class of this problem consists of the message sets at the senders and the side-information at the receivers satisfying \emph{fully-participated interactions}. This paper provides optimal linear broadcast rates and corresponding code constructions for all the possible cases of the two-sender unicast index coding problem with fully-participated interactions. The optimal linear broadcast rate and the corresponding code for the two-sender problem are given in terms of those of the three single-sender unicast problems associated with the two-sender problem. Optimal linear broadcast rates of two-sender problems with fully-participated interactions provide lower bounds for the optimal linear broadcast rates of many related two-sender problems with \emph{partially-participated interactions}. Proof techniques used to obtain the results for the two-sender problem are shown to be useful in obtaining the results for some cases of the multi-sender unicast index coding problem.

Includes members:
  Member "cooperative multi sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "embedded index coding")
  Member "optimal scalar linear codes for some classes of the two sender groupcast index coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "groupcast index coding problem joint extensions")
  Member "structural characteristics of two sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear index coding with multiple senders and extension to a cellular network")
  Member "on the capacity for distributed index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "joint latency and cost optimization for erasure coded data center storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "grand challenges of resilience autonomous system resilience through design and runtime measures")
  Member "coded caching with distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mobile communications computing and caching resources optimization for coded caching with device computing")
  Member "the single uniprior index coding problem the single sender case and the multi sender extension":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "cooperative multi sender 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)