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: "on the expressiveness of single pass instruction sequences"
  Abstract: We perceive programs as single-pass instruction sequences. A single-pass instruction sequence under execution is considered to produce a behaviour to be controlled by some execution environment. Threads as considered in basic thread algebra model such behaviours. We show that all regular threads, i.e. threads that can only be in a finite number of states, can be produced by single-pass instruction sequences without jump instructions if use can be made of Boolean registers. We also show that, in the case where goto instructions are used instead of jump instructions, a bound to the number of labels restricts the expressiveness.

Connected through hyperedge HE-1 (induced by source paper "quantitative expressiveness of instruction sequence classes for computation on single bit registers"):
  with members:
    - "instruction sequences expressing multiplication algorithms"
    - "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"
    - "indirect jumps improve instruction sequence performance"
    - "instruction sequences with indirect jumps"

Connected through hyperedge HE-2 (induced by source paper "instruction sequences expressing multiplication algorithms"):
  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"
    - "long multiplication by instruction sequences with backward jump instructions"
    - "instruction sequence expressions for the secure hash algorithm sha 256"
    - "instruction sequence processing operators"
    - "indirect jumps improve instruction sequence performance"

Connected through hyperedge HE-3 (induced by source paper "bitcoin a money like informational commodity"):
  with members:
    - "the false premises and promises of bitcoin"
    - "questions related to bitcoin and other informational money"
    - "the unreasonable fundamental incertitudes behind bitcoin mining"
    - "bitcoin and beyond exclusively informational money"
    - "instruction sequence processing operators"
    - "information carriers and identification of information objects an ontological approach"
    - "informaticology combining computer science data science and fiction science"
    - "ologs a categorical framework for knowledge representation"

Connected through hyperedge HE-4 (induced by source paper "instruction sequence based non uniform complexity classes"):
  with members:
    - "instruction sequence processing operators"
    - "indirect jumps improve instruction sequence performance"
    - "an instruction sequence semigroup with involutive anti automorphisms"
    - "instruction sequences and non uniform complexity theory"

Connected through hyperedge HE-5 (induced by source paper "instruction sequence expressions for the secure hash algorithm sha 256"):
  with members:
    - "instruction sequences expressing multiplication algorithms"
    - "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"
    - "indirect jumps improve instruction sequence performance"
    - "an instruction sequence semigroup with involutive anti automorphisms"

Connected through hyperedge HE-6 (induced by source paper "instruction sequence expressions for the karatsuba multiplication algorithm"):
  with members:
    - "instruction sequence based non uniform complexity classes"
    - "instruction sequence processing operators"
    - "indirect jumps improve instruction sequence performance"
    - "an instruction sequence semigroup with involutive anti automorphisms"

Connected through hyperedge HE-7 (induced by source paper "from functions to object orientation by abstraction"):
  with members:
    - "a process calculus with finitary comprehended terms"
    - "instruction sequence processing operators"
    - "indirect jumps improve instruction sequence performance"
    - "concurrent models for object execution"
    - "communicating concurrent functions"
    - "concurrent models for function execution"
    - "thread algebra for poly threading"
    - "on object orientation"

Connected through hyperedge HE-8 (induced by source paper "instruction sequence processing operators"):
  with members:
    - "indirect jumps improve instruction sequence performance"
    - "on the behaviours produced by instruction sequences under execution"
    - "on the operating unit size of load store architectures"
    - "a thread calculus with molecular dynamics"
    - "functional units for natural numbers"
    - "an instruction sequence semigroup with involutive anti automorphisms"
    - "autosolvability of halting problem instances for instruction sequences"
    - "program algebra with a jump shift instruction"

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)