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: "using dynamic analysis to generate disjunctive invariants"
  Abstract: Program invariants are important for defect detection, program verification, and program repair. However, existing techniques have limited support for important classes of invariants such as disjunctions, which express the semantics of conditional statements. We propose a method for generating disjunctive invariants over numerical domains, which are inexpressible using classical convex polyhedra. Using dynamic analysis and reformulating the problem in non-standard ``max-plus'' and ``min-plus'' algebras, our method constructs hulls over program trace points. Critically, we introduce and infer a weak class of such invariants that balances expressive power against the computational cost of generating nonconvex shapes in high dimensions.     Existing dynamic inference techniques often generate spurious invariants that fit some program traces but do not generalize. With the insight that generating dynamic invariants is easy, we propose to verify these invariants statically using k-inductive SMT theorem proving which allows us to validate invariants that are not classically inductive.     Results on difficult kernels involving nonlinear arithmetic and abstract arrays suggest that this hybrid approach efficiently generates and proves correct program invariants.

Connected through hyperedge HE-1 (induced by source paper "minimal assumptions refinement for gr 1 specifications"):
  with members:
    - "a weakness measure for gr 1 formulae"
    - "interpolation based gr 1 assumptions refinement"
    - "counter strategy guided refinement of gr 1 temporal logic specifications"
    - "redundancy in logic i cnf propositional formulae"

Connected through hyperedge HE-2 (induced by source paper "sling using dynamic analysis to infer program invariants in separation logic"):
  with members:
    - "syminfer inferring program invariants using symbolic states"
    - "automated lemma synthesis in symbolic heap separation logic"
    - "automated mutual explicit induction proof in separation logic"

Connected through hyperedge HE-3 (induced by source paper "syminfer inferring program invariants using symbolic states"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-4 (induced by source paper "comid context based multi invariant detection for monitoring cyber physical software"):
  with members:
    - "popular ensemble methods an empirical study"

Connected through hyperedge HE-5 (induced by source paper "synthesizing invariants by solving solvable loops"):
  with members:
    - "polynomial invariants by linear algebra"
    - "abstract acceleration of general linear loops"
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"

Connected through hyperedge HE-6 (induced by source paper "optimal learning of specifications from examples"):
  with members:
    - "on exact learning monotone dnf from membership queries"
    - "learning semantic string transformations from examples"

Connected through hyperedge HE-7 (induced by source paper "inferring loop invariants by mutation dynamic analysis and static checking"):
  with members:
    - "flexible invariants through semantic collaboration"
    - "loop invariants analysis classification and examples"
    - "what good are strong specifications"
    - "specifying reusable components"
    - "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"

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)