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: "honesty by typing"
  Abstract: We propose a type system for a calculus of contracting processes. Processes can establish sessions by stipulating contracts, and then can interact either by keeping the promises made, or not. Type safety guarantees that a typeable process is honest - that is, it abides by the contracts it has stipulated in all possible contexts, even in presence of dishonest adversaries. Type inference is decidable, and it allows to safely approximate the honesty of processes using either synchronous or asynchronous communication.

Connected through hyperedge HE-1 (induced by source paper "timed session types"):
  with members:
    - "combining behavioural types with security analysis"
    - "timed runtime monitoring for multiparty conversations"
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"

Connected through hyperedge HE-2 (induced by source paper "tool supported analysis of iot"):
  with members:
    - "a step towards checking security in iot"
    - "tracing where iot data are collected and aggregated"

Connected through hyperedge HE-3 (induced by source paper "combining behavioural types with security analysis"):
  with members:
    - "information flow safety in multiparty sessions"
    - "dynamic role authorization in multiparty conversations"
    - "self adaptation and secure information flow in multiparty structured communications a unified perspective"
    - "on the realizability of contracts in dishonest systems"
    - "linearly refined session types"

Connected through hyperedge HE-4 (induced by source paper "from orchestration to choreography through contract automata"):
  with members:
    - "on the realizability of contracts in dishonest systems"

Connected through hyperedge HE-5 (induced by source paper "choreography synthesis as contract agreement"):
  with members:
    - "on global types and multi party session"
    - "on the realizability of contracts in dishonest systems"
    - "contracts in distributed systems"

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)