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: "proof nets coends and the yoneda isomorphism"
  Abstract: Proof nets provide permutation-independent representations of proofs and are used to investigate coherence problems for monoidal categories. We investigate a coherence problem concerning Second Order Multiplicative Linear Logic MLL2, that is, the one of characterizing the equivalence over proofs generated by the interpretation of quantifiers by means of ends and coends. We provide a compact representation of proof nets for a fragment of MLL2 related to the Yoneda isomorphism. By adapting the "rewiring approach" used in coherence results for *-autonomous categories, we define an equivalence relation over proof nets called "rewitnessing". We prove that this relation characterizes, in this fragment, the equivalence generated by coends.

Connected through hyperedge HE-1 (induced by source paper "intersection type distributors"):
  with members:
    - "normalization taylor expansion and rigid approximation of λ terms"
    - "the bang calculus and the two girard s translations"
    - "a semantic account of strong normalization in linear logic"

Connected through hyperedge HE-2 (induced by source paper "polymorphism and the free bicartesian closed category"):
  with members:
    - "impredicative encodings of higher inductive types"
    - "logical step indexed logical relations"

Connected through hyperedge HE-3 (induced by source paper "proving properties of polymorphic programs using type isomorphisms with the yoneda lemma"):
  with members:
    - "impredicative encodings of higher inductive types"
    - "deciding equivalence with sums and the empty type"

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)