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: "linear temporal logic for regular cost functions"
  Abstract: Regular cost functions have been introduced recently as an extension to the#N#notion of regular languages with counting capabilities, which retains strong#N#closure, equivalence, and decidability properties. The specificity of cost#N#functions is that exact values are not considered, but only estimated. In this#N#paper, we define an extension of Linear Temporal Logic (LTL) over finite words#N#to describe cost functions. We give an explicit translation from this new logic#N#to two dual form of cost automata, and we show that the natural decision#N#problems for this logic are PSPACE-complete, as it is the case in the classical#N#setting. We then algebraically characterize the expressive power of this logic,#N#using a new syntactic congruence for cost functions introduced in this paper.

Connected through hyperedge HE-1 (induced by source paper "learning automata with side effects"):
  with members:
    - "coalgebraic determinization of alternating automata"
    - "calf categorical automata learning framework"

Connected through hyperedge HE-2 (induced by source paper "a cegar like approach for cost ltl bounds"):
  with members:
    - "discounting in ltl"

Connected through hyperedge HE-3 (induced by source paper "a survey on the local divisor technique"):
  with members:
    - "refinement and difference for probabilistic automata"
    - "regular languages are church rosser congruential"
    - "star free languages are church rosser congruential"

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)