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 size complexity of parity"
  Abstract: Each Boolean function can be computed by a single-pass instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. Auxiliary Boolean registers are not necessary for this. In the current paper, we show that, in the case of the parity functions, shorter instruction sequences are possible with the use of an auxiliary Boolean register in the presence of instructions to complement the content of auxiliary Boolean registers. This result supports, in a setting where programs are instruction sequences acting on Boolean registers, a basic intuition behind the storage of auxiliary data, namely the intuition that this makes possible a reduction of the size of a program.

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"
    - "on instruction sets for boolean registers in program algebra"
    - "on algorithmic equivalence of instruction sequences for computing bit string functions"
    - "instruction sequence based non uniform complexity classes"

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"
    - "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-3 (induced by source paper "instruction sequences expressing multiplication algorithms"):
  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 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-4 (induced by source paper "axioms for behavioural congruence of single pass instruction sequences"):
  with members:
    - "on instruction sets for boolean registers in program algebra"
    - "instruction sequence based non uniform complexity classes"
    - "instruction sequence processing operators"
    - "on the behaviours produced by instruction sequences under execution"

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

Connected through hyperedge HE-6 (induced by source paper "instruction sequence expressions for the secure hash algorithm sha 256"):
  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 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"

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)