human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "near optimally teaching the crowd to classify"
  Abstract: How should we present training examples to learners to teach them classification rules? This is a natural problem when training workers for crowdsourcing labeling tasks, and is also motivated by challenges in data-driven online education. We propose a natural stochastic model of the learners, modeling them as randomly switching among hypotheses based on observed feedback. We then develop STRICT, an efficient algorithm for selecting examples to teach to workers. Our solution greedily maximizes a submodular surrogate objective function in order to select examples to show to the learners. We prove that our strategy is competitive with the optimal teaching policy. Moreover, for the special case of linear separators, we prove that an exponential reduction in error probability can be achieved. Our experiments on simulated workers as well as three real image annotation tasks on Amazon Mechanical Turk show the effectiveness of our teaching algorithm.

Connected through hyperedge HE-1 (induced by source paper "streaming submodular maximization under a k set system constraint"):
  with members:
    - "submodular streaming in all its glory tight approximation minimum memory and low adaptive complexity"
    - "an optimal streaming algorithm for non monotone submodular maximization"
    - "making a sieve random improved semi streaming algorithm for submodular maximization under a cardinality constraint"
    - "data summarization at scale a two stage submodular approach"
    - "do less get more streaming submodular maximization with subsampling"
    - "beyond 1 2 approximation for submodular maximization on massive data streams"
    - "discrete adversarial attacks and submodular optimization with applications to text classification"
    - "streaming non monotone submodular maximization personalized video summarization on the fly"

Connected through hyperedge HE-2 (induced by source paper "black box submodular maximization discrete and continuous settings"):
  with members:
    - "introduction to online convex optimization"
    - "online continuous submodular maximization from full information to bandit feedback"
    - "optimal dr submodular maximization and applications to provable mean field inference"
    - "black box adversarial attacks with limited queries and information"
    - "discrete adversarial attacks and submodular optimization with applications to text classification"
    - "weakly submodular maximization beyond cardinality constraints does randomization help greedy"
    - "gradient methods for submodular maximization"
    - "continuous dr submodular maximization structure and algorithms"

Connected through hyperedge HE-3 (induced by source paper "adaptive sequence submodularity"):
  with members:
    - "submodular streaming in all its glory tight approximation minimum memory and low adaptive complexity"
    - "beyond adaptive submodularity approximation guarantees of greedy policy with adaptive submodularity ratio"
    - "an exponential speedup in parallel running time for submodular maximization without loss in approximation"
    - "data summarization at scale a two stage submodular approach"
    - "submodular maximization with optimal approximation adaptivity and query complexity"
    - "do less get more streaming submodular maximization with subsampling"
    - "beyond 1 2 approximation for submodular maximization on massive data streams"
    - "submodular maximization with nearly optimal approximation and adaptivity in nearly linear time"

Connected through hyperedge HE-4 (induced by source paper "online non monotone dr submodular maximization"):
  with members:
    - "introduction to online convex optimization"
    - "optimal algorithms for continuous non monotone submodular and dr submodular maximization"
    - "an optimal algorithm for online unconstrained submodular maximization"
    - "non monotone continuous dr submodular maximization structure and algorithms"
    - "gradient methods for submodular maximization"
    - "robust budget allocation via continuous submodular functions"
    - "potential function proofs for first order methods"
    - "guaranteed non convex optimization submodular maximization over continuous domains"

Connected through hyperedge HE-5 (induced by source paper "learner aware teaching inverse reinforcement learning with preferences and constraints"):
  with members:
    - "interactive teaching algorithms for inverse reinforcement learning"
    - "risk aware active inverse reinforcement learning"
    - "an algorithmic perspective on imitation learning"
    - "understanding the role of adaptivity in machine teaching the case of version space learners"
    - "teaching inverse reinforcement learners via features and demonstrations"
    - "an overview of machine teaching"
    - "teaching categories to human learners with visual explanations"
    - "machine teaching for inverse reinforcement learning algorithms and applications"

Connected through hyperedge HE-6 (induced by source paper "non monotone dr submodular maximization approximation and regret guarantees"):
  with members:
    - "introduction to online convex optimization"
    - "optimal algorithms for continuous non monotone submodular and dr submodular maximization"
    - "an optimal algorithm for online unconstrained submodular maximization"
    - "non monotone continuous dr submodular maximization structure and algorithms"
    - "gradient methods for submodular maximization"
    - "robust budget allocation via continuous submodular functions"
    - "non monotone dr submodular function maximization"
    - "guaranteed non convex optimization submodular maximization over continuous domains"

Connected through hyperedge HE-7 (induced by source paper "on human predictions with explanations and predictions of machine learning models a case study on deception detection"):
  with members:
    - "what can ai do for me evaluating machine learning interpretations in cooperative play"
    - "do explanations make vqa models more predictable to a human"
    - "teaching categories to human learners with visual explanations"
    - "a unified approach to interpreting model predictions"
    - "algorithmic decision making and the cost of fairness"
    - "improving human machine cooperative visual search with soft highlighting"
    - "equality of opportunity in supervised learning"
    - "inherent trade offs in the fair determination of risk scores"

Connected through hyperedge HE-8 (induced by source paper "preference based batch and sequential teaching towards a unified view of models"):
  with members:
    - "interactive teaching algorithms for inverse reinforcement learning"
    - "learner aware teaching inverse reinforcement learning with preferences and constraints"
    - "optimal collusion free teaching"
    - "an optimal control approach to sequential machine teaching"
    - "understanding the role of adaptivity in machine teaching the case of version space learners"
    - "teaching inverse reinforcement learners via features and demonstrations"
    - "an optimal control view of adversarial machine learning"
    - "quadratic upper bound for recursive teaching dimension of finite vc classes"

Question: Please tell me which class the center node 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.LG(Machine Learning)