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: "binary sequent calculi for truth invariance entailment of finite many valued logics"
  Abstract: In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of th is paper is the de- velopment of a new binary sequent calculi (each sequent is a pair of formulae) for many valued logic with a finite set of truth values, and of K ripke-like seman- tics for it that is both sound and complete. We did not use the logic entailment based on matrix with a strict subset of designated truth values, but a different new kind of semantics based on the generalization of the classic 2-valued truth- invariance entailment. In order to define this non-matrix ba sed sequent calculi, we transform many-valued logic into positive 2-valued multi-modal logic with classic conjunction, disjunction and finite set of modal con nectives. In this al- gebraic framework we define an uniquely determined axiom sys tem, by extend- ing the classic 2-valued distributive lattice logic (DLL) b y a new set of sequent axioms for many-valued logic connectives. Dually, in an autoreferential Kripke- style framework we obtain a uniquely determined frame, where each possible world is an equivalence class of Lindenbaum algebra for a many-valued logic as well, represented by a truth value.

Connected through hyperedge HE-1 (induced by source paper "reduction of many valued into two valued modal logics"):
  with members:
    - "on paraconsistent weakening of intuitionistic negation"
    - "a new representation theorem for many valued modal logics"
    - "on a theory of probabilistic deductive databases"

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)