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: "on a fractional version of haemers bound"
  Abstract: In this note, we present a fractional version of Haemers' bound on the Shannon capacity of a graph, which is originally due to Blasiak. This bound is a common strengthening of both Haemers' bound and the fractional chromatic number of a graph. We show that this fractional version outperforms any bound on the Shannon capacity that could be attained through Haemers' bound. We show also that this bound is multiplicative, unlike Haemers' bound.

Connected through hyperedge HE-1 (induced by source paper "the generalized orthogonality dimension of generalized kneser graphs bounds and applications"):
  with members:
    - "improved hardness for h colourings of g colourable graphs"
    - "approximating the orthogonality dimension of graphs and hypergraphs"
    - "algebraic approach to promise constraint satisfaction"
    - "on minrank and forbidden subgraphs"
    - "matrix rigidity and the croot lev pach lemma"
    - "probabilistic rank and matrix rigidity"
    - "linear index coding via semidefinite programming"
    - "conditional hardness for approximate coloring"

Connected through hyperedge HE-2 (induced by source paper "approximating the orthogonality dimension of graphs and hypergraphs"):
  with members:
    - "algebraic approach to promise constraint satisfaction"
    - "linear index coding via semidefinite programming"
    - "conditional hardness for approximate coloring"
    - "coloring k colorable graphs using relatively small palettes"
    - "approximate graph coloring by semidefinite programming"

Connected through hyperedge HE-3 (induced by source paper "on the non adaptive zero error capacity of the discrete memoryless two way channel"):
  with members:
    - "capacity of two way channels with symmetry properties"

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)