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 "constructing hard examples for graph isomorphism"):
  Abstract: We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial automorphisms which also have high Weisfeiler-Leman dimension. The construction is based on properties of random 3XOR-formulas. We describe how to convert such a formula into a graph which has the desired properties with high probability. We validate the method by an experimental implementation. We construct random formulas and validate them with a SAT solver to filter through suitable ones, and then convert them into graphs. Experimental results demonstrate that the resulting graphs do provide hard examples that match the hardest known benchmarks for graph isomorphism.

Includes members:
  Member "definable inapproximability new challenges for duplicator":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the weisfeiler leman dimension of fractional packing")
  Member "an exponential lower bound for individualization refinement algorithms for graph isomorphism":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "benchmark graphs for practical graph isomorphism")
  Member "the pebbling comonad in finite model theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a duality theoretic view on limits of finite structures")
  Member "benchmark graphs for practical graph isomorphism":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "local wl invariance and hidden shades of regularity")
  Member "graph isomorphism in quasipolynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "lower bounds for existential pebble games and k consistency tests":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the propagation depth of local consistency")
  Member "practical graph isomorphism ii":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "clause learning algorithms with many restarts and bounded width resolution":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "towards a complexity theoretic understanding of restarts in sat solvers")

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)