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 "interactions of computational complexity theory and mathematics"):
  Abstract: $ $[This paper is a (self contained) chapter in a new book, Mathematics and Computation, whose draft is available on my homepage at this https URL ]. #R##N#We survey some concrete interaction areas between computational complexity theory and different fields of mathematics. We hope to demonstrate here that hardly any area of modern mathematics is untouched by the computational connection (which in some cases is completely natural and in others may seem quite surprising). In my view, the breadth, depth, beauty and novelty of these connections is inspiring, and speaks to a great potential of future interactions (which indeed, are quickly expanding). We aim for variety. We give short, simple descriptions (without proofs or much technical detail) of ideas, motivations, results and connections; this will hopefully entice the reader to dig deeper. Each vignette focuses only on a single topic within a large mathematical filed. We cover the following: #R##N#$\bullet$ Number Theory: Primality testing #R##N#$\bullet$ Combinatorial Geometry: Point-line incidences #R##N#$\bullet$ Operator Theory: The Kadison-Singer problem #R##N#$\bullet$ Metric Geometry: Distortion of embeddings #R##N#$\bullet$ Group Theory: Generation and random generation #R##N#$\bullet$ Statistical Physics: Monte-Carlo Markov chains #R##N#$\bullet$ Analysis and Probability: Noise stability #R##N#$\bullet$ Lattice Theory: Short vectors #R##N#$\bullet$ Invariant Theory: Actions on matrix tuples

Includes members:
  Member "no occurrence obstructions in geometric complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "uniform sampling through the lov asz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic mcmc sampling")
  Member "approximate counting the lovasz local lemma and inference in graphical models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast sampling and counting k sat solutions in the local lemma regime")
  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 "operator scaling theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "non commutative edmonds problem and matrix semi invariants":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "coarse grained complexity for dynamic algorithms")

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)