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 scalar linear codes for some classes of the two sender groupcast index coding problem"):
  Abstract: The two-sender groupcast index coding problem (TGICP) consists of a set of receivers, where all the messages demanded by the set of receivers are distributed among the two senders. The senders can possibly have a set of messages in common. Each message can be demanded by more than one receiver. Each receiver has a subset of messages (known as its side information) and demands a message it does not have. The objective is to design scalar linear codes at the senders with the minimum aggregate code length such that all the receivers are able to decode their demands, by leveraging the knowledge of the side information of all the receivers. In this work, optimal scalar linear codes of three sub-problems (considered as single-sender groupcast index coding problems (SGICPs)) of the TGICP are used to construct optimal scalar linear codes for some classes of the TGICP. We introduce the notion of joint extensions of a finite number of SGICPs, which generalizes the notion of extensions of a single SGICP introduced in a prior work. An SGICP $\mathcal{I}_E$ is said to be a joint extension of a finite number of SGICPs if all the SGICPs are disjoint sub-problems of $\mathcal{I}_E$. We identify a class of joint extensions, where optimal scalar linear codes of the joint extensions can be constructed using those of the sub-problems. We then construct scalar linear codes for some classes of the TGICP, when one or more sub-problems of the TGICP belong to the above identified class of joint extensions, and provide some necessary conditions for the optimality of the construction.

Includes members:
  Member "cooperative multi sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "embedded index coding")
  Member "linear index coding with multiple senders and extension to a cellular network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "embedded index coding")
  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 "structural characteristics of two sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear index coding with multiple senders and extension to a cellular network")
  Member "index coding rank invariant extensions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal weakly secure linear codes for some classes of the two sender index coding problem")
  Member "on the capacity for distributed index coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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-8 (induced by source paper "mobile communications computing and caching resources optimization for coded caching with device computing")

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)