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 "prior aware dual decomposition document specific topic inference for spectral topic models"):
  Abstract: Spectral topic modeling algorithms operate on matrices/tensors of word co-occurrence statistics to learn topic-specific word distributions. This approach removes the dependence on the original documents and produces substantial gains in efficiency and provable topic inference, but at a cost: the model can no longer provide information about the topic composition of individual documents. Recently Thresholded Linear Inverse (TLI) is proposed to map the observed words of each document back to its topic composition. However, its linear characteristics limit the inference quality without considering the important prior information over topics. In this paper, we evaluate Simple Probabilistic Inverse (SPI) method and novel Prior-aware Dual Decomposition (PADD) that is capable of learning document-specific topic compositions in parallel. Experiments show that PADD successfully leverages topic correlations as a prior, notably outperforming TLI and learning quality topic compositions comparable to Gibbs sampling on various data.

Includes members:
  Member "provable algorithms for inference in topic models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning networked exponential families with network lasso")
  Member "spectral methods for correlated topic models":
    also connected through other hyperedges:
      (none)
  Member "robust spectral inference for joint stochastic matrix factorization":
    also connected through other hyperedges:
      (none)
  Member "probabilistic latent semantic analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "two level transformer and auxiliary coherence modeling for improved text segmentation")
  Member "when are overcomplete topic models identifiable uniqueness of tensor tucker decompositions with structured sparsity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "a practical algorithm for topic modeling with provable guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "leveraging just a few keywords for fine grained aspect detection through weakly supervised co training")
  Member "on smoothing and inference for topic models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "topic grouper an agglomerative clustering approach to topic modeling")
  Member "a tutorial on dual decomposition and lagrangian relaxation for inference in natural language processing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mitigating gender bias in natural language processing literature review")

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.CL(Computation and Language)