human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "embedded index coding"):
  with members:
    - "task based solutions to embedded index coding"
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on locally decodable index codes"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "distributed index coding"
    - "improved lower bounds for coded caching"
    - "on a duality between recoverable distributed storage and index coding"

Connected through hyperedge HE-2 (induced by source paper "cooperative multi sender index coding"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "optimal finite length and asymptotic index codes for five or fewer receivers"
    - "on the capacity for distributed index coding"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "graph theoretic approaches to two sender index coding"
    - "distributed index coding"
    - "structural properties of index coding capacity using fractional graph theory"
    - "on a duality between recoverable distributed storage and index coding"

Connected through hyperedge HE-3 (induced by source paper "linear index coding with multiple senders and extension to a cellular network"):
  with members:
    - "cooperative multi sender index coding"
    - "index coding with erroneous side information"
    - "structural characteristics of two sender index coding"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "graph theoretic approaches to two sender index coding"
    - "distributed index coding"
    - "on critical index coding problems"

Connected through hyperedge HE-4 (induced by source paper "structural properties of index coding capacity"):
  with members:
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "on approximating the sum rate for multiple unicasts"
    - "on a duality between recoverable distributed storage and index coding"
    - "a rate distortion approach to index coding"
    - "topological interference management through index coding"
    - "fundamental limits of caching in wireless d2d networks"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "critical graphs in index coding"

Connected through hyperedge HE-5 (induced by source paper "generalized lexicographic products and the index coding capacity"):
  with members:
    - "approximate capacity of index coding for some classes of graphs"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "structural properties of index coding capacity using fractional graph theory"
    - "on approximating the sum rate for multiple unicasts"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "fundamental limits of caching in wireless d2d networks"
    - "bounding multiple unicasts through index coding and locally repairable codes"

Connected through hyperedge HE-6 (induced by source paper "a relation between network computation and functional index coding problems"):
  with members:
    - "capacity of sum networks for different message alphabets"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "index coding with coded side information"
    - "an equivalence between network coding and index coding"
    - "optimal index codes for a class of multicast networks with receiver side information"
    - "on network coding for sum networks"
    - "network coding for computing cut set bounds"
    - "optimal computation of symmetric boolean functions in collocated networks"

Connected through hyperedge HE-7 (induced by source paper "the minrank of random graphs"):
  with members:
    - "on a duality between recoverable distributed storage and index coding"
    - "an equivalence between network coding and index coding"
    - "on linear index coding for random graphs"
    - "min rank conjecture for log depth circuits"
    - "linear index coding via semidefinite programming"
    - "non linear index coding outperforming the linear optimum"

Question: Please tell me which class the center node 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)