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 with dynamically instantiated instructions"
  Abstract: We study sequential programs that are instruction sequences with dynamically instantiated instructions. We define the meaning of such programs in two different ways. In either case, we give a translation by which each program with dynamically instantiated instructions is turned into a program without them that exhibits on execution the same behaviour by interaction with some service. The complexity of the translations differ considerably, whereas the services concerned are equally simple. However, the service concerned in the case of the simpler translation is far more powerful than the service concerned in the other case.

Connected through hyperedge HE-1 (induced by source paper "a process calculus with finitary comprehended terms"):
  with members:
    - "an interface group for process components"
    - "transmission protocols for instruction streams"
    - "the structure of finite meadows"
    - "tuplix calculus specifications of financial transfer networks"
    - "instruction sequences and non uniform complexity theory"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"

Connected through hyperedge HE-2 (induced by source paper "data linkage algebra data linkage dynamics and priority rewriting"):
  with members:
    - "data linkage dynamics with shedding"
    - "an interface group for process components"
    - "a thread calculus with molecular dynamics"
    - "programming an interpreter using molecular dynamics"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"
    - "instruction sequences with indirect jumps"

Connected through hyperedge HE-3 (induced by source paper "on the expressiveness of single pass instruction sequences"):
  with members:
    - "indirect jumps improve instruction sequence performance"
    - "an interface group for process components"
    - "autosolvability of halting problem instances for instruction sequences"
    - "tuplix calculus specifications of financial transfer networks"
    - "program algebra with a jump shift instruction"
    - "instruction sequences and non uniform complexity theory"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"

Connected through hyperedge HE-4 (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"
    - "machine structure oriented control code logic"

Connected through hyperedge HE-5 (induced by source paper "data linkage dynamics with shedding"):
  with members:
    - "data linkage algebra data linkage dynamics and priority rewriting"
    - "an interface group for process components"
    - "tuplix calculus specifications of financial transfer networks"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"
    - "instruction sequences with indirect jumps"
    - "heap reference analysis using access graphs"

Connected through hyperedge HE-6 (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"
    - "transmission protocols for instruction streams"
    - "square root meadows"
    - "an instruction sequence semigroup with involutive anti automorphisms"
    - "tuplix calculus specifications of financial transfer networks"
    - "program algebra with a jump shift instruction"

Connected through hyperedge HE-7 (induced by source paper "a protocol for instruction stream processing"):
  with members:
    - "an interface group for process components"
    - "transmission protocols for instruction streams"
    - "tuplix calculus specifications of financial transfer networks"
    - "program algebra with a jump shift instruction"
    - "instruction sequences and non uniform complexity theory"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"

Connected through hyperedge HE-8 (induced by source paper "transmission protocols for instruction streams"):
  with members:
    - "an interface group for process components"
    - "tuplix calculus specifications of financial transfer networks"
    - "program algebra with a jump shift instruction"
    - "instruction sequences and non uniform complexity theory"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"
    - "instruction sequences with indirect jumps"

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)