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 "ranking robustness under adversarial document manipulations"):
  Abstract: For many queries in the Web retrieval setting there is an on-going ranking competition: authors manipulate their documents so as to promote them in rankings. Such competitions can have unwarranted effects not only in terms of retrieval effectiveness, but also in terms of ranking robustness. A case in point, rankings can (rapidly) change due to small indiscernible perturbations of documents. While there has been a recent growing interest in analyzing the robustness of classifiers to adversarial manipulations, there has not yet been a study of the robustness of relevance-ranking functions. We address this challenge by formally analyzing different definitions and aspects of the robustness of learning-to-rank-based ranking functions. For example, we formally show that increased regularization of linear ranking functions increases ranking robustness. This finding leads us to conjecture that decreased variance of any ranking function results in increased robustness. We propose several measures for quantifying ranking robustness and use them to analyze ranking competitions between documents' authors. The empirical findings support our formal analysis and conjecture for both RankSVM and LambdaMART.

Includes members:
  Member "a boundary tilting persepective on the phenomenon of adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adversarial data encryption")
  Member "robustness of classifiers from adversarial to random noise":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "increasing the robustness of dnns against image corruptions by playing the game of noise")
  Member "analysis of classifiers robustness to adversarial perturbations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "metrics and methods for robustness evaluation of neural networks with generative models")
  Member "the stochastic gradient descent for the primal l1 svm optimization revisited":
    also connected through other hyperedges:
      (none)
  Member "intriguing properties of neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adversarial ranking attack and defense")
  Member "efficient and effective spam filtering and re ranking for large web datasets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "abstractive snippet generation")

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.IR(Information Retrieval)