{"as_of":"2026-08-09T16:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94f16d1e7b67ffbd07ba4c5a56b46cc8ba0875033649ef85757c9ed5f385adea","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:57:36.852954Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.00174/citation-record","integrity":"/paper/2509.00174/integrity","json":"/paper/2509.00174/citation-record.json","paper":"/paper/2509.00174"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1308.3432","last_updated":"2013-08-15T15:19:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-08-15T15:19:34Z","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1308.3432","snapshot_observed_at":"2026-08-05T13:57:34.616453Z","title":"Estimating or propagating gradients through stochastic neurons for conditional computation.arXiv:1308.3432, 2013a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:34.616453Z"},"links":{"cited_paper":"/paper/1308.3432","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:54e65f1674f5fb4a11de2a06637b8716102e1590d10d21cf83efb030af0fc6f1","observation_id":"9fc05364-e109-4600-bf5d-e0d48a621108","resolution":{"observed_at":"2026-08-05T13:57:34.616453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.01611","last_updated":"2020-07-20T16:50:33Z","snapshot_observed_at":"2026-08-04T07:40:59.947811Z","submitted_at":"2019-03-05T00:52:12Z","title":"Stabilizing the Lottery Ticket Hypothesis","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.01611","snapshot_observed_at":"2026-08-05T13:57:34.890589Z","title":"Roy, and Michael Carbin","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:34.890589Z"},"links":{"cited_paper":"/paper/1903.01611","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:a45bcecfd700f41079270df3166c8f1a9a13d8037407591df3b1bc1e8eecb754","observation_id":"6e92013f-e491-489b-922a-1c49b626b43e","resolution":{"observed_at":"2026-08-05T13:57:34.890589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.5401","last_updated":"2014-12-10T16:01:39Z","snapshot_observed_at":"2026-08-01T22:22:04.725773Z","submitted_at":"2014-10-20T19:28:26Z","title":"Neural Turing Machines","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.5401","snapshot_observed_at":"2026-08-05T13:57:35.021482Z","title":"Neural Turing Machines.arXiv:1410.5401,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.021482Z"},"links":{"cited_paper":"/paper/1410.5401","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:779cb6e3f862d3d5f3ed5520dea603ab976321739d66d9aad241cff58ce3b48d","observation_id":"d7d8a92e-f453-490f-b03a-4143977e14de","resolution":{"observed_at":"2026-08-05T13:57:35.021482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.08240","last_updated":"2018-03-22T06:25:47Z","snapshot_observed_at":"2026-07-06T06:29:37.728867Z","submitted_at":"2018-03-22T06:25:47Z","title":"An Analysis of Neural Language Modeling at Multiple Scales","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.08240","snapshot_observed_at":"2026-08-05T13:57:35.663688Z","title":"An Analysis of Neural Language Modeling at Multiple Scales.arXiv:1803.08240,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.663688Z"},"links":{"cited_paper":"/paper/1803.08240","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:5152fddfa40994645fef1677d6bbb43a1bdcade49fd6a8bace994b46b929dd5f","observation_id":"e0e26000-19ee-4c9a-8456-7007df5b50f5","resolution":{"observed_at":"2026-08-05T13:57:35.663688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.01548","last_updated":"2019-02-16T23:28:16Z","snapshot_observed_at":"2026-07-06T06:21:49.379500Z","submitted_at":"2018-02-05T18:20:52Z","title":"Regularized Evolution for Image Classifier Architecture Search","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.01548","snapshot_observed_at":"2026-08-05T13:57:35.856065Z","title":"Regularized evolution for image classifier architecture search.arXiv:1802.01548,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.856065Z"},"links":{"cited_paper":"/paper/1802.01548","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:457c2d4103b700ff9b2b5e7e702d8b3f5b96764c5e0385970ce0711be2322cb9","observation_id":"72c4007d-3bf0-43ee-b6be-6f27e5478634","resolution":{"observed_at":"2026-08-05T13:57:35.856065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06694","last_updated":"2016-11-21T09:24:24Z","snapshot_observed_at":"2026-08-09T10:26:46.602676Z","submitted_at":"2016-11-21T09:24:24Z","title":"Training Sparse Neural Networks","version":1},"cited_work":{"arxiv_id":"1611.06694","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.06694","snapshot_observed_at":"2026-08-05T13:57:37.804308Z","title":"Training Sparse Neural Networks","venue":"cs.CV","work_id":"230801f1-3585-427c-964b-bb3b8b6a04b9","year":2016},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:36.193917Z"},"links":{"cited_paper":"/paper/1611.06694","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:b1546da6733af224e28d9ea8801ca674db7dacacc8b1650ececab63bd97dab5c","observation_id":"11dcd3d5-9971-466d-acac-e083c272c802","resolution":{"observed_at":"2026-08-05T13:57:37.943742Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.02386","last_updated":"2020-09-04T20:41:47Z","snapshot_observed_at":"2026-08-09T16:48:59.612769Z","submitted_at":"2020-09-04T20:41:47Z","title":"ACDC: Weight Sharing in Atom-Coefficient Decomposed Convolution","version":1},"cited_work":{"arxiv_id":"2009.02386","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.02386","snapshot_observed_at":"2026-08-05T13:57:37.515248Z","title":"ACDC: Weight Sharing in Atom-Coefficient Decomposed Convolution","venue":"cs.CV","work_id":"400ad22b-674c-4e8c-9661-2b0da1738cfd","year":2020},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:36.291036Z"},"links":{"cited_paper":"/paper/2009.02386","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:3c449195cf4e94e6d41c4a24b38ef629303b79e6f70c101664c7dbd0360145ee","observation_id":"ff618432-1304-4976-9105-1e9f2e580f4e","resolution":{"observed_at":"2026-08-05T13:57:37.652032Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.00090","last_updated":"2018-11-30T23:15:45Z","snapshot_observed_at":"2026-07-06T07:18:22.588053Z","submitted_at":"2018-11-30T23:15:45Z","title":"Mixed Precision Quantization of ConvNets via Differentiable Neural Architecture Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.00090","snapshot_observed_at":"2026-08-05T13:57:36.397090Z","title":"Mixed precision quantization of ConvNets via differentiable neural architecture search","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:36.397090Z"},"links":{"cited_paper":"/paper/1812.00090","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:50d08f2137771b73aea69d0da6fc57c97737fd36d54c7a1a16e603806773a80a","observation_id":"bb3aded4-7eec-46bb-8ae4-f05bb8f07c04","resolution":{"observed_at":"2026-08-05T13:57:36.397090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.06160","last_updated":"2018-02-02T01:43:54Z","snapshot_observed_at":"2026-07-06T05:00:35.763958Z","submitted_at":"2016-06-20T15:02:31Z","title":"DoReFa-Net: Training Low Bitwidth Convolutional Neural Networks with Low Bitwidth Gradients","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.06160","snapshot_observed_at":"2026-08-05T13:57:36.717007Z","title":"Deconstructing lottery tickets: Zeros, signs, and the supermask.NeurIPS, 2019a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:36.717007Z"},"links":{"cited_paper":"/paper/1606.06160","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:84b3707ae7e944749466410a1e0c0d45d8973e004612d2f9777d6952fc08f08c","observation_id":"aaedc1f5-c1ec-4961-b5c7-c3c606ca1550","resolution":{"observed_at":"2026-08-05T13:57:36.717007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.01878","last_updated":"2017-11-13T18:40:16Z","snapshot_observed_at":"2026-08-05T00:54:50.482913Z","submitted_at":"2017-10-05T04:26:49Z","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.01878","snapshot_observed_at":"2026-08-05T13:57:36.852954Z","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression.arXiv:1710.01878,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:36.852954Z"},"links":{"cited_paper":"/paper/1710.01878","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:6a1ccaac3c5627017083c9b497d6a4391d12527d756cffc55869aea5c3e6e21d","observation_id":"83a8dc6f-c8ba-410f-8102-e38ead8418e4","resolution":{"observed_at":"2026-08-05T13:57:36.852954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.06763","last_updated":"2020-06-23T06:47:00Z","snapshot_observed_at":"2026-08-06T17:48:49.820786Z","submitted_at":"2018-06-18T15:17:01Z","title":"Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.06763","snapshot_observed_at":"2026-08-05T13:57:35.421758Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.421758Z"},"links":{"cited_paper":"/paper/1806.06763","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:7c08007577e62cc06d29d753d90476c6169730d75829630093b8205ef303c2d4","observation_id":"c2d172a0-7a86-44f0-b5d2-94bbff2dc5fd","resolution":{"observed_at":"2026-08-05T13:57:35.421758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07785","last_updated":"2019-12-16T21:17:07Z","snapshot_observed_at":"2026-07-06T07:54:02.817335Z","submitted_at":"2019-05-19T17:48:29Z","title":"Sparse Transfer Learning via Winning Lottery Tickets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07785","snapshot_observed_at":"2026-08-05T13:57:35.559651Z","title":"Sparse transfer learning via winning lottery tickets.arXiv:1905.07785,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.559651Z"},"links":{"cited_paper":"/paper/1905.07785","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:6597d61e526011ef23954648879f1d4bb0a41e1e6039efca97f6ec6436ac7cf6","observation_id":"7e4bea02-ccef-4d1a-bf1b-b7c27d79e700","resolution":{"observed_at":"2026-08-05T13:57:35.559651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04861","last_updated":"2017-04-17T03:57:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-04-17T03:57:34Z","title":"MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04861","snapshot_observed_at":"2026-08-05T13:57:35.191886Z","title":"MobileNets: Efficient convolutional neural networks for mobile vision applications.arXiv:1704.04861,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.191886Z"},"links":{"cited_paper":"/paper/1704.04861","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:c389daec1b5b38d450914935f7c006edda08f0dcc5cacaeb98dd909104a600ef","observation_id":"09a6d683-47db-4123-8f51-ba99a1d71725","resolution":{"observed_at":"2026-08-05T13:57:35.191886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.01025","last_updated":"2016-03-17T03:32:30Z","snapshot_observed_at":"2026-07-06T04:48:11.215166Z","submitted_at":"2016-03-03T08:51:52Z","title":"Convolutional Neural Networks using Logarithmic Data Representation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.01025","snapshot_observed_at":"2026-08-05T13:57:35.779020Z","title":"Lee, and Boris Murmann","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.779020Z"},"links":{"cited_paper":"/paper/1603.01025","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:e4c701ffd21171698693fe16d5a360c940f2d38227dd351cca2bb2b0f3071d7f","observation_id":"1ae6852a-ccee-4044-bc72-8725fde25988","resolution":{"observed_at":"2026-08-05T13:57:35.779020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.10462","last_updated":"2021-02-20T22:37:41Z","snapshot_observed_at":"2026-07-06T10:43:11.902082Z","submitted_at":"2021-02-20T22:37:41Z","title":"BSQ: Exploring Bit-Level Sparsity for Mixed-Precision Neural Network Quantization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.10462","snapshot_observed_at":"2026-08-05T13:57:36.490033Z","title":"BSQ: Exploring bit-level sparsity for mixed-precision neural network quantization.arXiv:2102.10462,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:36.490033Z"},"links":{"cited_paper":"/paper/2102.10462","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:517ee7437751f0302497a6005baca39078161d0177623013eee994fa234e445f","observation_id":"5152e8ec-9aa5-4317-afd1-5cc89cccb23c","resolution":{"observed_at":"2026-08-05T13:57:36.490033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.09106","last_updated":"2016-12-01T10:08:15Z","snapshot_observed_at":"2026-08-08T11:39:44.107967Z","submitted_at":"2016-09-27T05:57:00Z","title":"HyperNetworks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.09106","snapshot_observed_at":"2026-08-05T13:57:35.112842Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.112842Z"},"links":{"cited_paper":"/paper/1609.09106","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:e1bedfe0bc12ae2b54eaffde49108e53c7987d2861c6821960872d02fe1c5929","observation_id":"818d77c7-3f42-4f6e-b14d-71ac830bbe59","resolution":{"observed_at":"2026-08-05T13:57:35.112842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07360","last_updated":"2016-11-04T21:26:08Z","snapshot_observed_at":"2026-07-06T04:47:10.710916Z","submitted_at":"2016-02-24T00:09:45Z","title":"SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model size","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07360","snapshot_observed_at":"2026-08-05T13:57:35.297762Z","title":"Iandola, Matthew W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.297762Z"},"links":{"cited_paper":"/paper/1602.07360","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:ebf1003aaeffcbde87f0ca3a343ef3e478ca3c126c87999f3fbb542d36bc655b","observation_id":"6e76c9ef-6437-4aa1-ab12-afd580dfdab2","resolution":{"observed_at":"2026-08-05T13:57:35.297762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.04457","last_updated":"2019-12-10T06:34:54Z","snapshot_observed_at":"2026-08-06T01:02:39.814751Z","submitted_at":"2019-08-13T02:00:21Z","title":"On the Convergence of AdaBound and its Connection to SGD","version":2},"cited_work":{"arxiv_id":"1908.04457","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.04457","snapshot_observed_at":"2026-08-05T13:57:38.358306Z","title":"On the Convergence of AdaBound and its Connection to SGD","venue":"cs.LG","work_id":"63988680-88b9-4165-ad6b-63d865a1337b","year":2019},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:35.963314Z"},"links":{"cited_paper":"/paper/1908.04457","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:069dc9fc7d3be8a97e75d5d80bcb00371bf46203666b998ea063aaed34e6d178","observation_id":"90d5a40c-5dde-4de9-9cc2-382e006f9ebf","resolution":{"observed_at":"2026-08-05T13:57:38.460159Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.06085","last_updated":"2018-07-17T07:33:19Z","snapshot_observed_at":"2026-07-06T06:39:21.688392Z","submitted_at":"2018-05-16T01:19:43Z","title":"PACT: Parameterized Clipping Activation for Quantized Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.06085","snapshot_observed_at":"2026-08-05T13:57:34.785017Z","title":"PACT: Parameterized clipping activation for quantized neural networks.arXiv:1805.06085,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:34.785017Z"},"links":{"cited_paper":"/paper/1805.06085","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:4ca9ca56b96ff191335cae73e032e2960011fcb140f58582fa49d52a13998f94","observation_id":"1f87b3bb-d797-4ab7-9c81-7afbcd7ad5f2","resolution":{"observed_at":"2026-08-05T13:57:34.785017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2311.14114","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:57:37.198653Z","title":"SySMOL: Co-designing Algorithms and Hardware for Neural Networks with Heterogeneous Precisions.arXiv:2311.14114,","venue":null,"work_id":"02cdf819-b075-4c3a-ba62-49acb7600aa2","year":null},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:36.612187Z"},"links":{"citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:e899f0b01e3ed0057c616a564bc7542e6a110ebb44a84798941259c6257f2f36","observation_id":"645d239d-ce9d-4511-ba55-c127e1744375","resolution":{"observed_at":"2026-08-05T13:57:37.310875Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.11532","last_updated":"2024-09-15T12:55:03Z","snapshot_observed_at":"2026-08-02T23:13:26.119395Z","submitted_at":"2023-11-20T04:34:19Z","title":"Fine-Tuning Adaptive Stochastic Optimizers: Determining the Optimal Hyperparameter $\\epsilon$ via Gradient Magnitude Histogram Analysis","version":2},"cited_work":{"arxiv_id":"2311.11532","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.11532","snapshot_observed_at":"2026-08-05T13:57:38.110899Z","title":"Fine-Tuning Adaptive Stochastic Optimizers: Determining the Optimal Hyperparameter $\\epsilon$ via Gradient Magnitude Histogram Analysis","venue":"cs.LG","work_id":"c6cfb10a-8fb9-452c-858d-4bc15d3cd14b","year":2023},"citing_paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T13:57:36.062282Z"},"links":{"cited_paper":"/paper/2311.11532","citing_paper":"/paper/2509.00174"},"observation_digest":"sha256:356ca94e8e6a018b2c3d91bb5aa3d840298b46701457c6e3bf47bac8a015a10c","observation_id":"9b06ed01-156f-4926-bf31-cda756e3bb3c","resolution":{"observed_at":"2026-08-05T13:57:38.255194Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.00174","last_updated":"2025-09-13T17:01:49Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T08:42:35.761087Z","submitted_at":"2025-08-29T18:17:48Z","title":"Principled Approximation Methods for Efficient and Scalable Deep Learning"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2509.00174."}