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: "priorities without priorities representing preemption in psi calculi"
  Abstract: Psi-calculi is a parametric framework for extensions of the pi-calculus with data terms and arbitrary logics. In this framework there is no direct way to represent action priorities, where an action can execute only if all other enabled actions have lower priorit y. We here demonstrate that the psi-calculi parameters can be chosen such that the effect of action priorities can be encoded. To accomplish this we define an extension of psi-calculi with action priorities, and show that for every calculus in the extended framework there is a corresponding ordinary psi-calculus, without priorities, and a translation between them that satisfies st rong operational correspondence. This is a significantly stronger result than for most encodings betwe en process calculi in the literature. We also formally prove in Nominal Isabelle that the standard congruence and structural laws about strong bisimulation hold in psi-calculi extended with priorities. Priorities in process calculi allow certain actions to take precedence over others. This is useful when modelling systems because it admits more fine-grained contr ol over the model’s behaviour. Phenomena that exhibit prioritised behaviour include eg. interrupts in operating systems, and exception handling in programming languages. In this paper we demonstrate how priorities can be represented in the psicalculi framework, by encoding them into the logical theory that determines how actions are generated by process syntax. Psi-calculi [3] is a family of applied process calculi that generalises the pi-calculus in three ways. First, the subjects (designating the communication channels) and objects (designating the communicated data) of input and output actions may be terms taken from an arbitrary set, and not just single names. Second, equality tests on names are replaced by tests of predicates called conditions, taken from an arbitrary logic. Finally, the process syntax is extended wi th assertions, which can be seen as introducing new facts about the environment in which a process executes. The unguarded assertions of a process influence the evaluation of conditions and the connectivity between channel terms, and can change as the process executes. In this paper, we show that the psi-framework is sufficiently expressive to represent action priorities derived from a priority order on the communication channels. We are interested in priorities for two reasons. First, previous work on priorities indicate th at they are highly expressive: Jeffrey defines a process calculus with time and priority where timed processes can be encoded in the untimed fragment of the calculus [15]; Jensen shows that CCS augmented with priority choice can encode broadcast communication [16]; and Versari et al. shows that CCS with priority and only the prefix and parallel operators can solve both leader election (unlike the pi-cal culus), and the “last man standing”-problem (unlike the broadcast pi-calculus) [23]. Second, we are not aware of another process calculus (without priorities) where adding priorities has been shown to yield no increased expressiveness. The prevailing

Connected through hyperedge HE-1 (induced by source paper "a theory of encodings and expressiveness"):
  with members:
    - "lean and full congruence formats for recursion"
    - "on the expressiveness of intensional communication"
    - "expressiveness via intensionality and concurrency"
    - "branching bisimilarity with explicit divergence"

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