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: "checking interval properties of computations"
  Abstract: Model checking is a powerful method widely explored in formal verification. Given a model of a system, e.g., a Kripke structure, and a formula specifying its expected behaviour, one can verify whether the system meets the behaviour by checking the formula against the model. #R##N#Classically, system behaviour is expressed by a formula of a temporal logic, such as LTL and the like. These logics are "point-wise" interpreted, as they describe how the system evolves state-by-state. However, there are relevant properties, such as those constraining the temporal relations between pairs of temporally extended events or involving temporal aggregations, which are inherently "interval-based", and thus asking for an interval temporal logic. #R##N#In this paper, we give a formalization of the model checking problem in an interval logic setting. First, we provide an interpretation of formulas of Halpern and Shoham's interval temporal logic HS over finite Kripke structures, which allows one to check interval properties of computations. Then, we prove that the model checking problem for HS against finite Kripke structures is decidable by a suitable small model theorem, and we provide a lower bound to its computational complexity.

Connected through hyperedge HE-1 (induced by source paper "model checking the interval way"):
  with members:
    - "complexity of timeline based planning over dense temporal domains exploring the middle ground"
    - "interval vs point temporal logic model checking an expressiveness comparison"
    - "model checking for fragments of halpern and shoham s interval temporal logic based on track representatives"
    - "on the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions"
    - "complexity hierarchies beyond elementary"
    - "complexity of itl model checking some well behaved fragments of the interval logic hs"
    - "interval based synthesis"
    - "an optimal decision procedure for mpnl over the integers"

Connected through hyperedge HE-2 (induced by source paper "interval vs point temporal logic model checking an expressiveness comparison"):
  with members:
    - "on the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions"
    - "model checking the logic of allen s relations meets and started by is p np complete"
    - "a decidable weakening of compass logic based on cone shaped cardinal directions"
    - "complexity of itl model checking some well behaved fragments of the interval logic hs"

Connected through hyperedge HE-3 (induced by source paper "model checking for fragments of halpern and shoham s interval temporal logic based on track representatives"):
  with members:
    - "interval vs point temporal logic model checking an expressiveness comparison"
    - "complexity of itl model checking some well behaved fragments of the interval logic hs"
    - "interval based synthesis"

Connected through hyperedge HE-4 (induced by source paper "on the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions"):
  with members:
    - "interval vs point temporal logic model checking an expressiveness comparison"
    - "model checking the logic of allen s relations meets and started by is p np complete"
    - "complexity of itl model checking some well behaved fragments of the interval logic hs"

Connected through hyperedge HE-5 (induced by source paper "model checking the logic of allen s relations meets and started by is p np complete"):
  with members:
    - "complexity of itl model checking some well behaved fragments of the interval logic hs"

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)