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 "quantitative expressiveness of instruction sequence classes for computation on single bit registers"):
  Abstract: The number of instructions of an instruction sequence is taken for its logical SLOC, and is abbreviated with LLOC. A notion of quantitative expressiveness is based on LLOC and in the special case of operation over a family of single bit registers a collection of elementary properties are established. A dedicated notion of interface is developed and is used for stating relevant properties of classes of instruction sequences

Includes members:
  Member "instruction sequences expressing multiplication algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "program algebra for turing machine programs")
  Member "a short introduction to program algebra with instructions for boolean registers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "on the complexity of the correctness problem for non zeroness test instruction sequences")
  Member "instruction sequence based non uniform complexity classes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the complexity of the correctness problem for non zeroness test instruction sequences")
  Member "on the expressiveness of single pass instruction sequences":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "instruction sequences expressing multiplication algorithms")
  Member "indirect jumps improve instruction sequence performance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "instruction sequences expressing multiplication algorithms")
  Member "instruction sequences with indirect jumps":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a process calculus with finitary comprehended terms")

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.PL(Programming Languages)