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: "autoproof auto active functional verification of object oriented programs"
  Abstract: Auto-active verifiers provide a level of automation intermediate between fully automatic and interactive: users supply code with annotations as input while benefiting from a high level of automation in the back-end. This paper presents AutoProof, a state-of-the-art auto-active verifier for object-oriented sequential programs with complex functional specifications. AutoProof fully supports advanced object-oriented features and a powerful methodology for framing and class invariants, which make it applicable in practice to idiomatic objectoriented patterns. The paper focuses on describing AutoProof's interface, design, and implementation features, and demonstrates AutoProof's performance on a rich collection of benchmark problems. The results attest AutoProof's competitiveness among tools in its league on cutting-edge functional verification of object-oriented programs.

Connected through hyperedge HE-1 (induced by source paper "formality in software requirements"):
  with members:
    - "autoreq expressing and verifying requirements for control systems"
    - "a contract based method to specify stimulus response requirements"
    - "complete contracts through specification drivers"
    - "unifying requirements and code an example"
    - "reasoning about identifier spaces how to make chord correct"

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"
    - "flexible invariants through semantic collaboration"

Connected through hyperedge HE-3 (induced by source paper "object oriented requirements reusable understandable verifiable"):
  with members:
    - "expressing and verifying embedded software requirements"
    - "complete contracts through specification drivers"
    - "unifying requirements and code an example"

Connected through hyperedge HE-4 (induced by source paper "towards a broader acceptance of formal verification tools the role of education"):
  with members:
    - "the autoproof verifier usability by non experts and on standard code"

Connected through hyperedge HE-5 (induced by source paper "autoframe automatic frame inference for object oriented languages"):
  with members:
    - "autoalias automatic variable precision alias analysis for object oriented programs"
    - "what good are strong specifications"
    - "specifying reusable components"
    - "inferring loop invariants using postconditions"

Connected through hyperedge HE-6 (induced by source paper "robustness testing of intermediate verifiers"):
  with members:
    - "loop invariants analysis classification and examples"

Connected through hyperedge HE-7 (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"
    - "an ltl semantics of business workflows with recovery"
    - "flexible invariants through semantic collaboration"
    - "on modelling and analysis of dynamic reconfiguration of dependable real time systems"
    - "evolving algebras and partial evaluation"

Connected through hyperedge HE-8 (induced by source paper "the keymaera x proof ide concepts on usability in hybrid systems theorem proving"):
  with members:
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "a uniform substitution calculus for differential dynamic logic"
    - "the dafny integrated development environment"
    - "isabelle jedit a prover ide within the pide framework"
    - "understanding the learners actions when using mathematics learning tools"

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.LO(Logic in Computer Science)