{"as_of":"2026-08-09T15:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ffebba7e8c301ab67ebd85c70905e57c3129b5db7dadd52d4250661b3bab0098","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T04:15:29.069142Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T20:55:03.877322Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":"1907.04840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-06-30T20:55:03.877322Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":"850ca6bd-56a0-41f3-a463-0be214027b48","year":2019},"citing_paper":{"arxiv_id":"2208.07339","last_updated":"2022-11-10T18:14:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-08-15T17:08:50Z","title":"LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-13T13:35:35.972596Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2208.07339"},"observation_digest":"sha256:d29e6b19e9200f8be2d04de75e3042220b6315c72717568d8c39712106085a67","observation_id":"d44d0bd7-bf8f-4a77-aee8-b1febe115aa9","resolution":{"observed_at":"2026-05-13T13:35:36.064754Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-08-09T04:15:29.069142Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2502.03658","last_updated":"2025-02-05T22:56:55Z","snapshot_observed_at":"2026-08-09T04:10:24.119920Z","submitted_at":"2025-02-05T22:56:55Z","title":"Advancing Weight and Channel Sparsification with Enhanced Saliency","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T04:15:29.069142Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2502.03658"},"observation_digest":"sha256:73bc812e50f82a9e30046a2c12f1c6bc9f4d6e6fe6e5d29f9b1fccf1ae18ddaf","observation_id":"092b9acf-139e-42e5-9168-c6922994809d","resolution":{"observed_at":"2026-08-09T04:15:29.069142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-08-07T14:44:12.949488Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance , 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.17909","last_updated":"2025-05-23T13:53:21Z","snapshot_observed_at":"2026-08-07T18:19:48.354728Z","submitted_at":"2025-05-23T13:53:21Z","title":"NeuroTrails: Training with Dynamic Sparse Heads as the Key to Effective Ensembling","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T14:44:12.949488Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2505.17909"},"observation_digest":"sha256:053df9cadfdb16530d5b1d23800f09822abdc74453db884343505f3077c54a38","observation_id":"61f28856-7849-4afc-b622-6ef12bb32ca3","resolution":{"observed_at":"2026-08-07T14:44:12.949488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-08-07T05:27:08.126151Z","title":"arXiv preprint arXiv:1907.04840 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.07975","last_updated":"2025-06-09T17:49:29Z","snapshot_observed_at":"2026-08-07T18:19:50.414250Z","submitted_at":"2025-06-09T17:49:29Z","title":"Hyperpruning: Efficient Search through Pruned Variants of Recurrent Neural Networks Leveraging Lyapunov Spectrum","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T05:27:08.126151Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2506.07975"},"observation_digest":"sha256:0aae9b2a48c99c3919189ce74ff3ca40815e774ad288bb6d9cbf5ffadb0f808c","observation_id":"c7446cd7-0245-4e81-867b-7c8c54889992","resolution":{"observed_at":"2026-08-07T05:27:08.126151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-08-05T18:02:29.743385Z","title":"Dettmers and L","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:29.743385Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:4976bd07f45abaaa3bbd4dd013b3848b5ac0f881cd8679c1312b6b62b0ec1b65","observation_id":"4d0450fb-c953-4cc6-b83f-f79876816ae7","resolution":{"observed_at":"2026-08-05T18:02:29.743385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":"1907.04840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-06-30T20:55:03.877322Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":"850ca6bd-56a0-41f3-a463-0be214027b48","year":2019},"citing_paper":{"arxiv_id":"2605.07136","last_updated":"2026-05-08T02:13:14Z","snapshot_observed_at":"2026-07-06T23:19:30.387067Z","submitted_at":"2026-05-08T02:13:14Z","title":"On a stochastic column-block bregman method for nonlinear systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-11T01:55:38.874015Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2605.07136"},"observation_digest":"sha256:27bc62fa2dfdc9dcd1290ef3e16e321e9db085928da162937d63136be150e86c","observation_id":"412d8cbb-ef24-4f83-a906-6d48bd4cb4b1","resolution":{"observed_at":"2026-05-11T04:05:59.941105Z","resolver_source":"arxiv_id","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":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":"1907.04840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-06-30T20:55:03.877322Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":"850ca6bd-56a0-41f3-a463-0be214027b48","year":2019},"citing_paper":{"arxiv_id":"2605.07892","last_updated":"2026-05-20T15:23:22Z","snapshot_observed_at":"2026-07-06T23:20:11.042952Z","submitted_at":"2026-05-08T15:37:24Z","title":"Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-11T03:27:40.899805Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2605.07892"},"observation_digest":"sha256:e8992f5f5603c3612eb93063b327b037254b57f3d4b3625e0aa40d253ed42f6b","observation_id":"b5c447b7-b381-46f2-b2be-f0943c5f12f7","resolution":{"observed_at":"2026-05-11T03:30:55.854559Z","resolver_source":"arxiv_id","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":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":"1907.04840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-06-30T20:55:03.877322Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":"850ca6bd-56a0-41f3-a463-0be214027b48","year":2019},"citing_paper":{"arxiv_id":"2605.07892","last_updated":"2026-05-20T15:23:22Z","snapshot_observed_at":"2026-07-06T23:20:11.042952Z","submitted_at":"2026-05-08T15:37:24Z","title":"Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T18:12:48.049175Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2605.07892"},"observation_digest":"sha256:f2e1fcd73c86bf4355d21acd1cc83ee95bd8aba0e54b7493196ce57d312e70f6","observation_id":"786b751b-0065-4339-95c8-137f4cbf3828","resolution":{"observed_at":"2026-05-19T18:13:10.053995Z","resolver_source":"arxiv_id","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":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":"1907.04840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-06-30T20:55:03.877322Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":"850ca6bd-56a0-41f3-a463-0be214027b48","year":2019},"citing_paper":{"arxiv_id":"2605.07892","last_updated":"2026-05-20T15:23:22Z","snapshot_observed_at":"2026-07-06T23:20:11.042952Z","submitted_at":"2026-05-08T15:37:24Z","title":"Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T08:03:52.241338Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2605.07892"},"observation_digest":"sha256:1d83079f8a3729746b48fb5c7089addab5986cdce955f9d14040381201aef15a","observation_id":"adda466a-6d86-4e98-a4e5-2eb34a74c0a0","resolution":{"observed_at":"2026-05-21T08:04:02.519702Z","resolver_source":"arxiv_id","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":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":"1907.04840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-06-30T20:55:03.877322Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":"850ca6bd-56a0-41f3-a463-0be214027b48","year":2019},"citing_paper":{"arxiv_id":"2605.15435","last_updated":"2026-06-10T14:59:35Z","snapshot_observed_at":"2026-07-06T23:26:41.848219Z","submitted_at":"2026-05-14T21:27:38Z","title":"On the Stability of Growth in Structural Plasticity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T15:38:00.503752Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2605.15435"},"observation_digest":"sha256:45b2bf057737c06c9d99a4e54ca4cf5e2f62887abc9adc38e56383f18d54cc6a","observation_id":"074eab8e-02f4-4a74-a5be-74ff098f7efd","resolution":{"observed_at":"2026-05-19T15:42:38.770072Z","resolver_source":"arxiv_id","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":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":"1907.04840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-06-30T20:55:03.877322Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":"850ca6bd-56a0-41f3-a463-0be214027b48","year":2019},"citing_paper":{"arxiv_id":"2605.15435","last_updated":"2026-06-10T14:59:35Z","snapshot_observed_at":"2026-07-06T23:26:41.848219Z","submitted_at":"2026-05-14T21:27:38Z","title":"On the Stability of Growth in Structural Plasticity","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T20:53:15.045006Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2605.15435"},"observation_digest":"sha256:b82ab4bfe68d74e9bc098de3d4a8e6f0701583618e78f93670fede557ae7cb29","observation_id":"b5e63f17-24dd-4cbd-9e4d-39dd80351fc7","resolution":{"observed_at":"2026-06-30T20:55:03.878944Z","resolver_source":"arxiv_id","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":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":"1907.04840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-06-30T20:55:03.877322Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":"850ca6bd-56a0-41f3-a463-0be214027b48","year":2019},"citing_paper":{"arxiv_id":"2606.00888","last_updated":"2026-05-30T20:47:45Z","snapshot_observed_at":"2026-07-29T19:50:06.499856Z","submitted_at":"2026-05-30T20:47:45Z","title":"Memory-Efficient LLM Training with Dynamic Sparsity: From Stability to Practical Scaling","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-28T18:53:56.439861Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2606.00888"},"observation_digest":"sha256:94781c9169530e053008f18aba543aa1d46d3c5528c947a0168df78e0d719f4b","observation_id":"a25ccc81-1e6d-494c-8c39-54ba69cbdc1b","resolution":{"observed_at":"2026-06-28T19:42:36.006011Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-08-01T21:39:31.513634Z","title":"Sparse Networks from Scratch: Faster Training Without Losing Performance,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2607.16027","last_updated":"2026-07-17T14:59:33Z","snapshot_observed_at":"2026-08-01T21:39:25.454679Z","submitted_at":"2026-07-17T14:59:33Z","title":"Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraints","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T21:39:31.513634Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2607.16027"},"observation_digest":"sha256:e60ff3c74b1fee3a75783c170961f52902db4b289e4dfe0d00d20dca47706f5d","observation_id":"24fc2588-9a05-4684-ad76-0846ddec7a84","resolution":{"observed_at":"2026-08-01T21:39:31.513634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-07-30T21:23:27.884957Z","title":"Dettmers and L","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23474","last_updated":"2026-07-26T05:58:23Z","snapshot_observed_at":"2026-08-05T02:48:41.426922Z","submitted_at":"2026-07-26T05:58:23Z","title":"Sparse Gaussian-Mixture-Model Q-Functions via Hadamard Overparametrization for Online Reinforcement Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-30T21:23:27.884957Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2607.23474"},"observation_digest":"sha256:187c45adee938ea309785fcbe214c67416c0f19880ef7330ea97d8b2d3f75da2","observation_id":"4664cd13-8524-4b23-b102-b47e66835fe2","resolution":{"observed_at":"2026-07-30T21:23:27.884957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1907.04840/citation-record","integrity":"/paper/1907.04840/integrity","json":"/paper/1907.04840/citation-record.json","paper":"/paper/1907.04840"},"outbound":[],"paper":{"arxiv_id":"1907.04840","last_updated":"2019-08-23T18:30:16Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:1907.04840."}