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: "flexible invariants through semantic collaboration"
  Abstract: Modular reasoning about class invariants is challenging in the presence of collaborating objects that need to maintain global consistency. This paper presents semantic collaboration: a novel methodology to specify and reason about class invariants of sequential object-oriented programs, which models dependencies between collaborating objects by semantic means. Combined with a simple ownership mechanism and useful default schemes, semantic collaboration achieves the flexibility necessary to reason about complicated inter-object dependencies but requires limited annotation burden when applied to standard specification patterns. The methodology is implemented in AutoProof, our program verifier for the Eiffel programming language but it is applicable to any language supporting some form of representation invariants. An evaluation on several challenge problems proposed in the literature demonstrates that it can handle a variety of idiomatic collaboration patterns, and is more widely applicable than the existing invariant methodologies.

Connected through hyperedge HE-1 (induced by source paper "targeted synthesis for programming with data invariants"):
  with members:
    - "neural sketch learning for conditional program generation"
    - "programmatic and direct manipulation together at last"
    - "enforcing information flow policies with type targeted program synthesis"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "program synthesis from polymorphic refinement types"

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"
    - "complete contracts through specification drivers"
    - "autoproof auto active functional verification of object oriented programs"

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

Connected through hyperedge HE-4 (induced by source paper "initial steps towards assessing the usability of a verification tool"):
  with members:
    - "autoproof auto active functional verification of object oriented programs"
    - "the autoproof verifier usability by non experts and on standard code"
    - "on modelling and analysis of dynamic reconfiguration of dependable real time systems"
    - "deriving specifications of dependable systems toward a method"

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

Connected through hyperedge HE-6 (induced by source paper "a contract based method to specify stimulus response requirements"):
  with members:
    - "autoproof auto active functional verification of object oriented programs"

Connected through hyperedge HE-7 (induced by source paper "class invariants concepts problems solutions"):
  with members:
    - "what good are strong specifications"
    - "steps towards a theory and calculus of aliasing"

Connected through hyperedge HE-8 (induced by source paper "complete contracts through specification drivers"):
  with members:
    - "unifying requirements and code an example"
    - "autoproof auto active functional verification of object oriented programs"

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)