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 usage analysis for the pi calculus"
  Abstract: We propose a type-based resource usage analysis for the π-calculus#N#extended with resource creation/access primitives. The goal of the resource#N#usage analysis is to statically check that a program accesses resources such as#N#files and memory in a valid manner. Our type system is an extension of previous#N#behavioral type systems for the π-calculus, and can guarantee the safety#N#property that no invalid access is performed, as well as the property that#N#necessary accesses (such as the close operation for a file) are eventually#N#performed unless the program diverges. A sound type inference algorithm for the#N#type system is also developed to free the programmer from the burden of writing#N#complex type annotations. Based on the algorithm, we have implemented a#N#prototype resource usage analyzer for the π-calculus. To the authors'#N#knowledge, ours is the first type-based resource usage analysis that deals with#N#an expressive concurrent language like the pi-calculus.

Connected through hyperedge HE-1 (induced by source paper "a calculus for modeling floating authorizations"):
  with members:
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "work analysis with resource aware session types"
    - "a typed model for dynamic authorizations"
    - "dynamic role authorization in multiparty conversations"
    - "hide and new in the pi calculus"

Connected through hyperedge HE-2 (induced by source paper "modular session types for objects"):
  with members:
    - "channels as objects in concurrent object oriented programming"

Connected through hyperedge HE-3 (induced by source paper "compositional reasoning for explicit resource management in channel based concurrency"):
  with members:
    - "permission based separation logic for message passing concurrency"
    - "a calculus for costed computations"

Connected through hyperedge HE-4 (induced by source paper "induction by coinduction and control operators in call by name"):
  with members:
    - "graph logics with rational relations"
    - "call by value and call by name dual calculi with inductive and coinductive types"
    - "relational parametricity and control"

Connected through hyperedge HE-5 (induced by source paper "predicting global usages of resources endowed with local policies"):
  with members:
    - "uniqueness typing for resource management in message passing concurrency"

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)