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 "on the complexity of the correctness problem for non zeroness test instruction sequences"):
  Abstract: Abstract   This paper concerns the question to what extent it can be efficiently determined whether an arbitrary program correctly solves a given problem. This question is investigated with programs of a very simple form, namely instruction sequences, and a very simple problem, namely the non-zeroness test on natural numbers. The instruction sequences concerned are of a kind by which, for each    n  >  0   , each function from      {  0  ,  1  }    n      to    {  0  ,  1  }    can be computed. The established results include the time complexities of the problem of determining whether an arbitrary instruction sequence correctly implements the restriction to      {  0  ,  1  }    n      of the function from      {  0  ,  1  }    ⁎      to    {  0  ,  1  }    that models the non-zeroness test function, for    n  >  0   , under several restrictions on the arbitrary instruction sequence.

Includes members:
  Member "axioms for behavioural congruence of single pass instruction sequences":
    also connected through other hyperedges:
      (none)
  Member "instruction sequence size complexity of parity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "program algebra for turing machine programs")
  Member "on instruction sets for boolean registers in program algebra":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantitative expressiveness of instruction sequence classes for computation on single bit registers")
  Member "on algorithmic equivalence of instruction sequences for computing bit string functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "program algebra for turing machine programs")
  Member "instruction sequence based non uniform complexity classes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "program algebra for turing machine programs")

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)