human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "instruction sequences and non uniform complexity theory"):
  Abstract: We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and NP/poly and formulate a counterpart of the complexity theoretic conjecture that NP is not included in P/poly. In addition, we define a notion of completeness for the counterpart of NP/poly using a non-uniform reducibility relation and formulate complexity hypotheses which concern restrictions on the instruction sequences used for computation. We think that the theory developed opens up an additional way of investigating issues concerning non-uniform complexity.

Includes members:
  Member "on the expressiveness of single pass instruction sequences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantitative expressiveness of instruction sequence classes for computation on single bit registers")
  Member "indirect jumps improve instruction sequence performance":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantitative expressiveness of instruction sequence classes for computation on single bit registers")
  Member "an interface group for process components":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a process calculus with finitary comprehended terms")
  Member "instruction sequences with dynamically instantiated instructions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a process calculus with finitary comprehended terms")
  Member "autosolvability of halting problem instances for instruction sequences":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bitcoin a money like informational commodity")
  Member "tuplix calculus specifications of financial transfer networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a process calculus with finitary comprehended terms")
  Member "program algebra with a jump shift instruction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a hoare like logic of asserted single pass instruction sequences")
  Member "thread extraction for polyadic instruction sequences":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "bitcoin a money like informational commodity")

Question: Please tell me which class the source paper 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)