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: "specifying reusable components"
  Abstract: Reusable software components need expressive specifications. This paper outlines a rigorous foundation of model-based contracts, a method to equip classes with strong contracts that support accurate design, implementation, and formal verification of reusable components. Model-based contracts conservatively extend the classic Design by Contract approach with a notion of model, which underpins the precise definitions of such concepts as abstract object equivalence and specification completeness. Experiments applying model-based contracts to libraries of data structures suggest that the method enables accurate specification of practical software.

Connected through hyperedge HE-1 (induced by source paper "autoframe automatic frame inference for object oriented languages"):
  with members:
    - "autoalias automatic variable precision alias analysis for object oriented programs"
    - "autoproof auto active functional verification of object oriented programs"
    - "what good are strong specifications"
    - "inferring loop invariants using postconditions"

Connected through hyperedge HE-2 (induced by source paper "usability of autoproof a case study of software verification"):
  with members:
    - "code generation for event b"
    - "autoproof auto active functional verification of object oriented programs"
    - "deriving specifications of dependable systems toward a method"

Connected through hyperedge HE-3 (induced by source paper "inferring loop invariants by mutation dynamic analysis and static checking"):
  with members:
    - "using dynamic analysis to generate disjunctive invariants"
    - "flexible invariants through semantic collaboration"
    - "loop invariants analysis classification and examples"
    - "what good are strong specifications"
    - "inferring loop invariants using postconditions"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-4 (induced by source paper "autoproof auto active functional verification of object oriented programs"):
  with members:
    - "the autoproof verifier usability by non experts and on standard code"
    - "efficient and reasonable object oriented concurrency"
    - "flexible invariants through semantic collaboration"
    - "rotation of sequences algorithms and proofs"

Connected through hyperedge HE-5 (induced by source paper "the autoproof verifier usability by non experts and on standard code"):
  with members:
    - "autoproof auto active functional verification of object oriented programs"
    - "teaching formal methods and discrete mathematics"
    - "flexible invariants through semantic collaboration"

Connected through hyperedge HE-6 (induced by source paper "automated fixing of programs with contracts"):
  with members:
    - "contracts in practice"
    - "what good are strong specifications"
    - "code based automated program fixing"

Connected through hyperedge HE-7 (induced by source paper "what good are strong specifications"):
  with members:
    - "guiding a general purpose c verifier to prove cryptographic protocols"
    - "stateful testing finding more errors in code and contracts"

Connected through hyperedge HE-8 (induced by source paper "towards a calculus of object programs"):
  with members:
    - "verifying eiffel programs with boogie"

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)