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 "thresholds quantifying proportionality criteria for election methods"):
  Abstract: We define several different thresholds for election methods by considering different scenarios, corresponding to different proportionality criteria that have been proposed by various authors. In particular, we reformulate the criteria known as DPC, PSC, JR, PJR, EJR in our setting. We consider multi-winner election methods of different types, using ballots with unordered lists of candidates or ordered lists, and for comparison also methods using only party lists. The thresholds are calculated for many different election methods. The considered methods include classical ones such as BV, SNTV and STV (with some results going back to e.g. Droop and Dodgson in the 19th century); we also study in detail several perhaps lesser known methods by Phragm\'en and Thiele. There are also many cases left as open problems.

Includes members:
  Member "the expanding approvals rule improving proportional representation and monotonicity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "proportionally representative participatory budgeting with ordinal preferences")
  Member "proportional justified representation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "group fairness in committee selection")

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