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 sequence based non uniform complexity classes"
  Abstract: We present an approach to non-uniform complexity in which single-pass instruction sequences play a key part, and answer various questions that arise from this approach. We introduce several kinds of non-uniform complexity classes. One kind includes a counterpart of the well-known non-uniform complexity class P/poly and another kind includes a counterpart of the well-known non-uniform complexity class NP/poly. Moreover, we introduce a general notion of completeness for the non-uniform complexity classes of the latter kind. We also formulate a counterpart of the well-known complexity theoretic conjecture that NP is not included in P/poly. We think that the presented approach opens up an additional way of investigating issues concerning non-uniform complexity.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of the correctness problem for non zeroness test instruction sequences"):
  with members:
    - "axioms for behavioural congruence of single pass instruction sequences"
    - "instruction sequence size complexity of parity"
    - "on instruction sets for boolean registers in program algebra"
    - "on algorithmic equivalence of instruction sequences for computing bit string functions"

Connected through hyperedge HE-2 (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"
    - "instruction sequences expressing multiplication algorithms"
    - "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 expressions for the secure hash algorithm sha 256"
    - "instruction sequence processing operators"

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

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

Connected through hyperedge HE-5 (induced by source paper "axioms for behavioural congruence of single pass instruction sequences"):
  with members:
    - "instruction sequence size complexity of parity"
    - "on instruction sets for boolean registers in program algebra"
    - "instruction sequence processing operators"
    - "on the behaviours produced by instruction sequences under execution"

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

Connected through hyperedge HE-7 (induced by source paper "instruction sequence size complexity of parity"):
  with members:
    - "on instruction sets for boolean registers in program algebra"
    - "on algorithmic equivalence of instruction sequences for computing bit string functions"
    - "long multiplication by instruction sequences with backward jump instructions"

Connected through hyperedge HE-8 (induced by source paper "on instruction sets for boolean registers in program algebra"):
  with members:
    - "instruction sequence size complexity of parity"
    - "on algorithmic equivalence of instruction sequences for computing bit string functions"
    - "instruction sequence processing operators"

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.CC(Computational Complexity)