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 "instruction sequences expressing multiplication algorithms"):
  Abstract: For each function on bit strings, its restriction to bit strings of any given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We describe instruction sequences of this kind that compute the function on bit strings that models multiplication on natural numbers less than 2N with respect to their binary representation by bit strings of length N, for a fixed but arbitrary N > 0, according to the long multiplication algorithm and the Karatsuba multiplication algorithm. One of the results obtained is that the instruction sequence expressing the former algorithm is longer than the one expressing the latter algorithm only if the length of the bit strings involved is greater than 28. We also go into the use of an instruction sequence with backward jump instructions for expressing the long multiplication algorithm. This leads to an instruction sequence that it is shorter than the other two if the length of the bit strings involved is greater than 2.

Includes members:
  Member "instruction sequence size complexity of parity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of the correctness problem for non zeroness test instruction sequences")
  Member "on algorithmic equivalence of instruction sequences for computing bit string functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "on the complexity of the correctness problem for non zeroness test instruction sequences")
  Member "instruction sequence expressions for the karatsuba multiplication algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a hoare like logic of asserted single pass instruction sequences")
  Member "long multiplication by instruction sequences with backward jump instructions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "instruction sequence size complexity of parity")
  Member "instruction sequence expressions for the secure hash algorithm sha 256":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "program algebra for turing machine programs")
  Member "instruction sequence processing operators":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "program algebra for turing machine programs")
  Member "on the expressiveness of single pass instruction sequences":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "quantitative expressiveness of instruction sequence classes for computation on single bit registers")

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)