{"as_of":"2026-08-15T16:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:746c040158ae244b063b4387feacfa4b079c78c65f5b63ee11434e8bf6c5ce3d","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:14:41.917317Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2501.15592/citation-record","integrity":"/paper/2501.15592/integrity","json":"/paper/2501.15592/citation-record.json","paper":"/paper/2501.15592"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1903.11257","last_updated":"2019-04-02T17:23:08Z","snapshot_observed_at":"2026-08-14T16:56:12.110283Z","submitted_at":"2019-03-27T05:43:33Z","title":"How Can We Be So Dense? The Benefits of Using Highly Sparse Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.11257","snapshot_observed_at":"2026-08-10T14:14:41.671237Z","title":"arXiv preprint arXiv:1903.11257 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.671237Z"},"links":{"cited_paper":"/paper/1903.11257","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:d17d22eb97f230232992516d9e5284b7c052ade2f0c3bcaeff295e773f03e934","observation_id":"d86cfb94-f928-4f50-9229-e893565ae128","resolution":{"observed_at":"2026-08-10T14:14:41.671237Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:41.682383Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.682383Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:c0c97b7798da2c5a43428a8aea0a23965e4093a43fdd6abacf08c88f0972e30d","observation_id":"79fb29c4-be13-4873-adde-033444bdba0b","resolution":{"observed_at":"2026-08-10T14:14:41.682383Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.717247Z","title":"Advances in Neural Information Processing Systems34, 19637–19651 (2021)","venue":null,"work_id":"ae9b43b9-d914-4d46-9d29-f986cbc93a4a","year":2021},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.693642Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:aed5475b4d04712574c7ee25dcaf8fe03926c996743605d0c9ad43e782f854d7","observation_id":"4eb8acca-dd5d-43d7-8137-013280b0dc96","resolution":{"observed_at":"2026-08-10T14:14:42.721652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:41.698975Z","title":"IEEE Signal Processing Magazine29(6), 141–142 (2012)","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.698975Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:98b63046c79c7fc19c8500937b8f76231f7f3f610660c3e4239353c360dc6840","observation_id":"9008071f-4e7b-498e-8bfd-f0c8b0ffe98d","resolution":{"observed_at":"2026-08-10T14:14:41.698975Z","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-08-14T21:54:21.093715Z","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-10T14:14:41.703667Z","title":"arXiv preprint arXiv:1907.04840 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.703667Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:62b19bb2576f168d2369f9ea3d833ed0f90ac25a23a6f6b88aeb2b614abcf6f8","observation_id":"20890308-6464-4983-8af3-e444ac135180","resolution":{"observed_at":"2026-08-10T14:14:41.703667Z","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":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.692115Z","title":"CoRR (2023),http://arxiv.org/abs/2302","venue":null,"work_id":"eae5cf7b-20ca-48d6-8a8a-2d68fc85d235","year":2023},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.711742Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:31a07e15f953e8ba9ef48a883613e52d7809fa7b579cd732052da3a67c10984a","observation_id":"3a808a61-2155-46df-a9fb-9df43832a2c8","resolution":{"observed_at":"2026-08-10T14:14:42.696109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.678401Z","title":"In: International conference on machine learning","venue":null,"work_id":"3ccfc98c-40b8-47ee-a853-9d32b2705fb3","year":null},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.718871Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:dd4829166f9f836a47aa838ab265f309d26d62a6f94d4ec62206aaa5220a6630","observation_id":"1d8a9ba1-7d3d-41a4-83ec-8726862da192","resolution":{"observed_at":"2026-08-10T14:14:42.682619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.662752Z","title":null,"venue":null,"work_id":"a045ca96-186d-496f-93a8-7efe49068f27","year":2020},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.724962Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:f277ce117638c0b5f737a91c398fd432b5e9a79c9a570f11a4593e120f1d1d4e","observation_id":"e05af6bf-f0e5-4b58-9203-d886588d78c3","resolution":{"observed_at":"2026-08-10T14:14:42.667816Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03635","last_updated":"2019-03-04T15:51:11Z","snapshot_observed_at":"2026-08-14T19:37:43.556604Z","submitted_at":"2018-03-09T18:51:28Z","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.03635","snapshot_observed_at":"2026-08-10T14:14:41.729887Z","title":"CoRR (2018),http://arxiv.org/abs/1803.03635v5","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.729887Z"},"links":{"cited_paper":"/paper/1803.03635","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:5813102e0f57358de559b442c64954f1b7726b524a4ee748f3bf2160fbf037f1","observation_id":"8ce4464d-4b79-4143-8af3-973b624a61f1","resolution":{"observed_at":"2026-08-10T14:14:41.729887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.05671","last_updated":"2020-07-18T20:31:17Z","snapshot_observed_at":"2026-08-15T06:34:50.795032Z","submitted_at":"2019-12-11T22:22:21Z","title":"Linear Mode Connectivity and the Lottery Ticket Hypothesis","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.05671","snapshot_observed_at":"2026-08-10T14:14:41.734315Z","title":"CoRR (2019),http://arxiv.org/abs/1912.05671v4","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.734315Z"},"links":{"cited_paper":"/paper/1912.05671","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:fcf871ebbe51d437f659ac813724cffd44f703135e30ddf27c051cb74a4bcdd5","observation_id":"59c3dad0-9344-4760-831a-c0a1eb763254","resolution":{"observed_at":"2026-08-10T14:14:41.734315Z","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-14T17:07:27.646862Z","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-10T14:14:41.740219Z","title":"CoRR (2019),http://arxiv.org/abs/1903.01611v3","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.740219Z"},"links":{"cited_paper":"/paper/1903.01611","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:265e8bd7a6c59655d2a11db216358b5684645e074071f16776d08cffccf4df8d","observation_id":"e7c07022-b667-42f4-b4d3-d615600de1fe","resolution":{"observed_at":"2026-08-10T14:14:41.740219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.12463","last_updated":"2021-12-17T21:44:23Z","snapshot_observed_at":"2026-07-06T09:31:35.184904Z","submitted_at":"2020-06-22T17:45:16Z","title":"Slimming Neural Networks using Adaptive Connectivity Scores","version":3},"cited_work":{"arxiv_id":"2006.12463","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.12463","snapshot_observed_at":"2026-08-10T14:14:42.200743Z","title":"Slimming Neural Networks using Adaptive Connectivity Scores","venue":"cs.CV","work_id":"75ba44b3-197e-4779-8dd0-308caace94c5","year":2020},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.745999Z"},"links":{"cited_paper":"/paper/2006.12463","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:7eccd57b53252ccf409e78e5dc1d56f3a20df881b95cf826db6ffad583e1f9ef","observation_id":"79597dd2-7dd2-436b-863d-f9f9e51eca27","resolution":{"observed_at":"2026-08-10T14:14:42.207689Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.643926Z","title":"IEEE Transactions on Neural Networks and Learning Systems (2022)","venue":null,"work_id":"7c48b828-fc75-4c83-90ed-a7fab7c24269","year":2022},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.750951Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:047c956eaa0af003af374d42897460507f7e9daf6a9055d8d2bfda3da1e6a4d4","observation_id":"e6a83215-894b-4fea-a389-56e57aae7b08","resolution":{"observed_at":"2026-08-10T14:14:42.648280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.624743Z","title":"IEEE transactions on neural networks and learning systems 35(3), 3794–3808 (2024)","venue":null,"work_id":"278821e1-e917-4dc7-9a9d-8e8f21c13e10","year":2024},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.755319Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:78ef5bd7f825634f2d8c3bc423a13b9465050c9195e682eb5d46e8e15c60ea05","observation_id":"3c7a43d4-b3f7-4044-a0d0-47ba0360ac96","resolution":{"observed_at":"2026-08-10T14:14:42.630214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.610801Z","title":"In: 2020 25th International Conference on Pattern Recognition (ICPR)","venue":null,"work_id":"2a1ab363-1de4-4757-a6c1-8133236ebdc3","year":2021},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.759929Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:ed6d154abfdf54b126dd8ae044f25075b75d8d6008a0ae17b8635b0031e2e0ee","observation_id":"1afd29d7-d38e-436c-980c-0c9a90718e02","resolution":{"observed_at":"2026-08-10T14:14:42.615578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02623","last_updated":"2020-10-06T11:04:17Z","snapshot_observed_at":"2026-08-15T15:16:29.407080Z","submitted_at":"2020-10-06T11:04:17Z","title":"Comprehensive Online Network Pruning via Learnable Scaling Factors","version":1},"cited_work":{"arxiv_id":"2010.02623","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.02623","snapshot_observed_at":"2026-08-10T14:14:42.177708Z","title":"Comprehensive Online Network Pruning via Learnable Scaling Factors","venue":"cs.CV","work_id":"0d462692-1357-4699-8337-4c6eb1cb4444","year":2020},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.763747Z"},"links":{"cited_paper":"/paper/2010.02623","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:c90d7fc7e04ee01a5bc8c7621ffc0b81d4299b2b37401a45619a10d7a8e2dd63","observation_id":"2f8900ae-59ee-43d4-b744-5b3c276ac4d7","resolution":{"observed_at":"2026-08-10T14:14:42.182137Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02626","last_updated":"2015-10-30T23:29:27Z","snapshot_observed_at":"2026-08-15T13:34:24.234242Z","submitted_at":"2015-06-08T19:28:43Z","title":"Learning both Weights and Connections for Efficient Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.02626","snapshot_observed_at":"2026-08-10T14:14:41.768916Z","title":"CoRR (2015),http://arxiv.org/abs/1506.02626v3","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.768916Z"},"links":{"cited_paper":"/paper/1506.02626","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:a5fb225f8efd133d725c084370725276047d59a2dae313bedafcc8b3408fc8b4","observation_id":"1f7e0f5a-52c3-4548-9a3b-934f024b581a","resolution":{"observed_at":"2026-08-10T14:14:41.768916Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:41.773797Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.773797Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:2ec3883e3d538d2a95fd731be64ed9fa9c8c50da275da35544636cbc07a595c0","observation_id":"1c71893c-9364-4699-9402-695064cfabef","resolution":{"observed_at":"2026-08-10T14:14:41.773797Z","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":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.582490Z","title":"IEEE Signal processing magazine29(6), 82–97 (2012)","venue":null,"work_id":"f2d8a122-e3fb-45da-a925-1b0a29f02caa","year":2012},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.779306Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:528119622d70faa83f333b65ebc082118756a0c9a993d633bf30372b51471339","observation_id":"dbeee569-0da4-4b80-8a78-5d734a258731","resolution":{"observed_at":"2026-08-10T14:14:42.587673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.03250","last_updated":"2016-07-12T07:43:01Z","snapshot_observed_at":"2026-08-14T21:48:49.266532Z","submitted_at":"2016-07-12T07:43:01Z","title":"Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.03250","snapshot_observed_at":"2026-08-10T14:14:41.784950Z","title":"arXiv preprint arXiv:1607.03250 (2016)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.784950Z"},"links":{"cited_paper":"/paper/1607.03250","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:26bfbcbcbf24554dd3a49f3be419fc6bc4a038d7db268934f6f31e58183dd079","observation_id":"22a78d37-02c9-47b7-8fd7-17370f138684","resolution":{"observed_at":"2026-08-10T14:14:41.784950Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:41.789553Z","title":"In: International conference on machine learning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.789553Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:edfb2a614152845ffb148f43c015f82c9bc61eb0406824c6be4b040a29e7da08","observation_id":"000a4cba-1e97-4d0b-9a5b-29fc7a9ea5d9","resolution":{"observed_at":"2026-08-10T14:14:41.789553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.05983","last_updated":"2020-10-17T22:38:21Z","snapshot_observed_at":"2026-08-14T00:35:20.399902Z","submitted_at":"2020-10-12T19:18:27Z","title":"How does Weight Correlation Affect the Generalisation Ability of Deep Neural Networks","version":3},"cited_work":{"arxiv_id":"2010.05983","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.05983","snapshot_observed_at":"2026-08-10T14:14:42.104718Z","title":"How does Weight Correlation Affect the Generalisation Ability of Deep Neural Networks","venue":"cs.LG","work_id":"7c225348-e5d7-4570-930f-b2040fdea877","year":2020},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.797093Z"},"links":{"cited_paper":"/paper/2010.05983","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:50e4e7ded273fb671ea06cff2376ef26066178421ebafa6198bb249393f26ce9","observation_id":"4016c478-e03a-4b7e-91e1-92b619fb592d","resolution":{"observed_at":"2026-08-10T14:14:42.110669Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.557927Z","title":"Un- published manuscript 40(7), 1–9 (2010)","venue":null,"work_id":"12ac0146-1213-4f2d-8f50-a6837f09e2c2","year":2010},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.802858Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:b1d7cd1db11706feb6213665cccd2dda840b75a041b9c2c9110d7d9bb8a45e3b","observation_id":"c988738d-c705-4980-bc8c-0b8226983511","resolution":{"observed_at":"2026-08-10T14:14:42.562162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:41.808736Z","title":"Advances in neural information processing systems25 (2012)","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.808736Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:eb961d698aeb1f5887adfde3d0dc00ee2fab573174e72713d535536bde33389f","observation_id":"697ec7b9-5b50-42e2-9540-939117c8853c","resolution":{"observed_at":"2026-08-10T14:14:41.808736Z","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":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.529371Z","title":"Advances in neural infor- mation processing systems2 (1989)","venue":null,"work_id":"de6e8612-ace3-426a-a79a-73881efa4014","year":1989},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.812850Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:0eb863bc197faad819af6da0e78a025525c620876480076010df4f3ca57865b6","observation_id":"6caceb81-9ce1-43b4-b176-643e99b07a64","resolution":{"observed_at":"2026-08-10T14:14:42.536046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.02340","last_updated":"2019-02-23T07:45:29Z","snapshot_observed_at":"2026-08-14T18:19:22.875247Z","submitted_at":"2018-10-04T17:39:58Z","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.02340","snapshot_observed_at":"2026-08-10T14:14:41.817461Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.817461Z"},"links":{"cited_paper":"/paper/1810.02340","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:790853ed18b3e008dfb2cca0f6ef83fe60ecc6cd5a0f9f170e2e1fa8455e1d1b","observation_id":"aa772f36-0610-408d-9648-43d8afd6f307","resolution":{"observed_at":"2026-08-10T14:14:41.817461Z","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":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.514549Z","title":"In: IJCAI","venue":null,"work_id":"e086757d-fbd7-4f4e-8b57-d4bf08e51fd1","year":2018},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.825330Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:311f1b1c7ae593642ff86696c18347527ed83b06185d2ac81a3a4214a1170757","observation_id":"9d17056c-e9b7-40d8-9364-c9808e03bf15","resolution":{"observed_at":"2026-08-10T14:14:42.519303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.493792Z","title":"In: Proceedings of the IEEE international conference on computer vision","venue":null,"work_id":"48b8908f-2359-4c7d-91b5-cca6a8aeea0f","year":2017},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.830482Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:ceb4e29348f7e3eb45a928cc55011a5b3661d0a0a3173ba5c256b460e4ed09b6","observation_id":"3703edf7-73a4-4808-9bc1-d45107e277db","resolution":{"observed_at":"2026-08-10T14:14:42.499970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.475180Z","title":"In: International Conference on Machine Learning","venue":null,"work_id":"3a7038c0-0d19-42c1-bb87-68f8a62b177e","year":2020},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.834694Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:266b54339cefc15f9209c2ecbdd4778ba72423475ba5839b82acbd7b3373aa0a","observation_id":"d14f04f5-0371-4ddb-996a-03ea1b0eee1c","resolution":{"observed_at":"2026-08-10T14:14:42.483133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.451356Z","title":"Advances in neural information processing systems32 (2019)","venue":null,"work_id":"dbfcf785-2ec3-4ef1-a7ba-13c84a14aafb","year":2019},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.838732Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:17d08f98487937be9574200fdf2c4939f4cb65f95c5c7ffb8aae29e7beb075fd","observation_id":"bd16c98f-01b5-4b5e-a92c-ba3597103b8f","resolution":{"observed_at":"2026-08-10T14:14:42.459050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.434855Z","title":"Ad- vances in Neural Information Processing Systems33, 2925–2934 (2020)","venue":null,"work_id":"d4efd991-c528-4348-a5e5-2bcd984fab6a","year":2020},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.843895Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:5d502f72f70ec7e2874d8c2775948440ed00d4e6934c517068fbfc2635ae3025","observation_id":"b82482f4-e3b5-40ff-a753-3195faac4919","resolution":{"observed_at":"2026-08-10T14:14:42.441155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:41.849465Z","title":"IEEE transactions on neural networks and learning systems 32(2), 604–624 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.849465Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:c7ed95ec76fd17f9d69cff9ed12dbb1dd87006183326fe4d20a61a8839aa9e8e","observation_id":"da416211-5a88-4971-9e24-fec52dd4ee66","resolution":{"observed_at":"2026-08-10T14:14:41.849465Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:41.854532Z","title":"ACM Computing Surveys (CSUR)51(5), 1–36 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.854532Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:a10fd37b0c8856f0085feba7950d81ab7529abf2cc5a3c2772e9b5c4ea06c6bf","observation_id":"69cf4818-a6b8-4f1f-a044-a1af72c3d0e7","resolution":{"observed_at":"2026-08-10T14:14:41.854532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.1556","last_updated":"2015-04-10T16:25:04Z","snapshot_observed_at":"2026-08-14T23:20:42.336514Z","submitted_at":"2014-09-04T19:48:04Z","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.1556","snapshot_observed_at":"2026-08-10T14:14:41.860185Z","title":"arXiv preprint arXiv:1409.1556 (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.860185Z"},"links":{"cited_paper":"/paper/1409.1556","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:bcef62463eb3ae5153fafc5a190a0c295aa8892b0198d631ea6d60dc5f765391","observation_id":"cc671022-2c47-41fc-99fc-cee947c10876","resolution":{"observed_at":"2026-08-10T14:14:41.860185Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:41.867360Z","title":"The journal of machine learning research15(1), 1929–1958 (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.867360Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:5f64da69443b4b9788754a2c5e67a63290cf799e30f09b473745e96586631c16","observation_id":"c0cdbe8c-088f-4d91-b666-70b0d298d103","resolution":{"observed_at":"2026-08-10T14:14:41.867360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.01670","last_updated":"2021-06-16T02:49:34Z","snapshot_observed_at":"2026-08-13T20:20:34.278639Z","submitted_at":"2021-02-02T18:40:26Z","title":"Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimization","version":2},"cited_work":{"arxiv_id":"2102.01670","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.01670","snapshot_observed_at":"2026-08-10T14:14:42.028481Z","title":"Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimization","venue":"cs.LG","work_id":"a3f30935-aba4-4b77-8142-511143fb8dfd","year":2021},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.878525Z"},"links":{"cited_paper":"/paper/2102.01670","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:6b502c36eb7bf1ba997984fe011892e8510c12680e62a6cbda3712c83748ee48","observation_id":"5f3c01de-6374-4e6e-8bbf-be6e6a525491","resolution":{"observed_at":"2026-08-10T14:14:42.036156Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.07376","last_updated":"2020-08-07T00:02:33Z","snapshot_observed_at":"2026-08-10T04:53:00.900945Z","submitted_at":"2020-02-18T05:14:47Z","title":"Picking Winning Tickets Before Training by Preserving Gradient Flow","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.07376","snapshot_observed_at":"2026-08-10T14:14:41.883552Z","title":"arXiv preprint arXiv:2002.07376 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.883552Z"},"links":{"cited_paper":"/paper/2002.07376","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:71e2c1a169df6ae65faa380fa90d8540356239426ac2ccb3ab33834c4c84c87c","observation_id":"7a7bac84-90d2-4f1c-9123-aa1d518af1f6","resolution":{"observed_at":"2026-08-10T14:14:41.883552Z","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":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.385330Z","title":"Advances in neural information processing systems29 (2016) 20 S","venue":null,"work_id":"4f3cc8d9-4a7e-4db8-91bf-eb15446ec711","year":2016},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.888061Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:12594446b64ec51cc09d4ffda98c4f8befd9afcca27d453e755324e9cbfd395d","observation_id":"7ed4389a-0450-483d-888c-64d9f636e7ca","resolution":{"observed_at":"2026-08-10T14:14:42.391023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.369308Z","title":"In: 2021 IEEE Information Theory Workshop (ITW)","venue":null,"work_id":"a6666227-aca8-4bee-ae8f-de470cc6b16d","year":2021},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.892483Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:a02971e8d05b5a149cc1840f8cd06c22454736067de75f54efe8e10879ee71b7","observation_id":"9170412d-a7ec-4d47-881d-e4fb5129ad3f","resolution":{"observed_at":"2026-08-10T14:14:42.373528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-08-13T15:13:33.081929Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-10T14:14:41.897223Z","title":"arXiv preprint arXiv:1708.07747 (2017)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.897223Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:32e7bc5b16a7cf7e1def9f4ff24e2294726249a354c5e89a54362317bd8e0cdb","observation_id":"50562adc-06fe-417f-ae6a-1aad32016149","resolution":{"observed_at":"2026-08-10T14:14:41.897223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.11957","last_updated":"2025-03-03T17:04:08Z","snapshot_observed_at":"2026-07-06T08:24:44.631342Z","submitted_at":"2019-09-26T07:43:56Z","title":"Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.11957","snapshot_observed_at":"2026-08-10T14:14:41.902656Z","title":"arXiv preprint arXiv:1909.11957 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.902656Z"},"links":{"cited_paper":"/paper/1909.11957","citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:b05798d8e5156fec95460d74d85da1d143effc22e83589a24175244b6a345c15","observation_id":"3a7ee426-8947-4888-abde-50c45dcf8a78","resolution":{"observed_at":"2026-08-10T14:14:41.902656Z","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":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.353890Z","title":"Advances in neural information processing systems32 (2019)","venue":null,"work_id":"3556dc29-99fa-43eb-8099-8bffc8d45aa1","year":2019},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.907842Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:e74c98f653d4ac51bcde0224c09740b6f700e6c6a9789bdfd096a95f9a07e422","observation_id":"fc98238a-15d2-44b2-8890-6e18ab5504c5","resolution":{"observed_at":"2026-08-10T14:14:42.360654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.334048Z","title":null,"venue":null,"work_id":"02c08788-6d41-4b7e-a0a7-d96939a2a69e","year":2018},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.912039Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:77f05276d0bc9eac71b780c9730df8ef37a8138e5a477a71747e5226ea54eb04","observation_id":"4b7b4bc2-8869-42e4-84f2-c4a93aee5f10","resolution":{"observed_at":"2026-08-10T14:14:42.339755Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:14:42.311655Z","title":"In: 202025thInternationalConferenceonPatternRecognition(ICPR).pp.3868–3875","venue":null,"work_id":"81f1fb40-8348-4fe5-8beb-bab31d7cba3b","year":2021},"citing_paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T14:14:41.917317Z"},"links":{"citing_paper":"/paper/2501.15592"},"observation_digest":"sha256:55755ae545925bf1dc93c9030a415aeadd6bcee4c3a6dfc1bc1725d514b8917a","observation_id":"d12e00c7-82a5-4baf-8318-d1fe013ae7a4","resolution":{"observed_at":"2026-08-10T14:14:42.315835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.15592","last_updated":"2025-01-26T16:40:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T13:01:51.690082Z","submitted_at":"2025-01-26T16:40:59Z","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":21,"verified_exact":1,"verified_fuzzy":18},"total_outbound_references":44},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2501.15592."}