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: "innocent strategies as presheaves and interactive equivalences for ccs"
  Abstract: Seeking a general framework for reasoning about and comparing programming languages, we derive a new view of Milner's CCS. We construct a category E of plays, and a subcategory V of views. We argue that presheaves on V adequately represent innocent strategies, in the sense of game semantics. We then equip innocent strategies with a simple notion of interaction. This results in an interpretation of CCS. #R##N#Based on this, we propose a notion of interactive equivalence for innocent strategies, which is close in spirit to Beffara's interpretation of testing equivalences in concurrency theory. In this framework we prove that the analogues of fair and must testing equivalences coincide, while they differ in the standard setting.

Connected through hyperedge HE-1 (induced by source paper "bisimulation maps in presheaf categories"):
  with members:
    - "an intensionally fully abstract sheaf model for pi expanded version"
    - "what s in a game a theory of game models"
    - "on path based coalgebras and weak notions of bisimulation"
    - "what are the fundamental structures of concurrency we still don t know"
    - "hierarchical states in the compositional interchange format"

Connected through hyperedge HE-2 (induced by source paper "an intensionally fully abstract sheaf model for pi expanded version"):
  with members:
    - "full abstraction for fair testing in ccs expanded version"
    - "full abstraction for fair testing in ccs"

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"
    - "independence and concurrent separation logic"
    - "asynchronous games innocence without alternation"

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

Connected through hyperedge HE-5 (induced by source paper "concurrent hyland ong games"):
  with members:
    - "fragments of ml decidable by nested data class memory automata"
    - "bounding linear head reduction and visible interaction through skeletons"
    - "on the relation of interaction semantics to continuations and defunctionalization"
    - "independence and concurrent separation logic"

Connected through hyperedge HE-6 (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"
    - "asynchronous games innocence without alternation"

Connected through hyperedge HE-7 (induced by source paper "innocent strategies are sheaves over plays deterministic non deterministic and probabilistic innocence"):
  with members:
    - "fully abstract concurrent games for pi"

Connected through hyperedge HE-8 (induced by source paper "full abstraction for fair testing in ccs"):
  with members:
    - "cartesian closed 2 categories and permutation equivalence in higher order rewriting"
    - "initiality for typed syntax and semantics"
    - "explicit fairness in testing semantics"

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)