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: "resource aware session types for digital contracts"
  Abstract: Programming digital contracts comes with unique challenges, which include expressing and enforcing protocols of interaction, controlling resource usage, and tracking linear assets. This article presents the type-theoretic foundation of Nomos, a programming language for digital contracts whose type system addresses the aforementioned domain-specific requirements. To express and enforce protocols, Nomos is based on shared binary session types rooted in linear logic. To control resource usage, Nomos uses resource-aware session types and automatic amortized resource analysis, a type-based technique for inferring resource bounds. To track linear assets, Nomos employs a linear type system that prevents assets from being duplicated or discarded. The technical contribution is the design and soundness proof of Nomos' type system, which integrates shared session types and resource-aware session types with a functional type system that supports automatic amortized resource analysis. To evaluate Nomos' viability for digital contract development, we include a case study of several blockchain applications and demonstrate how their vulnerabilities do not arise in corresponding Nomos applications. In particular, Nomos ensures that synthetic tokens implement their technical standard and prevents vulnerabilities due to violations of linearity, out-of-gas exceptions, or dependence on transaction ordering. To evaluate Nomos' session-based design, we report on the performance of three digital contracts implemented in an existing prototype language.

Connected through hyperedge HE-1 (induced by source paper "session types with arithmetic refinements and their application to work analysis"):
  with members:
    - "resource guided program synthesis"
    - "a message passing interpretation of adjoint logic"
    - "circular proofs as session typed processes a local validity condition"
    - "label dependent session types"
    - "relational cost analysis for functional imperative programs"
    - "parallel complexity analysis with temporal session types"
    - "dependent session types"
    - "work analysis with resource aware session types"

Connected through hyperedge HE-2 (induced by source paper "renegotiation and recursion in bitcoin contracts"):
  with members:
    - "developing secure bitcoin contracts with bitml"
    - "zero collateral lotteries in bitcoin and ethereum"

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)