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: "inferring loop invariants using postconditions"
  Abstract: One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, also known as its contract); the present work takes advantage of this observation by using the postcondition as the basis for invariant inference, using various heuristics such as "uncoupling" which prove useful in many important algorithms. Thanks to these heuristics, the technique is able to infer invariants for a large variety of loop examples. We present the theory behind the technique, its implementation (freely available for download and currently relying on Microsoft Research's Boogie tool), and the results obtained.

Connected through hyperedge HE-1 (induced by source paper "autoframe automatic frame inference for object oriented languages"):
  with members:
    - "autoalias automatic variable precision alias analysis for object oriented programs"
    - "autoproof auto active functional verification of object oriented programs"
    - "what good are strong specifications"
    - "specifying reusable components"

Connected through hyperedge HE-2 (induced by source paper "kleene algebra modulo theories"):
  with members:
    - "event driven network programming"
    - "snap stateful network wide abstractions for packet processing"
    - "comparing weakest precondition and weakest liberal precondition"
    - "a fast compiler for netkat"
    - "symbolic algorithms for language equivalence and kleene algebra with tests"

Connected through hyperedge HE-3 (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"
    - "loop invariants analysis classification and examples"
    - "what good are strong specifications"
    - "specifying reusable components"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "loop invariants analysis classification and examples"):
  with members:
    - "stateful testing finding more errors in code and contracts"
    - "reducing the number of annotations in a verification oriented imperative language"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "verifying eiffel programs with boogie"):
  with members:
    - "specifying reusable components"

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)