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: "an algebra of synchronous atomic steps"
  Abstract: This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave) when composed in parallel. The algebra of rely/guarantee concurrency then becomes an interpretation of the more abstract algebra. Many of the core properties needed for rely/guarantee reasoning can be shown to hold in the abstract algebra where their proofs are simpler and hence allow a higher degree of automation. Moreover, the realisation that the synchronisation mechanisms of standard process algebras, such as CSP and CCS/SCCS, can be interpreted in our abstract algebra gives evidence of its unifying power. The algebra has been encoded in Isabelle/HOL to provide a basis for tool support.

Connected through hyperedge HE-1 (induced by source paper "completeness and incompleteness of synchronous kleene algebra"):
  with members:
    - "kleene algebra with observations"
    - "completeness theorems for pomset languages and concurrent kleene algebras"
    - "concurrent kleene algebra free model and completeness"
    - "a synchronous program algebra a basis for reasoning about shared memory and event based concurrency"
    - "generalised rely guarantee concurrency an algebraic foundation"

Connected through hyperedge HE-2 (induced by source paper "handling localisation in rely guarantee concurrency an algebraic approach"):
  with members:
    - "a synchronous program algebra a basis for reasoning about shared memory and event based concurrency"

Connected through hyperedge HE-3 (induced by source paper "some challenges of specifying concurrent program components"):
  with members:
    - "a synchronous program algebra a basis for reasoning about shared memory and event based concurrency"
    - "designing a semantic model for a wide spectrum language with concurrency"
    - "generalised rely guarantee concurrency an algebraic foundation"

Connected through hyperedge HE-4 (induced by source paper "unifying theories of reactive design contracts"):
  with members:
    - "unifying theories of time with generalised reactive processes"
    - "designing a semantic model for a wide spectrum language with concurrency"
    - "generalised rely guarantee concurrency an algebraic foundation"

Connected through hyperedge HE-5 (induced by source paper "a synchronous program algebra a basis for reasoning about shared memory and event based concurrency"):
  with members:
    - "possible values exploring a concept for concurrency"
    - "designing a semantic model for a wide spectrum language with concurrency"
    - "generalised rely guarantee concurrency an algebraic foundation"

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)