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: "proving properties of polymorphic programs using type isomorphisms with the yoneda lemma"
  Abstract: We study a class of type isomorphisms arising from a well-known correspondence between the Yoneda lemma of category theory and the polymorphic lambda-calculus. We demonstrate that such isomorphisms provide powerful tools to investigate properties of polymorphic programs, e.g. to count the number of inhabitants of a type (up to equivalence), and to transform, whenever possible, a polymorphic program into one with bounded, or predicative, type instantiations. By investigating the equational theory arising from the Yoneda isomorphisms, we introduce some fragments of the polymorphic lambda-calculus whose program equivalence conditions can be fully characterized using non-polymorphic languages. In particular, we describe a fragment in which all types have a finite number of programs (and program equivalence is thus decidable), and one in which all universal types can be converted into recursive/co-recursive types.

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.LO(Logic in Computer Science)