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 "general linear group action on tensors a candidate for post quantum cryptography"):
  Abstract: Starting from the one-way group action framework of Brassard and Yung (Crypto '90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no longer stand, due to progress both on classical algorithms (e.g., graph isomorphism) and quantum algorithms (e.g., discrete logarithm). #R##N#We propose the general linear group action on tensors as a new candidate to build cryptography based on group actions. Recent works (Futorny--Grochow--Sergeichuk, Lin. Alg. Appl., 2019) suggest that the underlying algorithmic problem, the tensor isomorphism problem, is the hardest one among several isomorphism testing problems arising from areas including coding theory, computational group theory, and multivariate cryptography. We present evidence to justify the viability of this proposal from comprehensive study of the state-of-art heuristic algorithms, theoretical algorithms, and hardness results, as well as quantum algorithms. #R##N#We then introduce a new notion called pseudorandom group actions to further develop group-action based cryptography. Briefly speaking, given a group $G$ acting on a set $S$, we assume that it is hard to distinguish two distributions of $(s, t)$ either uniformly chosen from $S\times S$, or where $s$ is randomly chosen from $S$ and $t$ is the result of applying a random group action of $g\in G$ on $s$. This subsumes the classical decisional Diffie-Hellman assumption when specialized to a particular group action. We carefully analyze various attack strategies that support the general linear group action on tensors as a candidate for this assumption. #R##N#Finally, we establish the quantum security of several cryptographic primitives based on the one-way group action assumption and the pseudorandom group action assumption.

Includes members:
  Member "isomorphism problems for tensors groups and cubic forms completeness and reductions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "derandomization and absolute reconstruction for sums of powers of linear forms")
  Member "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "efficient algorithms for tensor scaling quantum marginals and moment polytopes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "alternating minimization scaling algorithms and the null cone problem from invariant theory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions")
  Member "constructive noncommutative rank computation is in deterministic polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient algorithms for tensor scaling quantum marginals and moment polytopes")
  Member "solving the isomorphism of polynomials with two secrets problem for all pairs of quadratic forms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing")
  Member "polynomial time algorithms for quadratic isomorphism of polynomials the regular case":
    also connected through other hyperedges:
      (none)

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.CR(Cryptography and Security)