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: "low effort specification debugging and analysis"
  Abstract: Reactive synthesis deals with the automated construction of implementations of reactive systems#R##N#from their specifications. To make the approach feasible in practice, systems engineers need effective#R##N#and efficient means of debugging these specifications. In this paper, we provide techniques for#R##N#report-based specification debugging, wherein salient properties of a specification are analyzed, and#R##N#the result presented to the user in the form of a report. This provides a low-effort way to debug#R##N#specifications, complementing high-effort techniques including the simulation of synthesized implementations.#R##N#We demonstrate the usefulness of our report-based specification debugging toolkit by#R##N#providing examples in the context of generalized reactivity(1) synthesis.

Connected through hyperedge HE-1 (induced by source paper "reactive synthesis with maximum realizability of linear temporal logic specifications"):
  with members:
    - "encodings of bounded synthesis"
    - "maximum realizability for linear temporal logic specifications"
    - "robust linear temporal logic"
    - "on the minimal revision problem of specification automata"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-2 (induced by source paper "maximum realizability for linear temporal logic specifications"):
  with members:
    - "robust linear temporal logic"
    - "on the minimal revision problem of specification automata"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-3 (induced by source paper "formal requirement debugging for testing and verification of cyber physical systems"):
  with members:
    - "vispec a graphical tool for elicitation of mtl requirements"
    - "optimal strategy synthesis for request response games"
    - "deciding the satisfiability of mitl specifications"

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.SE(Software Engineering)