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: "assume admissible synthesis"
  Abstract: In this paper, we introduce a novel rule for synthesis of reactive systems, applicable to systems made of n components which have each their own objectives. It is based on the notion of admissible strategies. We compare our novel rule with previous rules defined in the literature, and we show that contrary to the previous proposals, our rule defines sets of solutions which are rectangular. This property leads to solutions which are robust and resilient. We provide algorithms with optimal complexity and also an abstraction framework.

Connected through hyperedge HE-1 (induced by source paper "the complexity of subgame perfect equilibria in quantitative reachability games"):
  with members:
    - "constrained existence problem for weak subgame perfect equilibria with ω regular boolean objectives"
    - "computer aided synthesis a game theoretic approach"
    - "on the existence of weak subgame perfect equilibria"
    - "admissibility in quantitative graph games"
    - "non zero sum games for reactive synthesis"
    - "the complexity of admissibility in omega regular games"
    - "on subgame perfection in quantitative reachability games"
    - "multiplayer cost games with simple nash equilibria"

Connected through hyperedge HE-2 (induced by source paper "reasoning about quality and fuzziness of strategic behaviours"):
  with members:
    - "strategy logic with imperfect information"
    - "admissibility in quantitative graph games"
    - "high quality synthesis against stochastic environments"
    - "discounting in ltl"
    - "quantified ctl expressiveness and complexity"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "on equilibria in quantitative games with reachability safety objectives"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-3 (induced by source paper "ltlf synthesis with fairness and stability assumptions"):
  with members:
    - "bounded synthesis of reactive programs"
    - "finite ltl synthesis with environment assumptions and quality measures"
    - "symbolic ltlf synthesis"
    - "environment assumptions for synthesis"

Connected through hyperedge HE-4 (induced by source paper "dynamic conflict resolution using justification based reasoning"):
  with members:
    - "temporal justification logic"
    - "what you really need to know about your neighbor"

Connected through hyperedge HE-5 (induced by source paper "justification based reasoning in dynamic conflict resolution"):
  with members:
    - "temporal justification logic"
    - "what you really need to know about your neighbor"

Connected through hyperedge HE-6 (induced by source paper "environmentally friendly gr 1 synthesis"):
  with members:
    - "how to handle assumptions in synthesis"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-7 (induced by source paper "parameterized games and parameterized automata"):
  with members:
    - "admissibility in quantitative graph games"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "the complexity of admissibility in omega regular games"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-8 (induced by source paper "constrained existence problem for weak subgame perfect equilibria with ω regular boolean objectives"):
  with members:
    - "computer aided synthesis a game theoretic approach"
    - "weak subgame perfect equilibria and their application to quantitative reachability"
    - "non zero sum games for reactive synthesis"
    - "secure equilibria in weighted games"
    - "the complexity of admissibility in omega regular 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)