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: "extension by conservation sikorski s theorem"
  Abstract: Constructive meaning is given to the assertion that every finite Boolean#N#algebra is an injective object in the category of distributive lattices. To#N#this end, we employ Scott's notion of entailment relation, in which context we#N#describe Sikorski's extension theorem for finite Boolean algebras and turn it#N#into a syntactical conservation result. As a by-product, we can facilitate#N#proofs of several related classical principles.

Connected through hyperedge HE-1 (induced by source paper "an algorithmic approach to the existence of ideal objects in commutative algebra"):
  with members:
    - "sequential algorithms and the computational content of classical proofs"
    - "extracting verified decision procedures dpll and resolution"
    - "spector bar recursion over finite partial functions"
    - "induction in algebra a first case study"
    - "interactive learning based realizability for heyting arithmetic with em1"

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)