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: "isbell duality for refinement types"
  Abstract: Any refinement system (= functor) has a full and faithful embedding into the refinement system of presheaves over categories, by a simultaneous generalization of the Yoneda embedding and of the slice representation of a category. Motivated by an analogy between side-effects in programming and "context effects" in proof theory, we study logical aspects of this embedding, as well as of an associated "opposite embedding" (= embedding of the opposite functor). We expose a duality between these two embeddings mediated by negation into a "universal refinement" (a presheaf associated with the original refinement system), and use this to derive two interesting formulas for the embedding of a pushforward, which decompose it either as the negation of a pullback of a negation, or as the double-negation of a pushforward.

Connected through hyperedge HE-1 (induced by source paper "a bifibrational reconstruction of lawvere s presheaf hyperdoctrine"):
  with members:
    - "an isbell duality theorem for type refinement systems"

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)