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: "monotonicity axioms in approval based multi winner voting rules"
  Abstract: In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity with respect to the support is studied when the set of voters does not change and when new voters enter the election. For each of these two cases we consider a strong and a weak version of the axiom. We observe certain incompatibilities between the monotonicity axioms and well-known representation axioms (extended/proportional justified representation) for the voting rules that we analyze and provide formal proofs of incompatibility between some of these axioms and perfect representation.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting"):
  with members:
    - "complexity of shift bribery in committee elections"
    - "structure in dichotomous preferences"
    - "elections with few voters candidate control can be easy"
    - "election attacks with few candidates"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-2 (induced by source paper "approval based apportionment"):
  with members:
    - "group fairness in committee selection"
    - "fair allocation of indivisible public goods"
    - "fair mixing the case of dichotomous preferences"
    - "committees providing ejr can be computed efficiently"
    - "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"

Connected through hyperedge HE-3 (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"
    - "multiwinner elections with diversity constraints"
    - "consistent approval based multi winner rules"
    - "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-4 (induced by source paper "the expanding approvals rule improving proportional representation and monotonicity"):
  with members:
    - "fair knapsack"
    - "a framework for approval based budgeting methods"
    - "the condorcet principle for multiwinner elections from shortlisting to proportionality"
    - "proportionally representative participatory budgeting axioms and algorithms"
    - "committees providing ejr can be computed efficiently"
    - "the maximin support method an extension of the d hondt method to approval based multiwinner elections"
    - "computational complexity of testing proportional justified representation"
    - "proportional justified representation"

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)