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 "probabilistic binary neural networks"):
  Abstract: Low bit-width weights and activations are an effective way of combating the increasing need for both memory and compute power of Deep Neural Networks. In this work, we present a probabilistic training method for Neural Network with both binary weights and activations, called BLRNet. By embracing stochasticity during training, we circumvent the need to approximate the gradient of non-differentiable functions such as sign(), while still obtaining a fully Binary Neural Network at test time. Moreover, it allows for anytime ensemble predictions for improved performance and uncertainty estimates by sampling from the weight distribution. Since all operations in a layer of the BLRNet operate on random variables, we introduce stochastic versions of Batch Normalization and max pooling, which transfer well to a deterministic network at test time. We evaluate the BLRNet on multiple standardized benchmarks.

Includes members:
  Member "training wide residual networks for deployment using a single bit for each weight":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sparse weight activation training")
  Member "towards accurate binary convolutional neural network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sparse weight activation training")
  Member "learning discrete weights using the local reparameterization trick":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "propagating asymptotic estimated gradients for low bitwidth quantized neural networks")
  Member "attacking binarized neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust binary classification with the 01 loss")
  Member "the concrete distribution a continuous relaxation of discrete random variables":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "domain decluttering simplifying images to mitigate synthetic real domain shift and improve depth estimation")
  Member "wide residual networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning representations by predicting bags of visual words")
  Member "deep compression compressing deep neural networks with pruning trained quantization and huffman coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "batch normalization accelerating deep network training by reducing internal covariate shift":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "discrimination aware network pruning for deep model compression")

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.LG(Machine Learning)