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 "popular branchings and their dual certificates"):
  Abstract: Let $G$ be a digraph where every node has preferences over its incoming edges. The preferences of a node extend naturally to preferences over branchings, i.e., directed forests; a branching $B$ is popular if $B$ does not lose a head-to-head election (where nodes cast votes) against any branching. Such popular branchings have a natural application in liquid democracy. The popular branching problem is to decide if $G$ admits a popular branching or not. We give a characterization of popular branchings in terms of dual certificates and use this characterization to design an efficient combinatorial algorithm for the popular branching problem. When preferences are weak rankings, we use our characterization to formulate the popular branching polytope in the original space and also show that our algorithm can be modified to compute a branching with least unpopularity margin. When preferences are strict rankings, we show that "approximately popular" branchings always exist.

Includes members:
  Member "the convergence of iterative delegations in liquid democracy in a social network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "iterative delegations in liquid democracy with restricted preferences")
  Member "popular matching in roommates setting is np hard":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "understanding popular matchings via stable matchings")
  Member "popular matchings and limits to tractability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "understanding popular matchings via stable matchings")
  Member "the fluid mechanics of liquid democracy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the convergence of iterative delegations in liquid democracy in a social network")
  Member "binary voting with delegable proxy an analysis of liquid democracy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the convergence of iterative delegations in liquid democracy in a social network")
  Member "popular matchings with two sided preferences and one sided ties":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "understanding popular matchings via stable matchings")
  Member "popular edges and dominant matchings":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "understanding popular matchings via stable matchings")

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)