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 "efficient video classification using fewer frames"):
  Abstract: Recently,there has been a lot of interest in building compact models for video classification which have a small memory footprint (<1 GB). While these models are compact, they typically operate by repeated application of a small weight matrix to all the frames in a video. E.g. recurrent neural network based methods compute a hidden state for every frame of the video using a recurrent weight matrix. Similarly, cluster-and-aggregate based methods such as NetVLAD, have a learnable clustering matrix which is used to assign soft-clusters to every frame in the video. Since these models look at every frame in the video, the number of floating point operations (FLOPs) is still large even though the memory footprint is small. We focus on building compute-efficient video classification models which process fewer frames and hence have less number of FLOPs. Similar to memory efficient models, we use the idea of distillation albeit in a different setting. Specifically, in our case, a compute-heavy teacher which looks at all the frames in the video is used to train a compute-efficient student which looks at only a small fraction of frames in the video. This is in contrast to a typical memory efficient Teacher-Student setting, wherein both the teacher and the student look at all the frames in the video but the student has fewer parameters. Our work thus complements the research on memory efficient video classification. We do an extensive evaluation with three types of models for video classification,viz.(i) recurrent models (ii) cluster-and-aggregate models and (iii) memory-efficient cluster-and-aggregate models and show that in each of these cases, a see-it-all teacher can be used to train a compute efficient see-very-little student. We show that the proposed student network can reduce the inference time by 30% and the number of FLOPs by approximately 90% with a negligible drop in the performance.

Includes members:
  Member "less is more picking informative frames for video captioning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatio temporal ranked attention networks for video captioning")
  Member "non local netvlad encoding for video classification":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hierarchical conditional relation networks for video question answering")
  Member "constrained size tensorflow models for youtube 8m video understanding challenge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bert for large scale video segment classification with test time augmentation")
  Member "nextvlad an efficient neural network to aggregate frame level features for large scale video classification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi label classification with label graph superimposing")
  Member "knowledge distillation by on the fly native ensemble":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distilled hierarchical neural ensembles with adaptive inference cost")
  Member "recovering from random pruning on the plasticity of deep convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pruning filters while training for efficiently optimizing deep learning networks")
  Member "attention guided answer distillation for machine reading comprehension":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a study of the tasks and models in machine reading comprehension")
  Member "learnable pooling methods for video classification":
    also connected through other hyperedges:
      (none)

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