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 "exponential automatic amortized resource analysis"):
  Abstract: Automatic amortized resource analysis (AARA) is a type-based technique for inferring concrete (non-asymptotic) bounds on a program's resource usage. Existing work on AARA has focused on bounds that are polynomial in the sizes of the inputs. This paper presents and extension of AARA to exponential bounds that preserves the benefits of the technique, such as compositionality and efficient type inference based on linear constraint solving. A key idea is the use of the Stirling numbers of the second kind as the basis of potential functions, which play the same role as the binomial coefficients in polynomial AARA. To formalize the similarities with the existing analyses, the paper presents a general methodology for AARA that is instantiated to the polynomial version, the exponential version, and a combined system with potential functions that are formed by products of Stirling numbers and binomial coefficients. The soundness of exponential AARA is proved with respect to an operational cost semantics and the analysis of representative example programs demonstrates the effectiveness of the new analysis.

Includes members:
  Member "analysis of logarithmic amortised complexity":
    also connected through other hyperedges:
      (none)
  Member "verifying and synthesizing constant resource implementations with types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "revisiting and evaluating software side channel vulnerabilities and countermeasures in cryptographic applications")
  Member "bounded expectations resource analysis for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "work analysis with resource aware session types":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  Member "non polynomial worst case analysis of recursive programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "weakest precondition reasoning for expected run times of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "towards automatic resource bound analysis for ocaml":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  Member "denotational cost semantics for functional languages with inductive types":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "denotational semantics as a foundation for cost recurrence extraction for functional languages")

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)