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 "a distributed frank wolfe framework for learning low rank matrices with the trace norm"):
  Abstract: We consider the problem of learning a high-dimensional but low-rank matrix from a large-scale dataset distributed over several machines, where low-rankness is enforced by a convex trace norm constraint. We propose DFW-Trace, a distributed Frank–Wolfe algorithm which leverages the low-rank structure of its updates to achieve efficiency in time, memory and communication usage. The step at the heart of DFW-Trace is solved approximately using a distributed version of the power method. We provide a theoretical analysis of the convergence of DFW-Trace, showing that we can ensure sublinear convergence in expectation to an optimal solution with few power iterations per epoch. We implement DFW-Trace in the Apache Spark distributed programming framework and validate the usefulness of our approach on synthetic and real data, including the ImageNet dataset with high-dimensional features extracted from a deep neural network.

Includes members:
  Member "variance reduced and projection free stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the convergence of stochastic gradient descent with low rank projections for convex low rank matrix problems")
  Member "deep residual learning for image recognition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "imagenet large scale visual recognition challenge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "a distributed frank wolfe algorithm for communication efficient sparse learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication efficient asynchronous stochastic frank wolfe over nuclear norm balls")
  Member "projection free online learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the convergence of stochastic gradient descent with low rank projections for convex low rank matrix problems")
  Member "recovering low rank matrices from few coefficients in any basis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "matrix completion with prior subspace information via maximizing correlation")
  Member "phase retrieval via matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "the power of convex relaxation near optimal matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ell_0 motivated low rank sparse subspace clustering")

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.DC(Distributed, Parallel, and Cluster Computing)