human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "lie algebra conjugacy"
  Abstract: We study the problem of matrix Lie algebra conjugacy. Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley--Sohoni Geometric Complexity Theory program. A matrix Lie algebra is a set L of matrices such that $A, B\in L$ implies $AB - BA \in L$. Two matrix Lie algebras are conjugate if there is an invertible matrix $M$ such that $L_1 = M L_2 M^{-1}$. #R##N#We show that certain cases of Lie algebra conjugacy are equivalent to graph isomorphism. On the other hand, we give polynomial-time algorithms for other cases of Lie algebra conjugacy, which allow us to essentially derandomize a recent result of Kayal on affine equivalence of polynomials. Affine equivalence is related to many complexity problems such as factoring integers, graph isomorphism, matrix multiplication, and permanent versus determinant. #R##N#Specifically, we show: #R##N#Abelian Lie algebra conjugacy is equivalent to the code equivalence problem, and hence is as hard as graph isomorphism. #R##N#Abelian Lie algebra conjugacy of $n \times n$ matrices can be solved in poly(n) time when the Lie algebras have dimension O(1). #R##N#Semisimple Lie algebra conjugacy is equivalent to graph isomorphism. A Lie algebra is semisimple if it is a direct sum of simple Lie algebras. #R##N#Semisimple Lie algebra conjugacy of $n \times n$ matrices can be solved in polynomial time when the Lie algebras consist of only $O(\log n)$ simple direct summands. #R##N#Conjugacy of completely reducible Lie algebras---that is, a direct sum of an abelian and a semisimple Lie algebra---can be solved in polynomial time when the abelian part has dimension O(1) and the semisimple part has $O(\log n)$ simple direct summands.

Connected through hyperedge HE-1 (induced by source paper "isomorphism problems for tensors groups and cubic forms completeness and reductions"):
  with members:
    - "general linear group action on tensors a candidate for post quantum cryptography"
    - "incorporating weisfeiler leman into algorithms for group isomorphism"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "graph isomorphism in quasipolynomial time"
    - "bidirectional collision detection and faster deterministic isomorphism testing"
    - "algorithms for group isomorphism via group extensions and cohomology"
    - "practical graph isomorphism ii"
    - "breaking the n log n barrier for solvable group isomorphism"

Connected through hyperedge HE-2 (induced by source paper "polynomial time isomorphism test of groups that are tame extensions"):
  with members:
    - "bidirectional collision detection and faster deterministic isomorphism testing"
    - "algorithms for group isomorphism via group extensions and cohomology"
    - "deterministic polynomial time algorithms for matrix completion problems"
    - "efficient isomorphism testing for a class of group extensions"

Connected through hyperedge HE-3 (induced by source paper "algorithms for group isomorphism via group extensions and cohomology"):
  with members:
    - "bidirectional collision detection and faster deterministic isomorphism testing"
    - "complexity classes of equivalence problems revisited"
    - "deterministic polynomial time algorithms for matrix completion problems"
    - "efficient isomorphism testing for a class of group extensions"

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