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: "computational complexity of tensor nuclear norm"
  Abstract: The main result of this paper shows that the weak membership problem in the unit ball of a given norm is NP-hard if and only if the weak membership problem in the unit ball of the dual norm is NP-hard. Equivalently, the approximation of a given norm is polynomial time if and only if the approximation of the dual norm is polynomial time. Using the NP-hardness of the approximation of the spectral norm of tensors we show that the approximation of the nuclear norm is NP-hard. We relate our results to bipartite separable states in quantum mechanics.

Connected through hyperedge HE-1 (induced by source paper "learning representations from imperfect time series data via tensor rank regularization"):
  with members:
    - "multimodal language analysis with recurrent multistage fusion"
    - "low rank tensor completion for multiway visual data"
    - "multimodal affective analysis using hierarchical attention strategy with word level alignment"
    - "found in translation learning robust joint representations by cyclic translations between modalities"
    - "tensor regression networks"
    - "tensor fusion network for multimodal sentiment analysis"
    - "weighted low rank tensor recovery for hyperspectral image restoration"
    - "multimodal compact bilinear pooling for multimodal neural machine translation"

Connected through hyperedge HE-2 (induced by source paper "tensor theta norms and low rank recovery"):
  with members:
    - "low rank tensor recovery via iterative hard thresholding"
    - "low rank matrix recovery from rank one measurements"
    - "simultaneously structured models with application to sparse and low rank matrices"
    - "phaselift exact and stable signal recovery from magnitude measurements via convex programming"
    - "recovering low rank matrices from few coefficients in any basis"
    - "tight oracle bounds for low rank matrix recovery from a minimal number of random measurements"
    - "most tensor problems are np hard"
    - "exact matrix completion via convex optimization"

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)