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: "legr filter pruning via learned global ranking"
  Abstract: Filter pruning has shown to be effective for learning resource-constrained convolutional neural networks (CNNs). However, prior methods for resource-constrained filter pruning have some limitations that hinder their effectiveness and efficiency. When searching for constraint-satisfying CNNs, prior methods either alter the optimization objective or adopt local search algorithms with heuristic parameterization, which are sub-optimal, especially in low-resource regime. From the efficiency perspective, prior methods are often costly to search for constraint-satisfying CNNs. In this work, we propose learned global ranking, dubbed LeGR, which improves upon prior art in the two aforementioned dimensions. Inspired by theoretical analysis, LeGR is parameterized to learn layer-wise affine transformations over the filter norms to construct a learned global ranking. With global ranking, resource-constrained filter pruning at various constraint levels can be done efficiently. We conduct extensive empirical analyses to demonstrate the effectiveness of the proposed algorithm with ResNet and MobileNetV2 networks on CIFAR-10, CIFAR-100, Bird-200, and ImageNet datasets. Code is publicly available at this https URL.

Connected through hyperedge HE-1 (induced by source paper "good subnetworks provably exist pruning via greedy forward selection"):
  with members:
    - "proving the lottery ticket hypothesis pruning is all you need"
    - "pruning from scratch"
    - "sipping neural networks sensitivity informed provable pruning of neural networks"
    - "searching for mobilenetv3"
    - "data independent neural pruning via coresets"
    - "what s hidden in a randomly weighted neural network"
    - "provable filter pruning for efficient neural networks"
    - "mobilenetv2 inverted residuals and linear bottlenecks"

Connected through hyperedge HE-2 (induced by source paper "pops policy pruning and shrinking for deep reinforcement learning"):
  with members:
    - "structured pruning of neural networks with budget aware regularization"
    - "amc automl for model compression and acceleration on mobile devices"
    - "deep reinforcement learning for dynamic multichannel access in wireless networks"
    - "layer compensated pruning for resource constrained convolutional neural networks"
    - "deep learning in mobile and wireless networking a survey"
    - "deep reinforcement one shot learning for artificially intelligent classification systems"
    - "deep reinforcement learning an overview"
    - "incremental network quantization towards lossless cnns with low precision weights"

Connected through hyperedge HE-3 (induced by source paper "improving the adversarial robustness of transfer learning via noisy feature distillation"):
  with members:
    - "single path nas designing hardware efficient convnets in less than 4 hours"
    - "growing a brain fine tuning by increasing model capacity"
    - "a target agnostic attack on deep models exploiting security vulnerabilities of transfer learning"
    - "transfusion understanding transfer learning for medical imaging"
    - "adversarially robust transfer learning"
    - "advertorch v0 1 an adversarial robustness toolbox based on pytorch"
    - "mixout effective regularization to finetune large scale pretrained language models"
    - "rethinking imagenet pre training"

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.CV(Computer Vision and Pattern Recognition)