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: "sequentiality vs concurrency in games and logic"
  Abstract: Connections between the sequentialitysconcurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.

Connected through hyperedge HE-1 (induced by source paper "what s in a game a theory of game models"):
  with members:
    - "shapely monads and analytic functors"
    - "innocent strategies are sheaves over plays deterministic non deterministic and probabilistic innocence"
    - "full abstraction for fair testing in ccs expanded version"
    - "asynchronous games innocence without alternation"

Connected through hyperedge HE-2 (induced by source paper "fully abstract game semantics for actors"):
  with members:
    - "full abstraction for fair testing in ccs"
    - "games and full completeness for multiplicative linear logic"
    - "innocent strategies as presheaves and interactive equivalences for ccs"
    - "asynchronous games innocence without alternation"

Connected through hyperedge HE-3 (induced by source paper "a process algebra for games"):
  with members:
    - "semantics of interaction"
    - "games and full completeness for multiplicative linear logic"
    - "asynchronous games innocence without alternation"

Connected through hyperedge HE-4 (induced by source paper "focusing in asynchronous games"):
  with members:
    - "games and full completeness for multiplicative linear logic"
    - "asynchronous games innocence without alternation"

Connected through hyperedge HE-5 (induced by source paper "asynchronous games innocence without alternation"):
  with members:
    - "games and full completeness for multiplicative linear logic"

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)