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: "asynchronous games innocence without alternation"
  Abstract: The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of lambda-terms and PCF programs. An innocent strategy is defined as an alternating strategy with partial memory, in which the strategy plays according to its view. Extending the definition to non-alternating strategies is problematic, because the traditional definition of views is based on the hypothesis that Opponent and Proponent alternate during the interaction. Here, we take advantage of the diagrammatic reformulation of alternating innocence in asynchronous games, in order to provide a tentative definition of innocence in non-alternating games. The task is interesting, and far from easy. It requires the combination of true concurrency and game semantics in a clean and organic way, clarifying the relationship between asynchronous games and concurrent games in the sense of Abramsky and Melli\`es. It also requires an interactive reformulation of the usual acyclicity criterion of linear logic, as well as a directed variant, as a scheduling criterion.

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"
    - "sequentiality vs concurrency in games and logic"

Connected through hyperedge HE-2 (induced by source paper "presenting finite posets"):
  with members:
    - "towards 3 dimensional rewriting theory"
    - "the structure of first order causality"
    - "a non standard semantics for kahn networks in continuous time"
    - "the structure of first order causality"

Connected through hyperedge HE-3 (induced by source paper "thin games with symmetry and concurrent hyland ong games"):
  with members:
    - "parallelism and synchronization in an infinitary context long version"
    - "fragments of ml decidable by nested data class memory automata"
    - "bounding linear head reduction and visible interaction through skeletons"
    - "infinite state energy games"
    - "on the relation of interaction semantics to continuations and defunctionalization"
    - "game semantics for access control"
    - "innocent strategies as presheaves and interactive equivalences for ccs"
    - "independence and concurrent separation logic"

Connected through hyperedge HE-4 (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"
    - "sequentiality vs concurrency in games and logic"

Connected through hyperedge HE-5 (induced by source paper "full abstraction for fair testing in ccs expanded version"):
  with members:
    - "concurrent hyland ong games"
    - "initiality for typed syntax and semantics"
    - "innocent strategies as presheaves and interactive equivalences for ccs"

Connected through hyperedge HE-6 (induced by source paper "a process algebra for games"):
  with members:
    - "semantics of interaction"
    - "games and full completeness for multiplicative linear logic"
    - "sequentiality vs concurrency in games and logic"

Connected through hyperedge HE-7 (induced by source paper "the structure of first order causality"):
  with members:
    - "computing critical pairs in 2 dimensional rewriting systems"

Connected through hyperedge HE-8 (induced by source paper "a non standard semantics for kahn networks in continuous time"):
  with members:
    - "computing critical pairs in 2 dimensional rewriting systems"

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)