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 "parameter free structural diversity search"):
  Abstract: The problem of structural diversity search is to nd the top-k vertices with the largest structural diversity in a graph. However, when identifying distinct social contexts, existing structural diversity models (e.g., t-sized component, t-core and t-brace) are sensitive to an input parameter of t . To address this drawback, we propose a parameter-free structural diversity model. Speci cally, we propose a novel notation of discriminative core, which automatically models various kinds of social contexts without parameter t . Leveraging on discriminative cores and h-index, the structural diversity score for a vertex is calculated. We study the problem of parameter-free structural diversity search in this paper. An e cient top-k search algorithm with a well-designed upper bound for pruning is proposed. Extensive experiment results demonstrate the parameter sensitivity of existing t-core based model and verify the superiority of our methods.

Includes members:
  Member "a fast order based approach for core maintenance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of community search over big graphs")
  Member "discovering social circles in ego networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "relational thematic clustering with mutually preferred neighbors")
  Member "an o m algorithm for cores decomposition of networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fastgae fast scalable and effective graph autoencoders with stochastic subgraph decoding")

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.DB(Databases)