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: "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.

Connected through hyperedge HE-1 (induced by source paper "program algebra for turing machine programs"):
  with members:
    - "on the complexity of the correctness problem for non zeroness test instruction sequences"
    - "a short introduction to program algebra with instructions for boolean registers"
    - "instruction sequence size complexity of parity"
    - "on algorithmic equivalence of instruction sequences for computing bit string functions"
    - "instruction sequence based non uniform complexity classes"
    - "instruction sequence expressions for the secure hash algorithm sha 256"
    - "instruction sequence processing operators"

Connected through hyperedge HE-2 (induced by source paper "quantitative expressiveness of instruction sequence classes for computation on single bit registers"):
  with members:
    - "a short introduction to program algebra with instructions for boolean registers"
    - "on instruction sets for boolean registers in program algebra"
    - "instruction sequence based non uniform complexity classes"
    - "on the expressiveness of single pass instruction sequences"
    - "indirect jumps improve instruction sequence performance"
    - "instruction sequences with indirect jumps"

Connected through hyperedge HE-3 (induced by source paper "a hoare like logic of asserted single pass instruction sequences"):
  with members:
    - "on instruction sets for boolean registers in program algebra"
    - "instruction sequence based non uniform complexity classes"
    - "instruction sequence expressions for the karatsuba multiplication algorithm"
    - "instruction sequence processing operators"
    - "program algebra with a jump shift instruction"

Connected through hyperedge HE-4 (induced by source paper "on algorithmic equivalence of instruction sequences for computing bit string functions"):
  with members:
    - "instruction sequence based non uniform complexity classes"
    - "instruction sequence expressions for the karatsuba multiplication algorithm"
    - "long multiplication by instruction sequences with backward jump instructions"
    - "instruction sequence expressions for the secure hash algorithm sha 256"
    - "instruction sequence processing operators"
    - "program algebra with a jump shift instruction"
    - "when are two algorithms the same"

Connected through hyperedge HE-5 (induced by source paper "instruction sequence expressions for the secure hash algorithm sha 256"):
  with members:
    - "instruction sequence size complexity of parity"
    - "on algorithmic equivalence of instruction sequences for computing bit string functions"
    - "instruction sequence based non uniform complexity classes"
    - "instruction sequence expressions for the karatsuba multiplication algorithm"
    - "instruction sequence processing operators"
    - "on the expressiveness of single pass instruction sequences"
    - "indirect jumps improve instruction sequence performance"
    - "an instruction sequence semigroup with involutive anti automorphisms"

Connected through hyperedge HE-6 (induced by source paper "long multiplication by instruction sequences with backward jump instructions"):
  with members:
    - "on algorithmic equivalence of instruction sequences for computing bit string functions"
    - "instruction sequence based non uniform complexity classes"
    - "instruction sequence expressions for the secure hash algorithm sha 256"
    - "instruction sequence processing operators"
    - "on the contribution of backward jumps to instruction sequence expressiveness"
    - "an instruction sequence semigroup with involutive anti automorphisms"
    - "when are two algorithms the same"

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