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: "a type reduction theory for systems with replicated components"
  Abstract: The Parameterised Model Checking Problem asks whether an implementation#N#Impl(t) satisfies a specification Spec(t) for all instantiations of parameter#N#t. In general, t can determine numerous entities: the number of processes used#N#in a network, the type of data, the capacities of buffers, etc. The main theme#N#of this paper is automation of uniform verification of a subclass of PMCP with#N#the parameter of the first kind, i.e. the number of processes in the network.#N#We use CSP as our formalism. We present a type reduction theory, which, for a#N#given verification problem, establishes a function \phi that maps all#N#(sufficiently large) instantiations T of the parameter to some fixed type T^#N#and allows us to deduce that if Spec(T^) is refined by \phi(Impl(T)), then#N#(subject to certain assumptions) Spec(T) is refined by Impl(T). The theory can#N#be used in practice by combining it with a suitable abstraction method that#N#produces a t-independent process Abstr that is refined by {\phi}(Impl(T)) for#N#all sufficiently large T. Then, by testing (with a model checker) if the#N#abstract model Abstr refines Spec(T^), we can deduce a positive answer to the#N#original uniform verification problem. The type reduction theory relies on#N#symbolic representation of process behaviour. We develop a symbolic operational#N#semantics for CSP processes that satisfy certain normality requirements, and we#N#provide a set of translation rules that allow us to concretise symbolic#N#transition graphs. Based on this, we prove results that allow us to infer#N#behaviours of a process instantiated with uncollapsed types from known#N#behaviours of the same process instantiated with a reduced type. One of the#N#main advantages of our symbolic operational semantics and the type reduction#N#theory is their generality, which makes them applicable in a wide range of#N#settings.

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)