human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "multiparty compatibility in communicating automata characterisation and synthesis of global session types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "verifying asynchronous interactions via communicating session automata")
  Member "using higher order contracts to model session types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "globally governed session semantics")
  Member "choreography synthesis as contract agreement":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "inferring types for parallel programs")
  Member "on the realizability of contracts in dishonest systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "combining behavioural types with security analysis")
  Member "contracts in distributed systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "choreography synthesis as contract agreement")
  Member "a finite equational base for ccs with left merge and communication merge":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unique parallel decomposition for the π calculus")

Question: Please tell me which class the source paper 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)