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: "structural properties of index coding capacity using fractional graph theory"
  Abstract: The capacity region of the index coding problem is characterized through the notion of confusion graph and its fractional chromatic number. Based on this multiletter characterization, several structural properties of the capacity region are established, some of which are already noted by Tahmasbi, Shahrasbi, and Gohari, but proved here with simple and more direct graph-theoretic arguments. In particular, the capacity region of a given index coding problem is shown to be simple functionals of the capacity regions of smaller subproblems when the interaction between the subproblems is none, one-way, or complete.

Connected through hyperedge HE-1 (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"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "on a duality between recoverable distributed storage and index coding"

Connected through hyperedge HE-2 (induced by source paper "the optimality of partial clique covering for index coding"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "local partial clique covers for index coding"
    - "approximate capacity of index coding for some classes of graphs"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "storage capacity of repairable networks"
    - "a matrix completion approach to linear index coding problem"

Connected through hyperedge HE-3 (induced by source paper "structural characteristics of two sender index coding"):
  with members:
    - "cooperative multi sender index coding"
    - "optimal linear broadcast rates of the two sender unicast index coding problem with fully participated interactions"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "fundamental limits of decentralized data shuffling"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "interlinked cycles for index coding generalizing cycles and cliques"):
  with members:
    - "on critical index coding problems"
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through index coding"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"
    - "local graph coloring and index coding"

Connected through hyperedge HE-5 (induced by source paper "index coding rank invariant extensions"):
  with members:
    - "uniprior index coding"
    - "structural properties of index coding capacity"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "optimal vector linear index codes for some symmetric side information problems"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "on index coding and graph homomorphism"
    - "optimal index codes with near extreme rates"

Connected through hyperedge HE-6 (induced by source paper "the single uniprior index coding problem the single sender case and the multi sender extension"):
  with members:
    - "a new index coding scheme exploiting interlinked cycles"
    - "on index coding and graph homomorphism"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "a new class of index coding instances where linear coding is optimal"
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"
    - "fundamental limits of distributed caching in d2d wireless networks"

Connected through hyperedge HE-7 (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"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "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-8 (induced by source paper "graph theoretic approaches to two sender index coding"):
  with members:
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "distributed index coding"
    - "generalized interlinked cycle cover for index coding"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "on the capacity region for index coding"
    - "local graph coloring and index coding"
    - "index coding an interference alignment perspective"
    - "dynamic index coding for wireless broadcast networks"

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)