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: "hide and new in the pi calculus"
  Abstract: In this paper, we enrich the pi-calculus with an operator for confidentiality (hide), whose main effect is to restrict the access to the object of the communication, thus representing confidentiality in a natural way. The hide operator is meant for local communication, and it differs from new in that it forbids the extrusion of the name and hence has a static scope. Consequently, a communication channel in the scope of a hide can be implemented as a dedicated channel, and it is more secure than one in the scope of a new. To emphasize the difference, we introduce a spy context that represents a side-channel attack and breaks some of the standard security equations for new. To formally reason on the security guarantees provided by the hide construct, we introduce an observational theory and establish stronger equivalences by relying on a proof technique based on bisimulation semantics.

Connected through hyperedge HE-1 (induced by source paper "the cpi calculus a model for confidential name passing"):
  with members:
    - "adding path functional dependencies to the guarded two variable fragment with counting"
    - "privacy by typing in the pi calculus"

Connected through hyperedge HE-2 (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"
    - "resource usage analysis for the pi calculus"

Connected through hyperedge HE-3 (induced by source paper "discovering quantifying and displaying attacks"):
  with members:
    - "dag based attack and defense modeling don t miss the forest for the attack trees"
    - "quantitative questions on attack defense trees"

Connected through hyperedge HE-4 (induced by source paper "a typed model for dynamic authorizations"):
  with members:
    - "dynamic role authorization in multiparty conversations"

Connected through hyperedge HE-5 (induced by source paper "dynamic role authorization in multiparty conversations"):
  with members:
    - "a typed model for dynamic authorizations"
    - "information flow safety in multiparty sessions"
    - "combining behavioural types with security analysis"

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)