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: "approximate capacity of index coding for some classes of graphs"
  Abstract: For a class of graphs for which the Ramsey number $R(i,j)$ is upper bounded by $ci^aj^b$, for some constants $a,b,$ and $c$, it is shown that the clique covering scheme approximates the broadcast rate of every $n$-node index coding problem in the class within a multiplicative factor of $c^{\frac{1}{a+b+1}} n^{\frac{a+b}{a+b+1}}$ for every $n$. Using this theorem and some graph theoretic arguments, it is demonstrated that the broadcast rate of planar graphs, line graphs and fuzzy circular interval graphs is approximated by the clique covering scheme within a factor of $n^{\frac{2}{3}}$.

Connected through hyperedge HE-1 (induced by source paper "linear programming approximations for index coding"):
  with members:
    - "the optimality of partial clique covering for index coding"
    - "storage capacity of repairable networks"
    - "generalized interlinked cycle cover for index coding"
    - "a new index coding scheme exploiting interlinked cycles"
    - "graph theory versus minimum rank for index coding"
    - "local graph coloring and index coding"
    - "lexicographic products and the power of non linear network coding"
    - "linear index coding via semidefinite programming"

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"
    - "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"
    - "structural properties of index coding capacity using fractional graph theory"
    - "storage capacity of repairable networks"
    - "a matrix completion approach to linear index coding problem"

Connected through hyperedge HE-3 (induced by source paper "storage capacity as an information theoretic vertex cover and the index coding rate"):
  with members:
    - "exact algorithms for maximum independent set"
    - "storage capacity of repairable networks"
    - "fixed points of boolean networks guessing graphs and coding theory"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "an equivalence between network coding and index coding"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "lexicographic products and the power of non linear network coding"

Connected through hyperedge HE-4 (induced by source paper "generalized lexicographic products and the index coding capacity"):
  with members:
    - "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"
    - "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"

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)