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: "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
  Abstract: We present the first scalable bound analysis that achieves amortized complexity analysis. In contrast to earlier work, our bound analysis is not based on general purpose reasoners such as abstract interpreters, software model checkers or computer algebra tools. Rather, we derive bounds directly from abstract program models, which we obtain from programs by comparatively simple invariant generation and symbolic execution techniques. As a result, we obtain an analysis that is more predictable and more scalable than earlier approaches. Our experiments demonstrate that our analysis is fast and at the same time able to compute bounds for challenging loops in a large real-world benchmark. Technically, our approach is based on lossy vector addition systems (VASS). Our bound analysis first computes a lexicographic ranking function that proves the termination of a VASS, and then derives a bound from this ranking function. Our methodology achieves amortized analysis based on a new insight how lexicographic ranking functions can be used for bound analysis.

Connected through hyperedge HE-1 (induced by source paper "cost analysis of nondeterministic probabilistic programs"):
  with members:
    - "computational approaches for stochastic shortest path on succinct mdps"
    - "effective divergence analysis for linear recurrence sequences"
    - "ergodic mean payoff games for the analysis of attacks in crypto currencies"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "termination of nondeterministic recursive probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"

Connected through hyperedge HE-2 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism"):
  with members:
    - "reachability in vector addition systems is primitive recursive in fixed dimension"
    - "the reachability problem for petri nets is not elementary"
    - "efficient algorithms for asymptotic bounds on termination time in vass"
    - "perfect half space games"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "non polynomial worst case analysis of recursive programs"
    - "complexity hierarchies beyond elementary"

Connected through hyperedge HE-3 (induced by source paper "loop summarization with rational vector addition systems extended version"):
  with members:
    - "invariant generation for multi path loops with polynomial assignments"
    - "polynomial invariants for affine programs"
    - "approaching the coverability problem continuously"
    - "integer vector addition systems with states"
    - "a quantifier elimination algorithm for linear real arithmetic"

Connected through hyperedge HE-4 (induced by source paper "the polynomial complexity of vector addition systems with states"):
  with members:
    - "efficient algorithms for asymptotic bounds on termination time in vass"
    - "liveness of parameterized timed networks"
    - "difference constraints an adequate abstraction for complexity analysis of imperative programs"

Connected through hyperedge HE-5 (induced by source paper "resource analysis driven by conditional termination proofs"):
  with members:
    - "an iterative approach to precondition inference using constrained horn clauses"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"
    - "static analysis of energy consumption for llvm ir programs"

Connected through hyperedge HE-6 (induced by source paper "efficient algorithms for asymptotic bounds on termination time in vass"):
  with members:
    - "perfect half space games"
    - "complexity hierarchies beyond elementary"
    - "liveness of parameterized timed networks"
    - "demystifying reachability in vector addition systems"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "the complexity of multi mean payoff and multi energy games"
    - "hyperplane separation technique for multidimensional mean payoff games"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-7 (induced by source paper "relational cost analysis for functional imperative programs"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "bidirectional type checking for relational properties"
    - "automating induction for solving horn clauses"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "effect dependent transformations for concurrent programs"
    - "linear dependent types and relative completeness"
    - "abstract effects and proof relevant logical relations"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-8 (induced by source paper "automated amortised resource analysis for term rewrite systems"):
  with members:
    - "towards automatic resource bound analysis for ocaml"
    - "analysing the complexity of functional programs higher order meets first order long version"
    - "automated complexity analysis based on the dependency pair method"

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)