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 probabilistic social choice"
  Abstract: Two fundamental axioms in social choice theory are consistency with respect to a variable electorate and consistency with respect to components of similar alternatives. In the context of traditional non-probabilistic social choice, these axioms are incompatible with each other. We show that in the context of probabilistic social choice, these axioms uniquely characterize a function proposed by Fishburn (Rev. Econ. Stud., 51(4), 683--692, 1984). Fishburn's function returns so-called maximal lotteries, i.e., lotteries that correspond to optimal mixed strategies of the underlying plurality game. Maximal lotteries are guaranteed to exist due to von Neumann's Minimax Theorem, are almost always unique, and can be efficiently computed using linear programming.

Connected through hyperedge HE-1 (induced by source paper "consistent approval based multi winner rules"):
  with members:
    - "committee scoring rules axiomatic characterization and hierarchy"
    - "axiomatic characterization of committee scoring rules"
    - "properties of multiwinner voting rules"
    - "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-2 (induced by source paper "fair mixing the case of dichotomous preferences"):
  with members:
    - "agent mediated social choice"
    - "competitive division of a mixed manna"
    - "the core of the participatory budgeting problem"
    - "justified representation in approval based committee voting"
    - "the computational complexity of random serial dictatorship"

Connected through hyperedge HE-3 (induced by source paper "rank maximal equal contribution a probabilistic social choice function"):
  with members:
    - "randomized social choice functions under metric preferences"
    - "welfare maximization entices participation"
    - "the computational complexity of random serial dictatorship"

Connected through hyperedge HE-4 (induced by source paper "arrovian aggregation via pairwise utilitarianism"):
  with members:
    - "welfare maximization entices participation"
    - "set rationalizable choice and self stability"

Connected through hyperedge HE-5 (induced by source paper "axiomatic characterization of committee scoring rules"):
  with members:
    - "what do we elect committees for a voting committee model for multi winner rules"
    - "multiwinner approval rules as apportionment methods"
    - "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"
    - "computational aspects of multi winner approval voting"
    - "on the computation of fully proportional representation"

Connected through hyperedge HE-6 (induced by source paper "cycles and intractability in social choice theory"):
  with members:
    - "properties of multiwinner voting rules"

Connected through hyperedge HE-7 (induced by source paper "welfare maximization entices participation"):
  with members:
    - "arrovian aggregation of convex preferences"
    - "condorcet s principle and the preference reversal paradox"
    - "optimal bounds for the no show paradox via sat solving"

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)