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: "multiparty symmetric sum types"
  Abstract: This paper extends the multiparty asynchronous session types to symmetric sumtypes, which can type non-deterministic orchestration choice behaviours. While the original branching in the session types requires one participant to decide how to proceed by sending a label, with symmetric sumtypes the choice can be made in a non-deterministic way by synchronisation between the participants in a multiparty session. The motivation for synchronisation comes from natural and concise modelling of social interaction and cooperation in healthcare scenarios in the Process Matrix. The behaviour of synchronisation is represented by a new synchronise process constructor, which is typed by symmetric sumtypes. Finally we show that symmetric sumtypes can be erased into the original branching types with the help of conductor processes, preserving typability and operational semantics.

Connected through hyperedge HE-1 (induced by source paper "on the expressiveness of intensional communication"):
  with members:
    - "a concurrent pattern calculus"
    - "an intensional concurrent faithful encoding of turing machines"
    - "expressiveness via intensionality and concurrency"
    - "musings on encodings and expressiveness"
    - "psi calculi a framework for mobile processes with nominal data and logic"
    - "formalising the pi calculus using nominal logic"
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

Connected through hyperedge HE-2 (induced by source paper "expressiveness via intensionality and concurrency"):
  with members:
    - "a concurrent pattern calculus"
    - "an intensional concurrent faithful encoding of turing machines"
    - "musings on encodings and expressiveness"
    - "psi calculi a framework for mobile processes with nominal data and logic"
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

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.DC(Distributed, Parallel, and Cluster Computing)