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: "a focused sequent calculus framework for proof search in pure type systems"
  Abstract: Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundan- cies generated by permutation of rules. This paper addresses the issues of defining such sequent calculi for Pure Type Systems (PTS, which were originally presented in natural de- duction style) and then organizing their rules for effective proof-search. We introduce the idea of Pure Type Sequent Calculus with meta-variables (PTSC�), by enriching the syn- tax of a permutation-free sequent calculus for propositional logic due to Herbelin, which is strongly related to natural deduction and already well adapted to proof-search. The operational semantics is adapted from Herbelin's and is defined by a system of local re- write rules as in cut-elimination, using explicit substitutions. We prove confluence for this system. Restricting our attention to PTSC, a type system for the ground terms of this system, we obtain the Subject Reduction property and show that each PTSC is logically equivalent to its corresponding PTS, and the former is strongly normalising iff the latter is. We show how to make the logical rules of PTSC into a syntax-directed system PS for proof-search, by incorporating the conversion rules as in syntax-directed presentations of the PTS rules for type-checking. Finally, we consider how to use the explicitly scoped meta-variables of PTSCto represent partial proof-terms, and use them to analyse in- teractive proof construction. This sets up a framework PE in which we are able to study proof-search strategies, type inhabitant enumeration and (higher-order) unification.

Connected through hyperedge HE-1 (induced by source paper "proper semirings and proper convex functors"):
  with members:
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "relating coalgebraic notions of bisimulation"
    - "simulation vs equivalence"

Connected through hyperedge HE-2 (induced by source paper "flowchart programs regular expressions and decidability of polynomial growth rate"):
  with members:
    - "resource usage analysis of logic programs via abstract interpretation using sized types"
    - "monotonicity constraints for termination in the integer domain"
    - "on decidable growth rate properties of imperative programs"

Connected through hyperedge HE-3 (induced by source paper "the model checking fingerprints of ctl operators"):
  with members:
    - "model checking ctl is almost always inherently sequential"
    - "the complexity of generalized satisfiability for linear temporal logic"
    - "the tractability of model checking for ltl the good the bad and the ugly fragments"

Connected through hyperedge HE-4 (induced by source paper "an optimal construction of hanf sentences"):
  with members:
    - "first order query evaluation on structures of bounded degree"
    - "automatic structures of bounded degree revisited"
    - "first order queries on structures of bounded degree are computable with constant delay"
    - "deciding first order properties of locally tree decomposable structures"

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)