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: "accelerated data flow analysis"
  Abstract: Acceleration in symbolic verification consists in computing the exact effect of some control-flow loops in order to speed up the iterative fix-point computation of reachable states. Even if no termination guarantee is provided in theory, successful results were obtained in practice by different tools implementing this framework. In this paper, the acceleration framework is extended to data-flow analysis. Compared to a classical widening/narrowing-based abstract interpretation, the loss of precision is controlled here by the choice of the abstract domain and does not depend on the way the abstract value is computed. Our approach is geared towards precision, but we don't loose efficiency on the way. Indeed, we provide a cubic-time acceleration-based algorithm for solving interval constraints with full multiplication.

Connected through hyperedge HE-1 (induced by source paper "transfer function synthesis without quantifier elimination"):
  with members:
    - "automatic modular abstractions for template numerical constraints"
    - "automatic modular abstractions for linear constraints"
    - "logic programming with satisfiability"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-2 (induced by source paper "improving strategies via smt solving"):
  with members:
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"
    - "a quantifier elimination algorithm for linear real arithmetic"
    - "automatic modular abstractions for linear constraints"
    - "a new numerical abstract domain based on difference bound matrices"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-3 (induced by source paper "automatic modular abstractions for template numerical constraints"):
  with members:
    - "a quantifier elimination algorithm for linear real arithmetic"
    - "the pitfalls of verifying floating point computations"
    - "automatic modular abstractions for linear constraints"
    - "relational abstract domains for the detection of floating point run time errors"
    - "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-4 (induced by source paper "abstract fixpoint computations with numerical acceleration methods"):
  with members:
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "interprocedural dataflow analysis over weight domains with infinite descending chains"):
  with members:
    - "formal properties of xml grammars and languages"

Connected through hyperedge HE-6 (induced by source paper "convex hull of arithmetic automata"):
  with members:
    - "the convex hull of a regular set of integer vectors is polyhedral and effectively computable"

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.DS(Data Structures and Algorithms)