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: "ccs it s not fair fair schedulers cannot be implemented in ccs like languages even under progress and certain fairness assumptions"
  Abstract: In the process algebra community it is sometimes suggested that, on some level of abstraction, any distributed system can be modelled in standard process-algebraic specification formalisms like CCS. This sentiment is strengthened by results testifying that CCS, like many similar formalisms, is Turing powerful and provides a mechanism for interaction. This paper counters that sentiment by presenting a simple fair scheduler---one that in suitable variations occurs in many distributed systems---of which no implementation can be expressed in CCS, unless CCS is enriched with a fairness assumption. #R##N#Since Dekker's and Peterson's mutual exclusion protocols implement fair schedulers, it follows that these protocols cannot be rendered correctly in CCS without imposing a fairness assumption. Peterson expressed this algorithm correctly in pseudocode without resorting to a fairness assumption, so it furthermore follows that CCS lacks the expressive power to accurately capture such pseudocode.

Connected through hyperedge HE-1 (induced by source paper "ensuring liveness properties of distributed systems open problems"):
  with members:
    - "progress justness and fairness"
    - "reward testing equivalences for processes"
    - "justness a completeness criterion for capturing liveness properties"
    - "analysing mutual exclusion using process algebra with signals"
    - "lean and full congruence formats for recursion"
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "progress fairness and justness in process algebra"
    - "a process algebra for wireless mesh networks"

Connected through hyperedge HE-2 (induced by source paper "progress justness and fairness"):
  with members:
    - "analysing mutual exclusion using process algebra with signals"
    - "progress fairness and justness in process algebra"
    - "a process algebra for wireless mesh networks"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "explicit fairness in testing semantics"

Connected through hyperedge HE-3 (induced by source paper "analysing mutual exclusion using process algebra with signals"):
  with members:
    - "progress fairness and justness in process algebra"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "automated analysis of mutex algorithms with fase"
    - "read operators and their expressiveness in process algebras"

Connected through hyperedge HE-4 (induced by source paper "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"):
  with members:
    - "progress fairness and justness in process algebra"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"

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)