human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "proof equivalence in mll is pspace complete"):
  Abstract: MLL proof equivalence is the problem of deciding whether two proofs in#N#multiplicative linear logic are related by a series of inference permutations.#N#It is also known as the word problem for star-autonomous categories. Previous#N#work has shown the problem to be equivalent to a rewiring problem on proof#N#nets, which are not canonical for full MLL due to the presence of the two#N#units. Drawing from recent work on reconfiguration problems, in this paper it#N#is shown that MLL proof equivalence is PSPACE-complete, using a reduction from#N#Nondeterministic Constraint Logic. An important consequence of the result is#N#that the existence of a satisfactory notion of proof nets for MLL with units is#N#ruled out (under current complexity assumptions). The PSPACE-hardness result#N#extends to equivalence of normal forms in MELL without units, where the#N#weakening rule for the exponentials induces a similar rewiring problem.

Includes members:
  Member "from proof nets to the free autonomous category":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "proof nets coends and the yoneda isomorphism")
  Member "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games")

Question: Please tell me which class the source paper 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)