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 "friend based ranking"):
  Abstract: We analyze the design of a mechanism to extract ordinal information disseminated in a social network. We show that friend-based ranking---the report by agents on the characteristics of their neighbors---is a necessary condition for ex post incentive-compatible and efficient mechanism design. We characterize the windmill network as the sparsest social network for which the planner can construct a complete ranking. When complete rankings cannot be achieved, ex post incentive-compatible and efficient mechanisms arise when social networks are bipartite or composed of triangles. We illustrate these findings using real social networks in India and Indonesia.

Includes members:
  Member "strategyproof peer selection using randomization partitioning and apportionment":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity stability properties of mixed games and dynamic algorithms and learning in the sharing economy")
  Member "sum of us strategyproof selection from the selectors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "impartial selection with additive approximation guarantees")

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.SI(Social and Information Networks)