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 "on the expressiveness of intensional communication"):
  Abstract: The expressiveness of communication primitives has been explored in a common framework based on the pi-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium (shared dataspaces vs channel-based), and pattern-matching (binding to a name vs testing name equality). Here pattern-matching is generalised to account for terms with internal structure such as in recent calculi like Spi calculi, Concurrent Pattern Calculus and Psi calculi. This paper explores intensionality upon terms, in particular communication primitives that can match upon both names and structures. By means of possibility/impossibility of encodings, this paper shows that intensionality alone can encode synchronism, arity, communication-medium, and pattern-matching, yet no combination of these without intensionality can encode any intensional language.

Includes members:
  Member "a concurrent pattern calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a formal approach to the engineering of domain specific distributed systems")
  Member "an intensional concurrent faithful encoding of turing machines":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the expressiveness of joining")
  Member "expressiveness via intensionality and concurrency":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a theory of encodings and expressiveness")
  Member "musings on encodings and expressiveness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "psi calculi a framework for mobile processes with nominal data and logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a formal approach to the engineering of domain specific distributed systems")
  Member "multiparty symmetric sum types":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "expressiveness via intensionality and concurrency")
  Member "formalising the pi calculus using nominal logic":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rule formats for nominal process calculi")
  Member "comparing the expressive power of the synchronous and asynchronous pi calculi":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "comparing process calculi using encodings")

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.LO(Logic in Computer Science)