human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "inferring loop invariants by mutation dynamic analysis and static checking"):
  Abstract: Verifiers that can prove programs correct against their full functional specification require, for programs with loops, additional annotations in the form of  loop invariants —properties that hold for every iteration of a loop. We show that significant loop invariant candidates can be generated by systematically mutating postconditions; then, dynamic checking (based on automatically generated tests) weeds out invalid candidates, and static checking selects provably valid ones. We present a framework that automatically applies these techniques to support a program prover, paving the way for fully automatic verification without manually written loop invariants: Applied to 28 methods (including 39 different loops) from various  java.util  classes (occasionally modified to avoid using Java features not fully supported by the static checker), our DYNAMATE prototype automatically discharged 97 percent of all proof obligations, resulting in automatic complete correctness proofs of 25 out of the 28 methods—outperforming several state-of-the-art tools for fully automatic verification.

Includes members:
  Member "using dynamic analysis to generate disjunctive invariants":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimal assumptions refinement for gr 1 specifications")
  Member "flexible invariants through semantic collaboration":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "targeted synthesis for programming with data invariants")
  Member "loop invariants analysis classification and examples":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cln2inv learning loop invariants with continuous logic networks")
  Member "what good are strong specifications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "autoframe automatic frame inference for object oriented languages")
  Member "specifying reusable components":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "autoframe automatic frame inference for object oriented languages")
  Member "inferring loop invariants using postconditions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "autoframe automatic frame inference for object oriented languages")
  Member "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the deep learning compiler a comprehensive survey")
  Member "a static analyzer for large safety critical software":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "automatically proving microkernels free from privilege escalation from their executable")

Question: Please tell me which class the source paper 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)