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 "embedded index coding"):
  Abstract: Motivated by applications in distributed storage and distributed computation, we introduce embedded index coding (EIC). EIC is a type of distributed index coding in which nodes in a distributed system act as both senders and receivers of information. We show how embedded index coding is related to index coding in general, and give characterizations and bounds on the communication costs of optimal embedded index codes. We also define task-based EIC, in which each sending node encodes and sends data blocks independently of the other nodes. Task-based EIC is more computationally tractable and has advantages in applications such as distributed storage, in which senders may complete their broadcasts at different times. Finally, we give heuristic algorithms for approximating optimal embedded index codes, and demonstrate empirically that these algorithms perform well.

Includes members:
  Member "task based solutions to embedded index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure decentralized pliable index coding")
  Member "cooperative multi sender index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear index coding with multiple senders and extension to a cellular network")
  Member "linear index coding with multiple senders and extension to a cellular network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem")
  Member "on locally decodable index codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "index codes with minimum locality for three receiver unicast problems")
  Member "interlinked cycles for index coding generalizing cycles and cliques":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative multi sender index coding")
  Member "distributed index coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cooperative multi sender 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-7 (induced by source paper "cooperative multi sender index coding")
  Member "improved lower bounds for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on coded caching with private demands")

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)