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 "hypergraph cuts with general splitting functions"):
  Abstract: The minimum $s$-$t$ cut problem in graphs is one of the most fundamental problems in combinatorial optimization, and graph cuts underlie algorithms throughout discrete mathematics, theoretical computer science, operations research, and data science. While graphs are a standard model for pairwise relationships, hypergraphs provide the flexibility to model multi-way relationships, and are now a standard model for complex data and systems. However, when generalizing from graphs to hypergraphs, the notion of a "cut hyperedge" is less clear, as a hyperedge's nodes can be split in several ways. Here, we develop a framework for hypergraph cuts by considering the problem of separating two terminal nodes in a hypergraph in a way that minimizes a sum of penalties at split hyperedges. In our setup, different ways of splitting the same hyperedge have different penalties, and the penalty is encoded by what we call a splitting function. #R##N#Our framework opens a rich space on the foundations of hypergraph cuts. We first identify a natural class of cardinality-based hyperedge splitting functions that depend only on the number of nodes on each side of the split. In this case, we show that the general hypergraph $s$-$t$ cut problem can be reduced to a tractable graph $s$-$t$ cut problem if and only if the splitting functions are submodular. We also identify a wide regime of non-submodular splitting functions for which the problem is NP-hard. We also analyze extensions to multiway cuts with at least three terminal nodes and identify a natural class of splitting functions for which the problem can be reduced in an approximation-preserving way to the node-weighted multiway cut problem in graphs, again subject to a submodularity property. Finally, we outline several open questions on general hypergraph cut problems.

Includes members:
  Member "nonlinearity networks a 2020 vision":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "migration networks applications of network analysis to large scale human mobility")
  Member "three hypergraph eigenvector centralities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonlocal pagerank")
  Member "simplicial closure and higher order link prediction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hypergraph motifs concepts algorithms and discoveries")
  Member "network flow based refinement for multilevel hypergraph partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "hypergraph partitioning for sparse matrix matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a systematic survey of general sparse matrix matrix multiplication")
  Member "higher order organization of complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hypergraph motifs concepts algorithms and discoveries")
  Member "a simple and strongly local flow based method for cut improvement":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "compressive sensing for cut improvement and local clustering")
  Member "simple and fast rounding algorithms for directed and node weighted multiway cut":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "downgrading to minimize connectivity")

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.DS(Data Structures and Algorithms)