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: "piggyback adapting a single network to multiple tasks by learning to mask weights"
  Abstract: This work presents a method for adapting a single, fixed deep neural network to multiple tasks without affecting performance on already learned tasks. By building upon ideas from network quantization and pruning, we learn binary masks that piggyback on an existing network, or are applied to unmodified weights of that network to provide good performance on a new task. These masks are learned in an end-to-end differentiable fashion, and incur a low overhead of 1 bit per network parameter, per task. Even though the underlying network is fixed, the ability to mask individual weights allows for the learning of a large number of filters. We show performance comparable to dedicated fine-tuned networks for a variety of classification tasks, including those with large domain shifts from the initial task (ImageNet), and a variety of network architectures. Unlike prior work, we do not suffer from catastrophic forgetting or competition between tasks, and our performance is agnostic to task ordering. Code available at this https URL.

Connected through hyperedge HE-1 (induced by source paper "few shot few shot learning and the role of spatial attention"):
  with members:
    - "dense classification and implanting for few shot learning"
    - "few shot learning with localization in realistic settings"
    - "revisiting local descriptor based image to class measure for few shot learning"
    - "finding task relevant features for few shot learning by category traversal"
    - "large scale long tailed recognition in an open world"
    - "a closer look at few shot classification"
    - "few shot learning with metric agnostic conditional embeddings"
    - "deep clustering for unsupervised learning of visual features"

Connected through hyperedge HE-2 (induced by source paper "continual universal object detection"):
  with members:
    - "distilling object detectors with fine grained feature imitation"
    - "continual lifelong learning with neural networks a review"
    - "towards universal object detection by domain attention"
    - "continual learning a comparative study on how to defy forgetting in classification tasks"
    - "learning without memorizing"
    - "cross domain weakly supervised object detection through progressive domain adaptation"
    - "rotate your networks better weight consolidation and less catastrophic forgetting"
    - "memory replay gans learning to generate images from new categories without forgetting"

Connected through hyperedge HE-3 (induced by source paper "dynamic task weighting methods for multi task networks in autonomous driving systems"):
  with members:
    - "multinet multi stream feature aggregation and geometric loss strategy for multi task learning"
    - "real time joint object detection and semantic segmentation network for automated driving"
    - "which tasks should be learned together in multi task learning"
    - "auto deeplab hierarchical neural architecture search for semantic image segmentation"
    - "soilingnet soiling detection on automotive surround view cameras"
    - "taskonomy disentangling task transfer learning"
    - "autoaugment learning augmentation policies from data"
    - "end to end multi task learning with attention"

Connected through hyperedge HE-4 (induced by source paper "ternary feature masks continual learning without any forgetting"):
  with members:
    - "class incremental learning via deep model consolidation"
    - "learn to grow a continual structure learning framework for overcoming catastrophic forgetting"
    - "continual learning a comparative study on how to defy forgetting in classification tasks"
    - "rotate your networks better weight consolidation and less catastrophic forgetting"
    - "efficient lifelong learning with a gem"
    - "learning to learn without forgetting by maximizing transfer and minimizing interference"
    - "riemannian walk for incremental learning understanding forgetting and intransigence"
    - "overcoming catastrophic forgetting with hard attention to the task"

Connected through hyperedge HE-5 (induced by source paper "scalable and order robust continual learning with additive parameter decomposition"):
  with members:
    - "learn to grow a continual structure learning framework for overcoming catastrophic forgetting"
    - "efficient lifelong learning with a gem"
    - "reinforced continual learning"
    - "unsupervised representation learning by predicting image rotations"
    - "overcoming catastrophic forgetting with hard attention to the task"
    - "progressive neural networks"
    - "lifelong learning with dynamically expandable networks"
    - "continual learning with deep generative replay"

Connected through hyperedge HE-6 (induced by source paper "continual learning in neural networks"):
  with members:
    - "class incremental learning via deep model consolidation"
    - "knowledge transfer in deep block modular neural networks"
    - "meta learning representations for continual learning"
    - "continual reinforcement learning in 3d non stationary environments"
    - "continual learning with tiny episodic memories"
    - "continual classification learning using generative models"
    - "task free continual learning"
    - "re evaluating continual learning scenarios a categorization and case for strong baselines"

Connected through hyperedge HE-7 (induced by source paper "dreaming to distill data free knowledge transfer via deepinversion"):
  with members:
    - "hardware guided symbiotic training for compact accurate yet execution efficient lstm"
    - "adversarial neural network inversion via auxiliary knowledge alignment"
    - "relational knowledge distillation"
    - "refine and distill exploiting cycle inconsistency and knowledge distillation for unsupervised monocular depth estimation"
    - "variational information distillation for knowledge transfer"
    - "data free learning of student networks"
    - "importance estimation for neural network pruning"
    - "how good is my gan"

Connected through hyperedge HE-8 (induced by source paper "nettailor tuning the architecture not just the weights"):
  with members:
    - "darts differentiable architecture search"
    - "packnet adding multiple tasks to a single network by iterative pruning"
    - "progressive neural architecture search"
    - "learning transferable architectures for scalable image recognition"
    - "progressive neural networks"
    - "lifelong learning with dynamically expandable networks"
    - "teacher student curriculum learning"
    - "incremental learning through deep adaptation"

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)