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 "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"):
  Abstract: Three science and engineering problems of recent interests -index coding, locally recoverable distributed storage, and guessing games on graphs- are discussed and the connection between their optimal solutions is elucidated. By generalizing recent results by Shanmugam and Dimakis and by Mazumdar on the complementarity between the optimal broadcast rate of an index coding problem on a directed graph and the normalized rate of a locally recoverable distributed storage problem on the same graph, it is shown that the capacity region and the optimal rate region of these two problems are complementary. The main ingredients in establishing this result are the notion of confusion graph introduced by Alon et al. (2008), the vertex transitivity of a confusion graph, the characterization of the index coding capacity region via the fractional chromatic number of confusion graphs, and the characterization of the optimal rate region of the locally recoverable distributed storage via the independence number of confusion graphs. As the third and final facet of the complementarity, guessing games on graphs by Riis are discussed as special cases of the locally recoverable distributed storage problem, and it is shown that the winning probability of the optimal strategy for a guessing game and the ratio between the winning probabilities of the optimal strategy and a random guess can be characterized, respectively, by the capacity region for index coding and the optimal rate region for distributed storage.

Includes members:
  Member "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  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 "index coding and network coding via rank minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subspace aware index codes")
  Member "on a duality between recoverable distributed storage and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "embedded index coding")
  Member "a rate distortion approach to index coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative multi sender index coding")
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "bounding multiple unicasts through index coding and locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "embedded index coding")
  Member "critical graphs in index coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "embedded 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)