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 "affine maps between graph isomorphism polytopes and boolean quadratic polytopes"):
  Abstract: Let $P_n$ be the set of $n\times n$ permutation matrices. We consider the convex hull $\psi_n$ of the set of tensors $x\otimes x$, $x \in P_n$. We show that $\psi_n$ is a face of the Boolean quadratic polytope $BQP(n^2)$. #R##N#For every permutation of vertices of the complete graph $K_n$ we consider appropriate $\binom{n}{2} \times \binom{n}{2}$ permutation matrix of the edges of $K_n$. The convex hull $\phi_n$ of all such matrices is an example of the Young polytope $P((n-2,2))$. We show that $\phi_n$ and $\psi_n$ are not isomorphic, but $\phi_n$ is a projection of $\psi_n$. Also, we show that $BQP(n)$ is a face of $\phi_{2n}$.

Includes members:
  Member "a special role of boolean quadratic polytopes among other combinatorial polytopes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity of combinatorial optimization problems in terms of face lattices of associated polytopes")
  Member "two graph isomorphism polytopes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a family of counter examples to an approach to graph isomorphism")

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)