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: "global numerical constraints on trees"
  Abstract: We introduce a logical foundation to reason on tree structures with#N#constraints on the number of node occurrences. Related formalisms are limited#N#to express occurrence constraints on particular tree regions, as for instance#N#the children of a given node. By contrast, the logic introduced in the present#N#work can concisely express numerical bounds on any region, descendants or#N#ancestors for instance. We prove that the logic is decidable in single#N#exponential time even if the numerical constraints are in binary form. We also#N#illustrate the usage of the logic in the description of numerical constraints#N#on multi-directional path queries on XML documents. Furthermore, numerical#N#restrictions on regular languages (XML schemas) can also be concisely described#N#by the logic. This implies a characterization of decidable counting extensions#N#of XPath queries and XML schemas. Moreover, as the logic is closed under#N#negation, it can thus be used as an optimal reasoning framework for testing#N#emptiness, containment and equivalence.

Connected through hyperedge HE-1 (induced by source paper "extended graded modalities in strategy logic"):
  with members:
    - "mcmas slk a model checker for the verification of strategy logic specifications"
    - "reasoning about strategies on the model checking problem"
    - "enriched mu calculi module checking"

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)