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 "community detection a refined axiomization and beyond"):
  Abstract: Borgs et al. [2016] investigate the essential requirements for community in preference networks, and defined six axioms on community detection rules (or community functions). Two of these axioms play critical roles in their system, however, it is coNP-complete to check whether they are satisfied. We propose efficiently-checkable alternatives to the two axioms, and prove that various desirable properties are preserved. Most strikingly, the new axioms enable to easily find constructive and consistent community functions. Actually, we find such a natural community function which is also enumerable and samplable, answering an open problem in the literature. We further discuss how to infer a corresponding preference network from a given collection of communities. We completely solve the problem when the simplest community rule is used, and uncover an inherent limitation of preference networks. Motivated by this observation, we extend the concept of preference to multi-preferences and prove that any collection of communities can be exactly generated by multi-preferences.

Includes members:
  Member "fixed points of social choice an axiomatic approach to network communities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communities in preference networks refined axioms and beyond")
  Member "a uniqueness theorem for clustering":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a fixed point view a model based clustering framework")

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)