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: "complex tensor factorisation with parafac2 for the estimation of brain connectivity from the eeg"
  Abstract: Objective: The coupling between neuronal populations and its magnitude have been shown to be informative for various clinical applications. One method to estimate brain connectivity is with electroencephalography (EEG) from which the cross-spectrum between different sensor locations is derived. We wish to test the efficacy of tensor factorisation in the estimation of brain connectivity. Methods: Complex tensor factorisation based on PARAFAC2 is used to decompose the EEG into scalp components described by the spatial, spectral, and complex trial profiles. An EEG model in the complex domain was derived that shows the suitability of PARAFAC2. A connectivity metric was also derived on the complex trial profiles of the extracted components. Results: Results on a benchmark EEG dataset confirmed that PARAFAC2 can estimate connectivity better than traditional tensor analysis such as PARAFAC within a range of signal-to-noise ratios. The analysis of EEG from patients with mild cognitive impairment or Alzheimer's disease showed that PARAFAC2 identifies loss of brain connectivity better than traditional approaches and agreeing with prior pathological knowledge. Conclusion: The complex PARAFAC2 algorithm is suitable for EEG connectivity estimation since it allows to extract meaningful coupled sources and provides better estimates than complex PARAFAC. Significance: A new paradigm that employs complex tensor factorisation has demonstrated to be successful in identifying brain connectivity and the location of couples sources for both a benchmark and a real-world EEG dataset. This can enable future applications and has the potential to solve some the issues that deteriorate the performance of traditional connectivity metrics.

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.CE(Computational Engineering, Finance, and Science)