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: "approximating optimal bounds in prompt ltl realizability in doubly exponential time"
  Abstract: We consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic, an extension of Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by some parameter. In the realizability optimization problem, one is interested in computing the minimal such bound that allows to realize a given specification. It is known that this problem is solvable in triply-exponential time, but not whether it can be done in doubly-exponential time, i.e., whether it is just as hard as solving LTL realizability. #R##N#We take a step towards resolving this problem by showing that the optimum can be approximated within a factor of two in doubly-exponential time. Also, we report on a proof-of-concept implementation of the algorithm based on bounded LTL synthesis, which computes the smallest implementation of a given specification. In our experiments, we observe a tradeoff between the size of the implementation and the bound it realizes. We investigate this tradeoff in the general case and prove upper bounds, which reduce the search space for the algorithm, and matching lower bounds.

Connected through hyperedge HE-1 (induced by source paper "parameterized linear temporal logics meet costs still not costlier than ltl"):
  with members:
    - "visibly linear dynamic logic"
    - "parametric linear dynamic logic full version"
    - "parameterized linear temporal logics meet costs still not costlier than ltl full version"
    - "parametric linear dynamic logic"
    - "weak mso u with path quantifiers over infinite trees"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "parity and streett games with costs"
    - "optimal bounds in parametric ltl games"

Connected through hyperedge HE-2 (induced by source paper "parameterized linear temporal logics meet costs still not costlier than ltl full version"):
  with members:
    - "visibly linear dynamic logic"
    - "parametric linear dynamic logic full version"
    - "parameterized linear temporal logics meet costs still not costlier than ltl"
    - "parametric linear dynamic logic"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "parity and streett games with costs"
    - "optimal bounds in parametric ltl games"
    - "energy parity games"

Connected through hyperedge HE-3 (induced by source paper "parametric linear dynamic logic full version"):
  with members:
    - "parametric linear dynamic logic"
    - "optimal bounds in parametric ltl games"

Connected through hyperedge HE-4 (induced by source paper "parametric linear dynamic logic"):
  with members:
    - "proceedings of second international symposium on games automata logics and formal verification gandalf 2011 electronic proceedings in theoretical computer science"
    - "optimal bounds in parametric ltl games"

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)