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: "the rho capacity of a graph"
  Abstract: Motivated by the problem of zero-error broadcasting, we introduce a new notion of graph capacity, termed    $\rho $   -capacity, that generalizes the Shannon capacity of a graph. We derive upper and lower bounds on the    $\rho $   -capacity of arbitrary graphs, and provide a Lovasz-type upper bound for regular graphs. We study the behavior of the    $\rho $   -capacity under two graph operations: the strong product and the disjoint union. Finally, we investigate the connection between the structure of a graph and its    $\rho $   -capacity.

Connected through hyperedge HE-1 (induced by source paper "variable length coding for zero error channel capacity"):
  with members:
    - "zero error capacity of duplication channels"
    - "bounds on the reliability of typewriter channels"
    - "zero error capacity of p ary shift channels and fifo queues"
    - "uncertain wiretap channels and secure estimation"
    - "rate distance tradeoff for codes above graph capacity"
    - "secure estimation and zero error secrecy capacity"
    - "graph information ratio"
    - "new lower bounds for the shannon capacity of odd cycles"

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)