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: "online semi supervised learning on quantized graphs"
  Abstract: In this paper, we tackle the problem of online semi-supervised learning (SSL). When data arrive in a stream, the dual problems of computation and data storage arise for any SSL method. We propose a fast approximate online SSL algorithm that solves for the harmonic solution on an approximate graph. We show, both empirically and theoretically, that good behavior can be achieved by collapsing nearby points into a set of local "representative points" that minimize distortion. Moreover, we regularize the harmonic solution to achieve better stability properties. We apply our algorithm to face recognition and optical character recognition applications to show that we can take advantage of the manifold structure to outperform the previous methods. Unlike previous heuristic approaches, we show that our method yields provable performance bounds.

Connected through hyperedge HE-1 (induced by source paper "online learning a comprehensive survey"):
  with members:
    - "continual lifelong learning with neural networks a review"
    - "a survey of multi view representation learning"
    - "provably optimal algorithms for generalized linear contextual bandits"
    - "online deep learning learning deep neural networks on the fly"
    - "an online hierarchical algorithm for extreme clustering"
    - "the scaling limit of high dimensional online independent component analysis"
    - "efficient second order online learning by sketching"
    - "a framework of sparse online learning and its applications"

Connected through hyperedge HE-2 (induced by source paper "fast video classification via adaptive cascading of deep models"):
  with members:
    - "places an image database for deep scene understanding"
    - "xnor net imagenet classification using binary convolutional neural networks"
    - "quantized neural networks training neural networks with low precision weights and activations"
    - "deep compression compressing deep neural networks with pruning trained quantization and huffman coding"
    - "learning both weights and connections for efficient neural networks"
    - "going deeper with convolutions"
    - "very deep convolutional networks for large scale image recognition"
    - "caffe convolutional architecture for fast feature embedding"

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)