human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "loop summarization with rational vector addition systems extended version"):
  Abstract: This paper presents a technique for computing numerical loop summaries. The method synthesizes a rational vector addition system with resets (Q-VASR) that simulates the action of an input loop, and then uses the reachability relation of that Q-VASR to over-approximate the behavior of the loop. The key technical problem solved in this paper is to automatically synthesize a Q-VASR that is a best abstraction of a given loop in the sense that (1) it simulates the loop and (2) it is simulated by any other Q-VASR that simulates the loop. Since our loop summarization scheme is based on computing the exact reachability relation of a best abstraction of a loop, we can make theoretical guarantees about its behavior. Moreover, we show experimentally that the technique is precise and performant in practice.

Includes members:
  Member "invariant generation for multi path loops with polynomial assignments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polynomial invariants for affine programs")
  Member "polynomial invariants for affine programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tight polynomial worst case bounds for loop programs")
  Member "approaching the coverability problem continuously":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "continuous reachability for unordered data petri nets is in ptime")
  Member "integer vector addition systems with states":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on affine reachability problems")
  Member "a simple and scalable static analysis for bound analysis and amortized complexity analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "a quantifier elimination algorithm for linear real arithmetic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey of satisfiability modulo theory")

Question: Please tell me which class the source paper 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)