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 "strategyproof peer selection using randomization partitioning and apportionment"):
  Abstract: Peer review, evaluation, and selection is a fundamental aspect of modern science. Funding bodies the world over employ experts to review and select the best proposals of those submitted for funding. The problem of peer selection, however, is much more general: a professional society may want to give a subset of its members awards based on the opinions of all members; an instructor for a MOOC or online course may want to crowdsource grading; or a marketing company may select ideas from group brainstorming sessions based on peer evaluation. We make three fundamental contributions to the study of procedures or mechanisms for peer selection, a specific type of group decision-making problem, studied in computer science, economics, and political science. First, we propose a novel mechanism that is strategyproof, i.e., agents cannot benefit by reporting insincere valuations. Second, we demonstrate the effectiveness of our mechanism by a comprehensive simulation-based comparison with a suite of mechanisms found in the literature. Finally, our mechanism employs a randomized rounding technique that is of independent interest, as it solves the apportionment problem that arises in various settings where discrete resources such as parliamentary representation slots need to be divided proportionally.

Includes members:
  Member "friend based ranking":
    also connected through other hyperedges:
      (none)
  Member "the conference paper assignment problem using order weighted averages to assign indivisible goods":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an algorithm for multi attribute diverse matching")
  Member "design and analysis of the nips 2016 review process":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "accounting for the neglected dimensions of ai progress")
  Member "how effective can simple ordinal peer grading be":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimizing positional scoring rules for rank aggregation")
  Member "aggregating partial rankings with applications to peer grading in massive online open courses":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incentivizing effort and precision in peer grading")
  Member "a near optimal mechanism for impartial selection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "impartial selection with additive approximation guarantees")
  Member "the peerrank method for peer assessment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online fair division a survey")
  Member "crowdgrader crowdsourcing the evaluation of homework assignments":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strategyproof peer 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)