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: "quantitative analysis of smart contracts"
  Abstract: Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of crypto-currency like Bitcoin). Hence, it is crucial that their implementation is bug-free. We identify the utility (or expected payoff) of interacting with such smart contracts as the basic and canonical quantitative property for such contracts. We present a framework for such quantitative analysis of smart contracts. Such a formal framework poses new and novel research challenges in programming languages, as it requires modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior and modeling utilities which are not specified as standard temporal properties such as safety and termination. While game-theoretic incentives have been analyzed in the security community, their analysis has been restricted to the very special case of stateless games. However, to analyze smart contracts, stateful analysis is required as it must account for the different program states of the protocol. Our main contributions are as follows: we present (i)~a simplified programming language for smart contracts; (ii)~an automatic translation of the programs to state-based games; (iii)~an abstraction-refinement approach to solve such games; and (iv)~experimental results on real-world-inspired smart contracts.

Connected through hyperedge HE-1 (induced by source paper "targeted greybox fuzzing with static lookahead analysis"):
  with members:
    - "v fuzz vulnerability oriented evolutionary fuzzing"
    - "harvey a greybox fuzzer for smart contracts"
    - "finding the greedy prodigal and suicidal contracts at scale"
    - "online detection of effectively callback free objects with applications to smart contracts"
    - "fairfuzz a targeted mutation strategy for increasing greybox fuzz testing coverage"
    - "evaluating fuzz testing"
    - "contractfuzzer fuzzing smart contracts for vulnerability detection"
    - "learning inputs in greybox fuzzing"

Connected through hyperedge HE-2 (induced by source paper "oracle supported dynamic exploit generation for smart contracts"):
  with members:
    - "precise attack synthesis for smart contracts"
    - "exploiting the laws of order in smart contracts"
    - "finding the greedy prodigal and suicidal contracts at scale"
    - "sereum protecting existing smart contracts against re entrancy attacks"
    - "evaluating fuzz testing"
    - "contractfuzzer fuzzing smart contracts for vulnerability detection"
    - "learning inputs in greybox fuzzing"
    - "towards safer smart contracts a survey of languages and verification methods"

Connected through hyperedge HE-3 (induced by source paper "harvey a greybox fuzzer for smart contracts"):
  with members:
    - "finding the greedy prodigal and suicidal contracts at scale"
    - "online detection of effectively callback free objects with applications to smart contracts"
    - "evaluating fuzz testing"
    - "contractfuzzer fuzzing smart contracts for vulnerability detection"
    - "vandal a scalable security analysis framework for smart contracts"
    - "angora efficient fuzzing by principled search"
    - "securify practical security analysis of smart contracts"
    - "a concurrent perspective on smart contracts"

Connected through hyperedge HE-4 (induced by source paper "determinacy in discrete bidding infinite duration games"):
  with members:
    - "all pay bidding games on graphs"
    - "concurrent games and semi random determinacy"
    - "infinite duration poorman bidding games"
    - "infinite duration bidding games"
    - "discrete all pay bidding games"
    - "first cycle games"
    - "on subgame perfection in quantitative reachability games"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-5 (induced by source paper "probabilistic smart contracts secure randomness on the blockchain"):
  with members:
    - "computational approaches for stochastic shortest path on succinct mdps"
    - "when can a distributed ledger replace a trusted third party"
    - "securify practical security analysis of smart contracts"
    - "ergodic mean payoff games for the analysis of attacks in crypto currencies"
    - "cantor meets scott semantic foundations for probabilistic networks"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "reasoning about recursive probabilistic programs"

Connected through hyperedge HE-6 (induced by source paper "bidding mechanisms in graph games"):
  with members:
    - "infinite duration poorman bidding games"
    - "infinite duration bidding games"
    - "robustness of structurally equivalent concurrent parity games"

Connected through hyperedge HE-7 (induced by source paper "ergodic mean payoff games for the analysis of attacks in crypto currencies"):
  with members:
    - "bitcoin s security model revisited"
    - "optimal selfish mining strategies in bitcoin"
    - "the complexity of ergodic mean payoff games"
    - "analysis of hashrate based double spending"
    - "the miner s dilemma"
    - "majority is not enough bitcoin mining is vulnerable"
    - "pareto curves for probabilistic model checking"
    - "analysis of bitcoin pooled mining reward systems"

Connected through hyperedge HE-8 (induced by source paper "infinite duration poorman bidding games"):
  with members:
    - "the efficiency of best response dynamics"
    - "all pay bidding games on graphs"
    - "determinacy in discrete bidding infinite duration games"
    - "infinite duration bidding games"
    - "bidding games and efficient allocations"
    - "optimizing scrip systems crashes altruists hoarders sybils and collusion"
    - "sequential auctions of identical items with budget constrained bidders"
    - "on subgame perfection in quantitative reachability games"

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)