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: "on the realizability of contracts in dishonest systems"
  Abstract: We develop a theory of contracting systems, where behavioural contracts may be violated by dishonest participants after they have been agreed upon - unlike in traditional approaches based on behavioural types. We consider the contracts of \cite{CastagnaPadovaniGesbert09toplas}, and we embed them in a calculus that allows distributed participants to advertise contracts, reach agreements, query the fulfilment of contracts, and realise them (or choose not to). #R##N#Our contract theory makes explicit who is culpable at each step of a computation. A participant is honest in a given context S when she is not culpable in each possible interaction with S. Our main result is a sufficient criterion for classifying a participant as honest in all possible contexts.

Connected through hyperedge HE-1 (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"
    - "honesty by typing"
    - "linearly refined session types"

Connected through hyperedge HE-2 (induced by source paper "a note on two notions of compliance"):
  with members:
    - "loosening the notions of compliance and sub behaviour in client server systems"

Connected through hyperedge HE-3 (induced by source paper "from orchestration to choreography through contract automata"):
  with members:
    - "honesty by typing"

Connected through hyperedge HE-4 (induced by source paper "choreography synthesis as contract agreement"):
  with members:
    - "on global types and multi party session"
    - "honesty by typing"
    - "contracts in distributed systems"

Connected through hyperedge HE-5 (induced by source paper "honesty by typing"):
  with members:
    - "multiparty compatibility in communicating automata characterisation and synthesis of global session types"
    - "using higher order contracts to model session types"
    - "choreography synthesis as contract agreement"
    - "contracts in distributed systems"
    - "a finite equational base for ccs with left merge and communication merge"

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)