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: "loop invariants analysis classification and examples"
  Abstract: Software verification has emerged as a key concern for ensuring the continued progress of information technology. Full verification generally requires, as a crucial step, equipping each loop with a “loop invariant.” Beyond their role in verification, loop invariants help program understanding by providing fundamental insights into the nature of algorithms. In practice, finding sound and useful invariants remains a challenge. Fortunately, many invariants seem intuitively to exhibit a common flavor. Understanding these fundamental invariant patterns could therefore provide help for understanding and verifying a large variety of programs.   We performed a systematic identification, validation, and classification of loop invariants over a range of fundamental algorithms from diverse areas of computer science. This article analyzes the patterns, as uncovered in this study, governing how invariants are derived from postconditions; it proposes a taxonomy of invariants according to these patterns; and it presents its application to the algorithms reviewed. The discussion also shows the need for high-level specifications based on “domain theory.” It describes how the invariants and the corresponding algorithms have been mechanically verified using an automated program prover; the proof source files are available. The contributions also include suggestions for invariant inference and for model-based specification.

Connected through hyperedge HE-1 (induced by source paper "cln2inv learning loop invariants with continuous logic networks"):
  with members:
    - "guiding high performance sat solvers with unsat core predictions"
    - "inductive logic programming via differentiable deep neural logic networks"
    - "learning a sat solver from single bit supervision"
    - "learning explanatory rules from noisy data"
    - "inferring loop invariants by mutation dynamic analysis and static checking"
    - "adam a method for stochastic optimization"

Connected through hyperedge HE-2 (induced by source paper "robustness testing of intermediate verifiers"):
  with members:
    - "autoproof auto active functional verification of object oriented programs"

Connected through hyperedge HE-3 (induced by source paper "a survey of symbolic execution techniques"):
  with members:
    - "enhancing reuse of constraint solutions to improve symbolic execution"
    - "inferring loop invariants by mutation dynamic analysis and static checking"
    - "compact symbolic execution"

Connected through hyperedge HE-4 (induced by source paper "why just boogie translating between intermediate verification languages"):
  with members:
    - "autoproof auto active functional verification of object oriented programs"
    - "rotation of sequences algorithms and proofs"
    - "c to o o translation beyond the easy stuff"

Connected through hyperedge HE-5 (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"
    - "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)