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: "succinct representations for abstract interpretation"
  Abstract: Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and sparse representations of paths and sets of paths avoid this pitfall. We improve previously proposed techniques for guided static analysis and the generation of disjunctive invariants by combining them with techniques for succinct representations of paths and symbolic representations for transitions based on static single assignment. Because of the non-monotonicity of the results of abstract interpretation with widening operators, it is difficult to conclude that some abstraction is more precise than another based on theoretical local precision results. We thus conducted extensive comparisons between our new techniques and previous ones, on a variety of open-source packages.

Connected through hyperedge HE-1 (induced by source paper "a survey of satisfiability modulo theory"):
  with members:
    - "proof tree preserving interpolation"
    - "how to compute worst case execution time by optimization modulo theory and a clever encoding of program semantics"
    - "generating non linear interpolants by semidefinite programming"
    - "invariant generation through strategy iteration in succinctly represented control flow graphs"
    - "pagai a path sensitive static analyzer"
    - "optimization in smt with la q cost functions"
    - "on using floating point computations to help an exact linear arithmetic decision procedure"
    - "a quantifier elimination algorithm for linear real arithmetic"

Connected through hyperedge HE-2 (induced by source paper "efficiently intertwining widening and narrowing"):
  with members:
    - "pagai a path sensitive static analyzer"
    - "stratified static analysis based on variable dependencies"
    - "using bounded model checking to focus fixpoint iterations"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-3 (induced by source paper "an encoding of array verification problems into array free horn clauses"):
  with members:
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-4 (induced by source paper "invariant generation through strategy iteration in succinctly represented control flow graphs"):
  with members:
    - "optimization in smt with la q cost functions"
    - "numerical invariants through convex relaxation and max strategy iteration"
    - "using bounded model checking to focus fixpoint iterations"
    - "improving strategies via smt solving"
    - "automatic modular abstractions for template numerical constraints"
    - "the octagon abstract domain"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "pagai a path sensitive static analyzer"):
  with members:
    - "using bounded model checking to focus fixpoint iterations"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "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.PL(Programming Languages)