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 "distributed index coding"):
  Abstract: In this paper, we study the capacity region of the general distributed index coding. In contrast to the traditional centralized index coding where a single server contains all n messages requested by the receivers, in the distributed index coding there are 2 − 1 servers, each containing a unique non-empty subset J of the messages and each is connected to all receivers via a noiseless independent broadcast link with an arbitrary capacity CJ ≥ 0. First, we generalize the existing polymatroidal outer bound on the capacity region of the centralized problem to the distributed case. Next, building upon the existing centralized composite coding scheme, we propose three distributed composite coding schemes and derive the corresponding inner bounds on the capacity region. We present a number of interesting numerical examples, which highlight the subtleties and challenges of dealing with the distributed index coding, even for very small problem sizes of n = 3 and n = 4.

Includes members:
  Member "the single uniprior index coding problem the single sender case and the multi sender extension":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure decentralized pliable index coding")
  Member "structural properties of index coding capacity using fractional graph theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cooperative multi sender index coding")
  Member "critical graphs in index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "embedded index coding")
  Member "on the capacity region for 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 "graph theoretical constructions for graph entropy and network coding based communications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "characteristic dependent linear rank inequalities via complementary vector spaces")

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)