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: "integrating testing and interactive theorem proving"
  Abstract: Using an interactive theorem prover to reason about programs involves a sequence of interactions where the user challenges the theorem prover with conjectures. Invariably, many of the conjectures posed are in fact false, and users often spend considerable effort examining the theorem prover's output before realizing this. We present a synergistic integration of testing with theorem proving, implemented in the ACL2 Sedan (ACL2s), for automatically generating concrete counterexamples. Our method uses the full power of the theorem prover and associated libraries to simplify conjectures; this simplification can transform conjectures for which finding counterexamples is hard into conjectures where finding counterexamples is trivial. In fact, our approach even leads to better theorem proving, e.g. if testing shows that a generalization step leads to a false conjecture, we force the theorem prover to backtrack, allowing it to pursue more fruitful options that may yield a proof. The focus of the paper is on the engineering of a synergistic integration of testing with interactive theorem proving; this includes extending ACL2 with new functionality that we expect to be of general interest. We also discuss our experience in using ACL2s to teach freshman students how to reason about their programs.

Connected through hyperedge HE-1 (induced by source paper "from lcf to isabelle hol"):
  with members:
    - "deciding univariate polynomial problems using untrusted certificates in isabelle hol"
    - "interaction with formal mathematical documents in isabelle pide"
    - "computational logic its origins and applications"
    - "verifying strong eventual consistency in distributed systems"
    - "read eval print in parallel and asynchronous proof checking"
    - "a formally verified compiler back end"
    - "natural deduction as higher order resolution"
    - "the foundation of a generic theorem prover"

Connected through hyperedge HE-2 (induced by source paper "computer assisted proving of combinatorial conjectures over finite domains a case study of a chess conjecture"):
  with members:
    - "extending acl2 with smt solvers"
    - "ursa a system for uniform reduction to sat"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-3 (induced by source paper "beginner s luck a language for property based generators"):
  with members:
    - "testing noninterference quickly"
    - "type targeted testing"
    - "balancing scalability and uniformity in sat witness generator"
    - "church a language for generative models"

Connected through hyperedge HE-4 (induced by source paper "dynamic witnesses for static type errors or ill typed programs usually go wrong"):
  with members:
    - "dynamic witnesses for static type errors"
    - "on practical smt based type error localization"
    - "type targeted testing"

Connected through hyperedge HE-5 (induced by source paper "your proof fails testing helps to find the reason"):
  with members:
    - "the dafny integrated development environment"

Connected through hyperedge HE-6 (induced by source paper "acl2 ml machine learning for acl2"):
  with members:
    - "proof pattern recognition and lemma discovery in acl2"

Connected through hyperedge HE-7 (induced by source paper "data definitions in the acl2 sedan"):
  with members:
    - "enhancements to acl2 in versions 5 0 6 0 and 6 1"

Connected through hyperedge HE-8 (induced by source paper "proof pad a new development environment for acl2"):
  with members:
    - "how computers work computational thinking for everyone"

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)