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: "complete contracts through specification drivers"
  Abstract: Existing techniques of Design by Contract do not allow software developers to specify complete contracts in many cases. Incomplete contracts leave room for malicious implementations. This article complements Design by Contract with a simple yet powerful technique that removes the problem without adding syntactical mechanisms. The proposed technique makes it possible not only to derive complete contracts, but also to rigorously check and improve completeness of existing contracts without instrumenting them.

Connected through hyperedge HE-1 (induced by source paper "formality in software requirements"):
  with members:
    - "autoreq expressing and verifying requirements for control systems"
    - "a contract based method to specify stimulus response requirements"
    - "unifying requirements and code an example"
    - "reasoning about identifier spaces how to make chord correct"
    - "autoproof auto active functional verification of object oriented programs"

Connected through hyperedge HE-2 (induced by source paper "seamless object oriented requirements"):
  with members:
    - "object oriented requirements reusable understandable verifiable"
    - "autoreq expressing and verifying requirements for control systems"
    - "autoproof auto active functional verification of object oriented programs"
    - "flexible invariants through semantic collaboration"

Connected through hyperedge HE-3 (induced by source paper "object oriented requirements reusable understandable verifiable"):
  with members:
    - "expressing and verifying embedded software requirements"
    - "unifying requirements and code an example"
    - "autoproof auto active functional verification of object oriented programs"

Connected through hyperedge HE-4 (induced by source paper "teaching devops in corporate environments an experience report"):
  with members:
    - "microservices how to make your application scale"
    - "microservices yesterday today and tomorrow"
    - "jolie coog buildings internet of things for smart building infrastructure supporting concurrent apps utilizing distibuted microservices"
    - "unifying requirements and code an example"

Connected through hyperedge HE-5 (induced by source paper "autoreq expressing and verifying requirements for control systems"):
  with members:
    - "unifying requirements and code an example"
    - "autoproof auto active functional verification of object oriented programs"
    - "an ltl semantics of business workflows with recovery"
    - "flexible invariants through semantic collaboration"
    - "on modelling and analysis of dynamic reconfiguration of dependable real time systems"
    - "evolving algebras and partial evaluation"

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)