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: "lewisian fixed points i two incomparable constructions"
  Abstract: Our paper is the first study of what one might call "reverse mathematics of explicit fixpoints". We study two methods of constructing such fixpoints for formulas whose principal connective is the intuitionistic Lewis arrow. Our main motivation comes from metatheory of constructive arithmetic, but the systems in question allows several natural semantics. The first of these methods, inspired by de Jongh and Visser, turns out to yield a well-understood modal system. The second one by de Jongh and Sambin, seemingly simpler, leads to a modal theory that proves harder to axiomatize in an elegant way. Apart from showing that both theories are incomparable, we axiomatize their join and investigate several subtheories, whose axioms are obtained as fixpoints of simple formulas. We also show that they are extension stable, that is, their validity in the corresponding preservativity logic of a given arithmetical theory transfer to its finite extensions.

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)