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 "structural characteristics of two sender index coding"):
  Abstract: This paper studies index coding with two senders. In this setup, source messages are distributed among the senders (possibly with overlapping of messages). In addition, there are multiple receivers, where each receiver having some messages a priori, known as side-information, is requesting one unique message such that each message is requested by only one receiver. Index coding in this setup is called two-sender unicast index coding (TSUIC). The main goal is to find the shortest aggregate encoded messages while allowing all receivers to decode their requested messages. Firstly, we form three independent sub-problems of a TSUIC problem based on whether the requested messages by receivers of those sub-problems are available only in one of the senders or in both senders. Then we express the optimal broadcast rate (the shortest normalized codelength) of the TSUIC problem as a function of the optimal broadcast rates of those independent sub-problems. In this way, we devise the structural characteristics of TSUIC. For the proofs of our results, we apply the notion of confusion graphs and a code-forming technique. To color a confusion graph in TSUIC, we introduce a new graph-coloring approach (different from the normal graph coloring), called two-sender graph coloring, and propose a way of grouping the vertices to analyze the number of colors used. Finally, we determine a class of TSUIC instances where a certain type of side-information can be removed without affecting their optimal broadcast rates.

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 linear broadcast rates of the two sender unicast index coding problem with fully participated interactions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions")
  Member "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions":
    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 "optimal scalar linear codes for some classes of the two sender groupcast index coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "groupcast index coding problem joint extensions")
  Member "fundamental limits of decentralized data shuffling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval")
  Member "interlinked cycles for index coding generalizing cycles and cliques":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "embedded index coding")
  Member "optimal finite length and asymptotic index codes for five or fewer receivers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cooperative multi sender index coding")
  Member "on the capacity for distributed index coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an index coding approach to caching with uncoded cache placement")

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)