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: "proportional justified representation"
  Abstract: The goal of multi-winner elections is to choose a fixed-size committee based on voters' preferences. An important concern in this setting is representation: large groups of voters with cohesive preferences should be adequately represented by the election winners. Recently, Aziz et al. (2015a;2017) proposed two axioms that aim to capture this idea: justified representation (JR) and its strengthening extended justified representation (EJR). In this paper, we extend the work of Aziz et al. in several directions. First, we answer an open question of Aziz et al., by showing that Reweighted Approval Voting satisfies JR for $k=3, 4, 5$, but fails it for $k\ge 6$. Second, we observe that EJR is incompatible with the Perfect Representation criterion, which is important for many applications of multi-winner voting, and propose a relaxation of EJR, which we call Proportional Justified Representation (PJR). PJR is more demanding than JR, but, unlike EJR, it is compatible with perfect representation, and a committee that provides PJR can be computed in polynomial time if the committee size divides the number of voters. Moreover, just like EJR, PJR can be used to characterize the classic PAV rule in the class of weighted PAV rules. On the other hand, we show that EJR provides stronger guarantees with respect to average voter satisfaction than PJR does.

Connected through hyperedge HE-1 (induced by source paper "group fairness in committee selection"):
  with members:
    - "fair allocation of indivisible public goods"
    - "the core of the participatory budgeting problem"
    - "properties of multiwinner voting rules"
    - "justified representation in approval based committee voting"

Connected through hyperedge HE-2 (induced by source paper "fair allocation of indivisible public goods"):
  with members:
    - "fair knapsack"
    - "almost envy freeness with general valuations"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "the core of the participatory budgeting problem"
    - "a discrete and bounded envy free cake cutting protocol for four agents"
    - "justified representation in approval based committee voting"

Connected through hyperedge HE-3 (induced by source paper "thresholds quantifying proportionality criteria for election methods"):
  with members:
    - "the expanding approvals rule improving proportional representation and monotonicity"

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"
    - "monotonicity axioms in approval based multi winner voting rules"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "monotonicity axioms in approval based multi winner voting rules"):
  with members:
    - "committee scoring rules axiomatic characterization and hierarchy"
    - "consistent approval based multi winner rules"
    - "properties of multiwinner voting rules"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-6 (induced by source paper "proportionally representative participatory budgeting axioms and algorithms"):
  with members:
    - "the condorcet principle for multiwinner elections from shortlisting to proportionality"
    - "the core of the participatory budgeting problem"
    - "computational complexity of testing proportional justified representation"
    - "justified representation in approval based committee voting"

Connected through hyperedge HE-7 (induced by source paper "multiwinner approval rules as apportionment methods"):
  with members:
    - "proportional approval method using squared loads approval removal and coin flip approval transformation pamsac a new system of proportional representation using approval voting"
    - "properties of multiwinner voting rules"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "justified representation in approval based committee voting"

Connected through hyperedge HE-8 (induced by source paper "justified representation in approval based committee voting"):
  with members:
    - "structure in dichotomous preferences"
    - "properties of multiwinner voting rules"
    - "ptas for minimax approval voting"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "computational aspects of multi winner approval voting"
    - "achieving fully proportional representation approximability results"
    - "on the computation of fully proportional representation"
    - "the complexity of fully proportional representation for single crossing electorates"

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)