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: "an instruction sequence semigroup with involutive anti automorphisms"
  Abstract: We introduce an algebra of instruction sequences by presenting a semigroup C in which programs can be represented without directional bias: in terms of the next instruction to be executed, C has both forward and backward instructions and a C-expression can be interpreted starting from any instruction. We provide equations for thread extraction, i.e., C's program semantics. Then we consider thread extraction compatible (anti-)homomorphisms and (anti-)automorphisms. Finally we discuss some expressiveness results.

Connected through hyperedge HE-1 (induced by source paper "instruction sequence based non uniform complexity classes"):
  with members:
    - "instruction sequence processing operators"
    - "on the expressiveness of single pass instruction sequences"
    - "indirect jumps improve instruction sequence performance"
    - "instruction sequences and non uniform complexity theory"

Connected through hyperedge HE-2 (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"
    - "on the expressiveness of single pass instruction sequences"
    - "indirect jumps improve instruction sequence performance"

Connected through hyperedge HE-3 (induced by source paper "long multiplication by instruction sequences with backward jump instructions"):
  with members:
    - "instruction sequences expressing multiplication algorithms"
    - "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"
    - "when are two algorithms the same"

Connected through hyperedge HE-4 (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"
    - "on the expressiveness of single pass instruction sequences"
    - "indirect jumps improve instruction sequence performance"

Connected through hyperedge HE-5 (induced by source paper "instruction sequence processing operators"):
  with members:
    - "on the expressiveness of single pass instruction sequences"
    - "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"
    - "autosolvability of halting problem instances for instruction sequences"
    - "program algebra with a jump shift instruction"

Connected through hyperedge HE-6 (induced by source paper "on the behaviours produced by instruction sequences under execution"):
  with members:
    - "instruction sequence processing operators"
    - "on the expressiveness of single pass instruction sequences"
    - "indirect jumps improve instruction sequence performance"
    - "on the operating unit size of load store architectures"
    - "a protocol for instruction stream processing"
    - "transmission protocols for instruction streams"
    - "program algebra with a jump shift instruction"
    - "instruction sequences and non uniform complexity theory"

Connected through hyperedge HE-7 (induced by source paper "putting instruction sequences into effect"):
  with members:
    - "instruction sequence processing operators"
    - "on the expressiveness of single pass instruction sequences"
    - "indirect jumps improve instruction sequence performance"
    - "searching publications on operating systems"
    - "on the contribution of backward jumps to instruction sequence expressiveness"
    - "searching publications on software testing"
    - "a progression ring for interfaces of instruction sequences threads and services"
    - "instruction sequences with dynamically instantiated instructions"

Connected through hyperedge HE-8 (induced by source paper "instruction sequence notations with probabilistic instructions"):
  with members:
    - "instruction sequence processing operators"
    - "on the expressiveness of single pass instruction sequences"
    - "an interface group for process components"
    - "instruction sequences with dynamically instantiated instructions"
    - "transmission protocols for instruction streams"
    - "square root meadows"
    - "tuplix calculus specifications of financial transfer networks"
    - "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)