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: "pivotal and pivotal discriminative consequence relations"
  Abstract: A pivotal consequence relation is defined to hold between a set of formulas Γ and formula α iff every non-negligible model for Γ is a model for α. Unlike preferential consequence relations, the set of all non-negligible (or preferred) valuations is fixed and thus does not depend on the premisses under consideration. The first purpose of the present paper is to investigate pivotal consequence relations. We provide characterizations of several families in the classical framework, but also in certain three/four-valued frameworks, well-known as the paraconsistent logics J3 and F O U R. We show also that there is no 'normal' characterization of the family of all pivotal consequence relations, in the infinite classical framework. And we show a link with X-logics. Our second purpose is to investigate a qualified version of pivotal consequence, which we call pivotal-discriminative consequence. This is defined to hold between a set of formulas Γ and formula α iff Γ -- α but Γ -- ¬α, where -- is the plain relation. We provide characterizations of several families of such relations for the classical, three, and four-valued frameworks.

Connected through hyperedge HE-1 (induced by source paper "the description of information in 4 dimensional pseudo euclidean information space"):
  with members:
    - "the recognizability of sets of graphs is a robust property"
    - "logic column 15 coalgebras and their logics"
    - "supervisory control of fuzzy discrete event systems a formal approach"

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)