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: "consistent approval based multi winner rules"
  Abstract: This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules, provide an axiomatic characterization of this class and, in particular, show that counting rules are consistent. Building upon this result, we axiomatically characterize three important consistent multi-winner rules: Proportional Approval Voting, Multi-Winner Approval Voting and the Approval Chamberlin-Courant rule. Our results demonstrate the variety of multi-winner rules and illustrate three different, orthogonal principles that multi-winner voting rules may represent: individual excellence, diversity, and proportionality.

Connected through hyperedge HE-1 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise"):
  with members:
    - "a quantitative analysis of multi winner rules"
    - "multiwinner approval rules as apportionment methods"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"
    - "a maximum likelihood approach for selecting sets of alternatives"
    - "common voting rules as maximum likelihood estimators"

Connected through hyperedge HE-2 (induced by source paper "who is in your top three optimizing learning in elections with many candidates"):
  with members:
    - "truthful aggregation of budget proposals"
    - "a framework for approval based budgeting methods"
    - "designing optimal binary rating systems"
    - "a quantitative analysis of multi winner rules"
    - "designing informative rating systems for online platforms evidence from two experiments"
    - "iterative local voting for collective decision making in continuous spaces"
    - "optimizing positional scoring rules for rank aggregation"
    - "learning mixtures of plackett luce models"

Connected through hyperedge HE-3 (induced by source paper "proportionality and the limits of welfarism"):
  with members:
    - "approximately stable committee selection"
    - "group fairness in committee selection"
    - "proportionality degree of multiwinner rules"
    - "fair allocation of indivisible public goods"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-4 (induced by source paper "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain"):
  with members:
    - "committee scoring rules axiomatic characterization and hierarchy"
    - "properties of multiwinner voting rules"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "on the computation of fully proportional representation"
    - "cloning in elections finding the possible winners"

Connected through hyperedge HE-5 (induced by source paper "how should we score athletes and candidates geometric scoring rules"):
  with members:
    - "measuring majority power and veto power of voting rules"
    - "axiomatic characterization of committee scoring rules"
    - "multiwinner approval rules as apportionment methods"

Connected through hyperedge HE-6 (induced by source paper "committee scoring rules axiomatic characterization and hierarchy"):
  with members:
    - "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain"
    - "the condorcet principle for multiwinner elections from shortlisting to proportionality"
    - "monotonicity axioms in approval based multi winner voting rules"
    - "multiwinner elections with diversity constraints"
    - "multiwinner voting with fairness constraints"
    - "group fairness in multiwinner voting"
    - "robustness among multiwinner voting rules"
    - "proportional approval voting harmonic k median and negative association"

Connected through hyperedge HE-7 (induced by source paper "a quantitative analysis of multi winner rules"):
  with members:
    - "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain"
    - "proportionality and the limits of welfarism"
    - "group fairness in committee selection"
    - "fair allocation of indivisible public goods"
    - "the condorcet principle for multiwinner elections from shortlisting to proportionality"
    - "robustness among multiwinner voting rules"
    - "what do we elect committees for a voting committee model for multi winner rules"
    - "metric distortion of social choice rules lower bounds and fairness properties"

Connected through hyperedge HE-8 (induced by source paper "proportionality degree of multiwinner rules"):
  with members:
    - "fair allocation of indivisible public goods"
    - "a quantitative analysis of multi winner rules"
    - "multiwinner approval rules as apportionment methods"
    - "properties of multiwinner voting rules"
    - "justified representation in approval based committee voting"

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.GT(Computer Science and Game Theory)