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: "focusing and polarization in intuitionistic logic"
  Abstract: A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andreoli for linear logic has been applied to both the proof search and the proof normalization approaches to computation. Various proof systems in literature exhibit characteristics of focusing to one degree or another. We present a new, focused proof system for intuitionistic logic, called LJF, and show how other proof systems can be mapped into the new system by inserting logical connectives that prematurely stop focusing. We also use LJF to design a focused proof system for classical logic. Our approach to the design and analysis of these systems is based on the completeness of focusing in linear logic and on the notion of polarity that appears in Girard's LC and LU proof systems.

Connected through hyperedge HE-1 (induced by source paper "a sequent calculus proof search procedure and counter model generation based on natural deduction bounds"):
  with members:
    - "np vs pspace"
    - "propositional logics complexity and the sub formula property"

Connected through hyperedge HE-2 (induced by source paper "normalization by evaluation for call by push value and polarized lambda calculus"):
  with members:
    - "deciding equivalence with sums and the empty type"

Connected through hyperedge HE-3 (induced by source paper "revisiting counter model generation for minimal implicational logic"):
  with members:
    - "propositional logics complexity and the sub formula property"

Connected through hyperedge HE-4 (induced by source paper "raziel private and verifiable smart contracts on blockchains"):
  with members:
    - "smotherspectre exploiting speculative execution through port contention"
    - "a systematic evaluation of transient execution attacks and defenses"
    - "proposal for a fully decentralized blockchain and proof of work algorithm for solving np complete problems"
    - "cachezoom how sgx amplifies the power of cache attacks"
    - "chainspace a sharded smart contracts platform"
    - "an empirical analysis of smart contracts platforms applications and design patterns"
    - "software grand exposure sgx cache attacks are practical"
    - "rollback and forking detection for trusted execution environments using lightweight collective memory"

Connected through hyperedge HE-5 (induced by source paper "the exp log normal form of types decomposing extensional equality and representing terms compactly"):
  with members:
    - "simply typed lambda calculus modulo type isomorphisms"
    - "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"
    - "axioms and decidability for type isomorphism in the presence of sums"

Connected through hyperedge HE-6 (induced by source paper "deciding equivalence with sums and the empty type"):
  with members:
    - "the exp log normal form of types decomposing extensional equality and representing terms compactly"

Connected through hyperedge HE-7 (induced by source paper "a compact representation of terms and extensional equality at the exp log normal form of types"):
  with members:
    - "axioms and decidability for type isomorphism in the presence of sums"

Connected through hyperedge HE-8 (induced by source paper "a linear producer consumer model of classical linear logic"):
  with members:
    - "finite vector spaces as model of simply typed lambda calculi"

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)