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 "characterizing and detecting hateful users on twitter"):
  Abstract: Most current approaches to characterize and detect hate speech focus on \textit{content} posted in Online Social Networks. They face shortcomings to collect and annotate hateful speech due to the incompleteness and noisiness of OSN text and the subjectivity of hate speech. These limitations are often aided with constraints that oversimplify the problem, such as considering only tweets containing hate-related words. In this work we partially address these issues by shifting the focus towards \textit{users}. We develop and employ a robust methodology to collect and annotate hateful users which does not depend directly on lexicon and where the users are annotated given their entire profile. This results in a sample of Twitter's retweet graph containing $100,386$ users, out of which $4,972$ were annotated. We also collect the users who were banned in the three months that followed the data collection. We show that hateful users differ from normal ones in terms of their activity patterns, word usage and as well as network structure. We obtain similar results comparing the neighbors of hateful vs. neighbors of normal users and also suspended users vs. active users, increasing the robustness of our analysis. We observe that hateful users are densely connected, and thus formulate the hate speech detection problem as a task of semi-supervised learning over a graph, exploiting the network of connections on Twitter. We find that a node embedding algorithm, which exploits the graph structure, outperforms content-based approaches for the detection of both hateful ($95\%$ AUC vs $88\%$ AUC) and suspended users ($93\%$ AUC vs $88\%$ AUC). Altogether, we present a user-centric view of hate speech, paving the way for better detection and understanding of this relevant and challenging issue.

Includes members:
  Member "the wisdom of polarized crowds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "social centralization and semantic collapse hyperbolic embeddings of networks and text")
  Member "understanding abuse a typology of abusive language detection subtasks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "offensive language identification in greek")
  Member "mean birds detecting aggression and bullying on twitter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "angry birds flock together aggression propagation on social media")
  Member "automated hate speech detection and the problem of offensive language":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ten social dimensions of conversations and relationships")
  Member "inductive representation learning on large graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hierarchical generation of molecular graphs using structural motifs")
  Member "deep learning for hate speech detection in tweets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ties temporal interaction embeddings for enhancing social media integrity at facebook")
  Member "representation learning on graphs methods and applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning to segment 3d point clouds in 2d image space")
  Member "detecting the hate code on social media":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "metoo on campus studying college sexual assault at scale using data reported on social media")

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.CY(Computers and Society)