{"as_of":"2026-08-09T13:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a2e6cac3ef5fa335903879044c331c6cc4c1cb068ce594bdb23fef95679e9ca","coverage":[{"denominator":76,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":76,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:54:53.370784Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T05:26:06.829382Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.06866","snapshot_observed_at":"2026-07-13T05:26:06.829382Z","title":"Safe: Finding sparse and flat minima to improve pruning.arXiv preprint arXiv:2506.06866, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08968","last_updated":"2026-07-09T22:09:16Z","snapshot_observed_at":"2026-08-09T10:00:22.541985Z","submitted_at":"2026-07-09T22:09:16Z","title":"Every Sample Counts: Supervised Fine-Tuning of Language Models with Pointwise Constraints","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-13T05:26:06.829382Z"},"links":{"cited_paper":"/paper/2506.06866","citing_paper":"/paper/2607.08968"},"observation_digest":"sha256:39a015bbaeffc297df4a8092da426926eaa20afd82c4cb57dce996f19766b36f","observation_id":"c68a2ede-e2a1-4ade-89d5-77c11c23f7e7","resolution":{"observed_at":"2026-07-13T05:26:06.829382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.06866/citation-record","integrity":"/paper/2506.06866/integrity","json":"/paper/2506.06866/citation-record.json","paper":"/paper/2506.06866"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.105306Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.105306Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:3b2fc4b55459c7e20dc7da1c27aa3888a79f439d345d9f5b52e1b3f536b62150","observation_id":"190da46c-a9ec-4f4a-8d67-f82b4b811f19","resolution":{"observed_at":"2026-08-07T05:54:53.105306Z","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-07T05:54:54.167804Z","title":"A modern look at the relationship between sharpness and generalization","venue":null,"work_id":"4c5845b0-938c-4c16-9bce-fd52de2193a1","year":2023},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.110734Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:8b37ed397a3772e658d6e500f5931ce4e38cfab65a483d79b57d07aa9cea060f","observation_id":"773e7635-b35f-4974-a97b-dad4c7dcc624","resolution":{"observed_at":"2026-08-07T05:54:54.171304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.157644Z","title":"Z., and Raghunathan, A","venue":null,"work_id":"1290afd1-0faf-4624-afde-27435c50d2ef","year":2024},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.114491Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:578b52a9cdf4a9dca18a3a1e672b7446c6b5ac0a3dc290e023242479c41c1e57","observation_id":"b45bcd75-1827-4650-a5a5-7e55eddb9839","resolution":{"observed_at":"2026-08-07T05:54:54.161030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.146935Z","title":"Sharpness-aware minimization improves language model generalization","venue":null,"work_id":"e7a4ce12-a144-4d77-821a-89f1edefa733","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.118243Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:d3b3848c2cc5474991a700214dc8e7cccac4afc4d80bea3bc7c84b7146206763","observation_id":"38432d14-5e7f-48b2-b29f-88b690e93ec4","resolution":{"observed_at":"2026-08-07T05:54:54.150850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.135470Z","title":"Adaptive sharpness-aware pruning for robust sparse networks","venue":null,"work_id":"06396e00-6785-4de4-8c83-0f830fbc6dd4","year":2023},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.122438Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:22d0fcb619e36e7006e426a87fa0f22432c8cac159a0ad507c492313968c124e","observation_id":"0cd8c885-0d0e-4647-95f6-dd781ba60941","resolution":{"observed_at":"2026-08-07T05:54:54.139481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.125211Z","title":"and Teboulle, M","venue":null,"work_id":"15c12d21-1e9b-4e9c-8a6e-a7d1da601026","year":2009},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.126393Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:3f32019012158ef1a02ed479c5b31b4a67f2834f28e0bd3a1a13f3101cafc0f0","observation_id":"af51c17d-948a-477a-80f8-4559560d9a17","resolution":{"observed_at":"2026-08-07T05:54:54.128699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.113999Z","title":"Fast as chita: Neural network pruning with combinatorial optimization","venue":null,"work_id":"c002b065-b12f-4538-a377-756711656acb","year":2023},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.130256Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:c23bcf04ca4f02a18d8046c3a72cf145f3a436bb39726e58c210234e85dfaf1b","observation_id":"d56625d7-0580-4aca-a15a-ef78bcf0bc3b","resolution":{"observed_at":"2026-08-07T05:54:54.117830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.101943Z","title":"and Davies, M","venue":null,"work_id":"7eb185d6-405b-444f-b022-410064539636","year":2009},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.134470Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:9a816af9e60f341837fbfcbf13e65d9676b4649ed1d1bde89e210ffbe2383c9a","observation_id":"4c1e3708-fb48-4575-b43a-70bca83a0809","resolution":{"observed_at":"2026-08-07T05:54:54.105683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.090932Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","venue":null,"work_id":"5012837f-c29f-4226-9d7d-1b67159495a5","year":2011},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.138045Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:8365964a7e45c35e7488554c8b7fe0f79ba4fc3df42540933f0ec1dec4f253ca","observation_id":"d66cc8c7-fe00-4391-9d24-3826ce9012fb","resolution":{"observed_at":"2026-08-07T05:54:54.094938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.141832Z","title":"J., Leary, C., Maclaurin, D., Necula, G., Paszke, A., Vander P las, J., Wanderman- M ilne, S., and Zhang, Q","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.141832Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:2dcc11cc3ebed7fa3d1f0e5201e93def436b76efd4d689e5336e3f04d2ac6d6f","observation_id":"09b6e20b-661f-411f-98c1-92f775b2bad6","resolution":{"observed_at":"2026-08-07T05:54:53.141832Z","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-07T05:54:54.072341Z","title":"Entropy- SGD : Biasing gradient descent into wide valleys","venue":null,"work_id":"aab854d9-e432-40a5-9349-55987c1223dc","year":2017},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.145764Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:9d8703c30f36ba9c1f49c780a413ad7ae8b4ffdb13715dade47a8306b9f72a94","observation_id":"8c20c44b-4420-4432-a710-4efb319f9742","resolution":{"observed_at":"2026-08-07T05:54:54.076165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.061461Z","title":"When vision transformers outperform resnets without pre-training or strong data augmentations","venue":null,"work_id":"f3ab63ee-25c4-43f7-a4e8-5d23d8768139","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.149188Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:ca4db3136ffba3a9b83f6b4bb86bac9024acd20cbab85ebae01a9165d06c36b5","observation_id":"607fa36d-b414-41fd-a413-230da53ac74a","resolution":{"observed_at":"2026-08-07T05:54:54.065349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.050454Z","title":"S., and Elsen, E","venue":null,"work_id":"5e2eb297-ec2a-41ad-8181-cfd468849a2d","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.153077Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:6d7e5ab4c353ffa6e774eb9df270315727d50719d56c08ddf715a2426f660c21","observation_id":"b02a5969-1389-4517-be84-967ff702b303","resolution":{"observed_at":"2026-08-07T05:54:54.054213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.039941Z","title":"Sharpness-aware minimization for efficiently improving generalization","venue":null,"work_id":"5a948fc1-1a4a-4ed9-9ff2-8097cb746bb4","year":2021},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.156347Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:7baa556e19bd879693e2b4dd110943d8001deb12bc4fdc43bb647af5e178bf4b","observation_id":"1f185cd3-f781-433f-819d-1dcffb8ca218","resolution":{"observed_at":"2026-08-07T05:54:54.043442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.029625Z","title":"and Carbin, M","venue":null,"work_id":"cdf32068-e2f3-4551-b509-d6f08e4eb3c5","year":2019},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.159724Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:eb9a39aebb4fd86e8c67922c4752f650e576a8a5f73ca8dc882db762cec8c12f","observation_id":"5c160075-82d8-4612-a64b-14a5ee3dc386","resolution":{"observed_at":"2026-08-07T05:54:54.033269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.018965Z","title":"and Alistarh, D","venue":null,"work_id":"0a88ce29-5023-4947-a905-39c885a4beab","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.163131Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:f3a107959b4e3625924ac47e2b66f4ccb5390ffd58ecb6368bede1f3a1ca5c5c","observation_id":"9e418ce3-c089-45fb-86bb-a6ab75367c93","resolution":{"observed_at":"2026-08-07T05:54:54.022348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:54.009061Z","title":"and Alistarh, D","venue":null,"work_id":"2af744fd-e71c-4a8b-94a9-bcf07868eea6","year":2023},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.166587Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:a55d2d5516daee419caa3fb9f03e47f873a5650dfec8230325bbf60b357c1082","observation_id":"a7f7742a-d52a-4218-8400-0fbebf107c35","resolution":{"observed_at":"2026-08-07T05:54:54.012317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.999131Z","title":"J., Bengio, Y., and Courville, A","venue":null,"work_id":"5ab3187c-c67b-4b94-ab44-525849d70102","year":2016},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.169759Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:fdf0278831c7a2bc4a9f65d0289a3332d883b0e70716c4563391f7603ece9647","observation_id":"1b90a9be-a49f-4ab0-ae1a-deade2fb6ca9","resolution":{"observed_at":"2026-08-07T05:54:54.002670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.988764Z","title":"Learning both weights and connections for efficient neural network","venue":null,"work_id":"85f9af28-b2c5-460f-81de-d2e2055c9d1e","year":2015},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.173224Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:066700dd253a299c2a22aa1549b135040eba36edbb2a158e5d2ea2cceadcffb0","observation_id":"8bdbea47-528e-4d42-93cf-5293cd4a248a","resolution":{"observed_at":"2026-08-07T05:54:53.992309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.978298Z","title":"and Stork, D","venue":null,"work_id":"90dea503-62e3-496e-86c9-b7c757544488","year":1992},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.176349Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:2777b86bc270f65b59a25422392912ffe4a8ce36b934bdaedcf5b8262f98de64","observation_id":"17928979-9131-46f9-bde0-79f12e3ba701","resolution":{"observed_at":"2026-08-07T05:54:53.981824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.966699Z","title":"Deep residual learning for image recognition","venue":null,"work_id":"60b2ca3f-6c1e-4be7-9d9f-edd55d46fe8d","year":2016},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.180163Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:7d14ecd645cb53452181cf0f47d2e8d82c7d39038a48b44f6e2c773d82b6fb51","observation_id":"24eeb561-d98d-4292-a605-6c603ca5a08e","resolution":{"observed_at":"2026-08-07T05:54:53.970446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.957050Z","title":"Sparse double descent: Where network pruning aggravates overfitting","venue":null,"work_id":"46ded668-f441-4aee-9691-cf2d51c7e3b3","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.183573Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:4a7082f85cc50f5f15a38dae16b7e0cd647e20c1e84ba8c09a7a3a06d8c17d98","observation_id":"fdcbcd0b-b2f6-4f0d-a06d-372b3d1aeba5","resolution":{"observed_at":"2026-08-07T05:54:53.960748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.947565Z","title":"F lax: A neural network library and ecosystem for JAX , 2023","venue":null,"work_id":"ab675a3d-71c9-44b6-94d6-41c5983e8481","year":2023},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.186787Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:dcc9a14989e8cad2c32cacd385d1a3e97fd40b7420261b0e53cd435c8cc811ce","observation_id":"1a88922a-9640-411f-93ae-9fc92c5a30d6","resolution":{"observed_at":"2026-08-07T05:54:53.951070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.937097Z","title":"and Dietterich, T","venue":null,"work_id":"f1a2f5c9-c194-4aca-98fb-675667de7328","year":2019},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.190056Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:14259cf3e039b44d6bb9ccfb23efe66ec9950d65b977011db8e6015d70529d90","observation_id":"84ad3c11-8642-4200-b992-43725fc7c804","resolution":{"observed_at":"2026-08-07T05:54:53.940390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.926632Z","title":"Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks","venue":null,"work_id":"f80e93c6-0f86-4885-9a86-6737a07d876f","year":2021},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.193426Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:03b3daee2b49d0a7593b8c425fea95ef134f917cf64ef3a52b01041624e2808b","observation_id":"5f7830c6-4721-4354-a539-1242d883212b","resolution":{"observed_at":"2026-08-07T05:54:53.930332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.916630Z","title":"Alternating direction method of multipliers for quantization","venue":null,"work_id":"60d4886d-e25c-42bd-91d6-fe2e6a74d39e","year":2021},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.196634Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:0e122993fdd4576ba4a675bf301cda065cf4a8f3a27a03c5843f11b16151be9f","observation_id":"bb33c275-a08c-442e-b989-5ef54f0ec580","resolution":{"observed_at":"2026-08-07T05:54:53.920211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.905559Z","title":"Accelerated sparse neural training: A provable and efficient method to find n: m transposable masks","venue":null,"work_id":"3bb7bf9e-dc15-4528-81e9-a01fadd1b827","year":2021},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.199929Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:ed928519f39db09f6afe198f634d1515d81135e61d6dedaff6191a1e6ca555b3","observation_id":"0df305f2-9de7-4d15-a0c4-3419db4486e6","resolution":{"observed_at":"2026-08-07T05:54:53.909131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.893905Z","title":"Averaging weights leads to wider optima and better generalization","venue":null,"work_id":"b4411c7c-bd10-4e7d-b5b1-4d04ba87967f","year":2018},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.203206Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:28906e3924fbc012ac1cc5f95cdcc67566c045ebcbd9decb18eaf6e5b7dd3555","observation_id":"d683a92e-9e10-4cf2-9f7d-919dcde611e3","resolution":{"observed_at":"2026-08-07T05:54:53.897965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.882877Z","title":"Fantastic generalization measures and where to find them","venue":null,"work_id":"0e7f813c-074f-44c9-85c5-32ac81f27778","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.206755Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:994f8d7aae15fbb72403cda0c001e77cbc040c55115c1f56b0da708799ac071b","observation_id":"04d4245d-23a9-4ac7-86c7-ba3800b77c2f","resolution":{"observed_at":"2026-08-07T05:54:53.886767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.873140Z","title":"Fantastic generalization measures and where to find them","venue":null,"work_id":"eb9fdd2a-7dcc-4ac2-ad6c-f54330cb7431","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.210072Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:452a838808407c8d59736f60006a75f46794aaa2a89d9a1dec82bbf7fd4ef8bd","observation_id":"f2ae8129-ba6f-40cf-a2ab-addcfc251c90","resolution":{"observed_at":"2026-08-07T05:54:53.876571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.862957Z","title":"S., Mudigere, D., Nocedal, J., Smelyanskiy, M., and Tang, P","venue":null,"work_id":"5323f398-4a8c-4715-bd3b-87593fda71d6","year":2017},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.213657Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:e159023ea2f616ad4e81c49aaf760ba4828a2d0702c350f5779941f856bf0983","observation_id":"961e4e2e-3d15-4f6d-aff5-b71f8b04369a","resolution":{"observed_at":"2026-08-07T05:54:53.866528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.852315Z","title":"D., Luong, H.-C., Mordukhovich, B","venue":null,"work_id":"491a76b3-b525-40dc-88ed-7c6a36f9b746","year":2024},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.217094Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:27430b142f119798e066361d2cb6e3c9d57947ed88bbb35820fe5c46d2cb1993","observation_id":"c9e10884-ff49-4540-8add-23141e4b7850","resolution":{"observed_at":"2026-08-07T05:54:53.855608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.842191Z","title":null,"venue":null,"work_id":"6669a256-d6fa-4d12-a5fa-ebfce96343af","year":2017},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.221367Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:940e0cc8db29fca7aa99a3d34b85a4befd58b6b912a59cff383624b4997488d0","observation_id":"a9c046e3-5b6f-47fb-ab23-3ec3d3f00c1d","resolution":{"observed_at":"2026-08-07T05:54:53.845621Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.224763Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.224763Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:b42f234ce9cd1e0cad622090cc840b4e0078e174220a610d21791b033a1c5fda","observation_id":"cd2dd0a0-0206-480d-99cc-40c6a5e161bf","resolution":{"observed_at":"2026-08-07T05:54:53.224763Z","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-07T05:54:53.826615Z","title":"and Alistarh, D","venue":null,"work_id":"d40fa81c-b55c-410d-b13b-f7b77fc9e8fd","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.228335Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:4ab77ec5c6e3114f09abde99e0ed33c316390e546990c7e35ec056a99a3f2a24","observation_id":"1436cd02-afcc-48e4-8b4f-a35394fd52b3","resolution":{"observed_at":"2026-08-07T05:54:53.829798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.817363Z","title":"Soft threshold weight reparameterization for learnable sparsity","venue":null,"work_id":"71ce3805-7410-4b9c-b9d8-b1376417e5c6","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.232240Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:790732e51cd1c287bb7ee1dc1edca20d6ef743ffab90079995420e1308e42650","observation_id":"914f7f97-a8a2-4e75-add0-349cc7ed73d1","resolution":{"observed_at":"2026-08-07T05:54:53.820571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.807808Z","title":"W., Hassoun, J., Keutzer, K., and Gholami, A","venue":null,"work_id":"65fe4dfe-6779-49a9-ae67-4f9d79a7dd13","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.235825Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:fd2604634a60addb419732002692dc0fc0938159944e6f8a571582f005108df6","observation_id":"0d6b2250-6983-423f-ba46-3c0f589467cc","resolution":{"observed_at":"2026-08-07T05:54:53.811476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.798431Z","title":"Optimal brain damage","venue":null,"work_id":"cd8f5390-aabd-417b-b290-4d9699baead8","year":1989},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.239171Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:2f0f5cf5074c7917ba61ae4d472435eba377320e4014c36bbb47d06e82eacbba","observation_id":"abd0c05a-1932-4bf3-a61a-5c5ecd65b324","resolution":{"observed_at":"2026-08-07T05:54:53.801782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.788565Z","title":"Snip: Single-shot network pruning based on connection sensitivity","venue":null,"work_id":"970713b9-cdf3-4d58-a8d2-cae687a0b066","year":2019},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.243708Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:b455229ad16f88a5d5162f28a03b435d66140bd16671542ea61d237abfd5b6bc","observation_id":"48faae49-d6d0-4d8c-953c-9f81a32f5f06","resolution":{"observed_at":"2026-08-07T05:54:53.792052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.778443Z","title":"Understanding the effects of data parallelism and sparsity on neural network training","venue":null,"work_id":"032046ec-5773-4cae-a54b-7a003da31d3a","year":2021},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.247097Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:500d34687212e9c5186de88fbdce7ea81a50290723a8c3743ce0b0d577b77f13","observation_id":"ce035658-df85-47c8-bd9c-efa20c421512","resolution":{"observed_at":"2026-08-07T05:54:53.782191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.768918Z","title":"Visualizing the loss landscape of neural nets","venue":null,"work_id":"3fecaacb-1dba-4e04-9ec7-7dbe8d164e4d","year":2018},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.250269Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:4de6b9c18f0694538b0222e786950f0581a4ccbec23bc0632a3f1202dd918e92","observation_id":"610f5188-4882-472e-bfb8-2928ff79b5d2","resolution":{"observed_at":"2026-08-07T05:54:53.772250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.759426Z","title":"U., Barba, L., Dmitriev, D., and Jaggi, M","venue":null,"work_id":"ccd4e5a1-dc5c-4f4d-94eb-3927ef8d51ad","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.253835Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:db7167f20b623fe49095f407604f3454985032f84d8017acbe4d35f39bca13c0","observation_id":"db9b4317-0a56-4202-8aa0-e47a4bd4169d","resolution":{"observed_at":"2026-08-07T05:54:53.762659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.749542Z","title":"A survey of lottery ticket hypothesis","venue":null,"work_id":"dfb3990a-c482-41b5-a677-670216dfdd2b","year":2024},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.257527Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:245497bc3e869ff7876d7e5cffb79837834e8480c2adbe8f4a25f2af09f65a92","observation_id":"c7b381fa-90ed-46fd-a5c1-ba927f62af75","resolution":{"observed_at":"2026-08-07T05:54:53.753135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.739378Z","title":"Rethinking the value of network pruning","venue":null,"work_id":"2f003992-9a09-440f-8a92-0e2622614290","year":2019},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.260924Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:79bd072c3ffadb33d2f99a316ffbfe3a63b9722acd8aa829449472617011f409","observation_id":"7dae7675-3517-4f9e-87fe-d3fe73baf048","resolution":{"observed_at":"2026-08-07T05:54:53.742871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.728894Z","title":"Alps: Improved optimization for highly sparse one-shot pruning for large language models","venue":null,"work_id":"850556cd-3768-4673-9ca2-c09e631ef5fd","year":2024},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.265447Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:aaa1eb4006d85da29be05ff4710009a65fe060735c85dfdc5d7967a0a4dce8e2","observation_id":"4808e59f-744c-465b-a477-40b92ecc9052","resolution":{"observed_at":"2026-08-07T05:54:53.732794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.718713Z","title":"Pointer sentinel mixture models","venue":null,"work_id":"189a184b-dba9-4ad3-9b63-a71f65edaa18","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.268784Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:b55eb47136d3eaf22e558fe842710b434a106e76bf375731c3eeabc61b17ba62","observation_id":"579b3735-a10b-4554-912f-2e0b99cc2ae4","resolution":{"observed_at":"2026-08-07T05:54:53.722109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.708341Z","title":"The llama 3 herd of models","venue":null,"work_id":"7ca14708-0b1c-4fec-b62d-4a17cc807f29","year":2024},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.272176Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:469a039190477fe22e53f89e9fcb6b003854e897a1b48ce431c216b56710dfa0","observation_id":"7dbf8c98-8ce8-4f63-8c9d-78b0209ea6b2","resolution":{"observed_at":"2026-08-07T05:54:53.711664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.698586Z","title":"V., and Strubell, E","venue":null,"work_id":"08f62e81-a91c-436b-b421-3ca08e1682cf","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.275666Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:9e1388bc41e0140ed78aa8bcac5fe4e87db1290aaa0b7f45aeee7c2e5bd5b2a5","observation_id":"950e86e7-891f-467a-a402-c3a9567b0e95","resolution":{"observed_at":"2026-08-07T05:54:53.701892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.688015Z","title":"M., and Ma, T","venue":null,"work_id":"aaaa4c8f-f213-4e14-8295-2ef2202ffceb","year":2021},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.279069Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:0b3f60e49c69ae72283a892cf8cb236334b057df1bd0fdfb86842e3fcdd74386","observation_id":"c995e444-c04d-451a-8050-b4453c312bd6","resolution":{"observed_at":"2026-08-07T05:54:53.691650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.677449Z","title":"Exploring generalization in deep learning","venue":null,"work_id":"4577457b-0279-497e-ab5f-08f3e29bf807","year":2017},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.282585Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:cb12db98b4b94065a208d4c29bdebcb13c1adc2f0c44a8d448cf2c58ea27a904","observation_id":"49b4c32e-db84-43a6-bf86-00dcf5d71bb3","resolution":{"observed_at":"2026-08-07T05:54:53.681237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.666593Z","title":"Anticorrelated noise injection for improved generalization","venue":null,"work_id":"5bf57e75-0a0c-4c31-b132-235e1c277708","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.286283Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:364f8867bf5e4bc4acbc4c316506dd57412a961f485c0896adb6145900cfc0ec","observation_id":"6f2f5fa3-eb84-494e-b19e-be746dc338f2","resolution":{"observed_at":"2026-08-07T05:54:53.670232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.654755Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":"74126b6f-3875-4b24-83ac-8446f73591cf","year":2019},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.289807Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:16df65d2f3cb2b07c8c18d19af8b7e189ec3babba24cc0c2017005d721f12e50","observation_id":"2e3db830-35ef-4005-bf02-fff257ec7a1d","resolution":{"observed_at":"2026-08-07T05:54:53.659400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.643103Z","title":"Ac/dc: Alternating compressed/decompressed training of deep neural networks","venue":null,"work_id":"5cf55eee-7035-4f5b-8fc1-b85271928cbb","year":2021},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.293384Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:d6693c205812dcf923413e17dab566c7abd383952ef06bc682b001389c0c46ca","observation_id":"15a2ad31-c6aa-4f2c-a601-3e3fb5780f93","resolution":{"observed_at":"2026-08-07T05:54:53.647342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.632474Z","title":"H., and Alistarh, D","venue":null,"work_id":"85215185-5295-4176-b9cd-c15ef4269f45","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.296911Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:b23bdf2f6b40a1aa92e5518753163d1efeb84631f874533a490c7a6b562ff09c","observation_id":"a2315789-944f-4812-9984-27787c09593d","resolution":{"observed_at":"2026-08-07T05:54:53.636156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.300265Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.300265Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:4e335800e82a3d16495d159ab3d189f892ccb531a6d7760bf67fbe64852794ad","observation_id":"2d40eb9e-1935-41ae-bd31-ce76affb68c5","resolution":{"observed_at":"2026-08-07T05:54:53.300265Z","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-07T05:54:53.615538Z","title":"What's hidden in a randomly weighted neural network? CVPR, 2020","venue":null,"work_id":"af6db490-4006-4543-9d6d-28ab2c6c085e","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.303438Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:f44165a2333233fc920a08022a86bad63cde50b089e601a6111d87f50806d132","observation_id":"cb2d84ea-5dcb-4b98-a207-eab04caaf188","resolution":{"observed_at":"2026-08-07T05:54:53.619280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.604682Z","title":"Movement pruning: Adaptive sparsity by fine-tuning","venue":null,"work_id":"bbb4dd44-7362-4048-9d8b-5599bc94cc88","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.306721Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:2c2d93eb31129d90ae0c82e8a0264c9caf06d4eeedb9624e7757cd072e7af70d","observation_id":"e8c85cd1-3bfd-4ca1-826f-2a4b0c03ab38","resolution":{"observed_at":"2026-08-07T05:54:53.608587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.594281Z","title":"Rethinking pruning large language models: Benefits and pitfalls of reconstruction error minimization","venue":null,"work_id":"919d7f04-9b8d-4809-b19b-efc52be9c349","year":2024},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.309998Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:14deb2f65a930e27d873b1403d1cf8250ecef01982113f907f5b58104b43deb9","observation_id":"437a1b9d-e318-4682-9d57-5d385878a7e9","resolution":{"observed_at":"2026-08-07T05:54:53.598038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.582611Z","title":"Critical influence of overparameterization on sharpness-aware minimization","venue":null,"work_id":"019191cd-c7b6-4b37-96b4-c666cc52bbab","year":2025},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.313044Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:c97f4d70dde2180f8a26d7592ed6b8e29cc89756221f013519c480c99bec507a","observation_id":"cad697dd-70fa-407c-b39a-7170418f34f2","resolution":{"observed_at":"2026-08-07T05:54:53.586218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.571443Z","title":"Very deep convolutional networks for large-scale image recognition","venue":null,"work_id":"6b5c57ef-cb4e-493e-a0d0-97b36ccc5c2f","year":2014},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.316268Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:4064d1c2de44847cacdf7f33f59baa61ed249488dc5bc14023ea99e542eae6d3","observation_id":"a2246775-aaba-4da4-9486-61d3d2364010","resolution":{"observed_at":"2026-08-07T05:54:53.575510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.559813Z","title":"Learning from noisy labels with deep neural networks: A survey","venue":null,"work_id":"5b600638-9952-45eb-968f-f13946558fa9","year":2022},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.319925Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:a848e7d28c0c6e75d7bf6f908064a75592d149d3c40ce70d37f2e8b9d46cc27d","observation_id":"db3e5053-86a7-4dcf-ad36-8b8807997524","resolution":{"observed_at":"2026-08-07T05:54:53.563874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.549006Z","title":null,"venue":null,"work_id":"911c3851-4bb1-4070-a6e5-1eef0d5b22c4","year":2024},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.323394Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:ffa0f9105e2616544a8f78d15b985c8bea932b62cca10f5b854411f0d70117d9","observation_id":"d4ab15e2-dcba-460b-8c6a-c87477f33ebc","resolution":{"observed_at":"2026-08-07T05:54:53.552637Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.537012Z","title":"Intriguing properties of neural networks","venue":null,"work_id":"38f8d612-e722-40d2-a072-7545f749c0b2","year":2014},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.326715Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:16eb65545d67f8d0cd20f8dbb170f0d6c6d932a4cfa50a13fc0e0b0a1d7f2605","observation_id":"c5cefda8-e8a3-417b-82a2-d7e5877ef675","resolution":{"observed_at":"2026-08-07T05:54:53.541076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.525238Z","title":"L., and Ganguli, S","venue":null,"work_id":"93b1047b-25c8-47f3-8b4b-6626dca36541","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.330052Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:c949b77049a665b06bfd46e9a2d348014ed068577043c17cd8d31510f568d650","observation_id":"449f3497-e793-4c99-898e-cee3f8deabe1","resolution":{"observed_at":"2026-08-07T05:54:53.529037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.514497Z","title":"Regression shrinkage and selection via the lasso","venue":null,"work_id":"ded76507-3b9b-4eb8-b2fd-d70d9afa3d9f","year":1996},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.333512Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:6ad50fd60e43c5961203d37de3aa6bf64ec08d16d07c56ba47c5890eb176b171","observation_id":"ae737968-4a0a-40ef-b5a1-81f4ac49f106","resolution":{"observed_at":"2026-08-07T05:54:53.518428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.337020Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.337020Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:3198e3057a6b8161bc4edf2761e9ffa5df8c9166b62b7cf8b13cc9f7a8963d88","observation_id":"e9bf8bc5-bc1c-49e0-94b5-f178a8846824","resolution":{"observed_at":"2026-08-07T05:54:53.337020Z","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-07T05:54:53.496908Z","title":"Picking winning tickets before training by preserving gradient flow","venue":null,"work_id":"e61d49aa-fbf7-49ef-93f2-793337c995ff","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.340511Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:0ea4327473d723814b77586da0a9b337e207dbb80bfcdfd3cdcec8e904f25b27","observation_id":"b97ef8ab-92c2-4354-8048-b27e97230a0d","resolution":{"observed_at":"2026-08-07T05:54:53.500454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.487006Z","title":"Global convergence of admm in nonconvex nonsmooth optimization","venue":null,"work_id":"5bcc8d02-f6ac-47c2-ae29-19da6cec93cd","year":2019},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.343964Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:8848d138912e42c0fc5e4069db06c3243252e152074d83e41039eb55b45092fd","observation_id":"b023924f-5567-4c06-94d2-c6fe3d286ca3","resolution":{"observed_at":"2026-08-07T05:54:53.490464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.476623Z","title":"Sharpness-aware minimization alone can improve adversarial robustness","venue":null,"work_id":"7ed589ff-7dde-455d-a6a4-7a29af47e799","year":2023},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.347672Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:51dfeabcf65d8daaebe9e7c3d540388b7572071083e9bc10ab4c6744579a46a6","observation_id":"3054c454-15bb-430f-9a9d-b20e9f67df00","resolution":{"observed_at":"2026-08-07T05:54:53.480205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.466595Z","title":"L., Gugger, S., Drame, M., Lhoest, Q., and Rush, A","venue":null,"work_id":"7b8f0b33-283d-432f-82a4-137765183d09","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.351142Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:77dcbcce7dc946833917eec5cc934b7a75e6c4fba508e32e196db3cab9def066","observation_id":"664e258b-c2dc-4ea9-b503-83da91a44955","resolution":{"observed_at":"2026-08-07T05:54:53.470128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.455828Z","title":"and Urtasun, R","venue":null,"work_id":"c715047b-949a-428b-84db-87be8ceb15b3","year":2018},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.354352Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:72e6a6b1932c66c905300747df33f2dce4fc2bade5a03b1035fc3a29c369f8b9","observation_id":"fa503f1e-fc7b-41e0-a5a4-1d1c61f2fa83","resolution":{"observed_at":"2026-08-07T05:54:53.459502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.444035Z","title":"A systematic dnn weight pruning framework using alternating direction method of multipliers","venue":null,"work_id":"fd76fc68-883c-4cd2-a1e7-0f7253637cc4","year":2018},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.357711Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:a37f813f04ae8c10d95376f7d7b1e4ac5ed7852e48d564827ba8405f312042a0","observation_id":"b721a041-5010-44f2-b932-449a882b8335","resolution":{"observed_at":"2026-08-07T05:54:53.447846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.433100Z","title":"On the duality between sharpness-aware minimization and adversarial training","venue":null,"work_id":"333d0bb5-c3d7-4013-bdc3-be486a6d0b72","year":2024},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.360954Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:c15c38ec138163077eb9ae1db1fa23e3b9c15b825c57b45c782f4df57c81ac40","observation_id":"85cc152d-9203-4f72-94b2-5d1ce8fcc7ba","resolution":{"observed_at":"2026-08-07T05:54:53.436893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.422130Z","title":null,"venue":null,"work_id":"15b476a4-e4d4-4dc7-9794-d537dff36e35","year":2020},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.364013Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:ed7bd80fd21006d0c7ff110917a1f5bc768800c622c0b2f359290fc8f73888a0","observation_id":"7f44f5ef-6cb3-43cb-b1d7-0d6115506146","resolution":{"observed_at":"2026-08-07T05:54:53.425964Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.410947Z","title":"Effective sparsification of neural networks with global sparsity constraint","venue":null,"work_id":"5fa204e7-001c-464a-9c35-914417ca613c","year":2021},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.367726Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:4f89f4492ecf24392ff1362cf554228bb981c82dfd9d3b5ef95f1d9df3d6fade","observation_id":"e6463e89-eeae-4812-bf85-1b2fb027f27f","resolution":{"observed_at":"2026-08-07T05:54:53.415378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:54:53.398899Z","title":"and Gupta, S","venue":null,"work_id":"6dec7dbb-968c-42d4-b1eb-3ec849b86714","year":2017},"citing_paper":{"arxiv_id":"2506.06866","last_updated":"2025-06-16T12:36:58Z","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:53.370784Z"},"links":{"citing_paper":"/paper/2506.06866"},"observation_digest":"sha256:e7959d7831b1b9cae82475fddfff9f7ec0ce77e0ce44a184f7ace9cb1611227f","observation_id":"a0aaae67-e3f9-483c-a303-91d386177cfa","resolution":{"observed_at":"2026-08-07T05:54:53.403660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2506.06866","last_updated":"2025-06-16T12:36:58Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T02:17:17.163706Z","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning"},"reference_resolution":{"displayed":76,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":68},"total_outbound_references":76},"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 76 of 76 outbound references and 1 inbound Pith citation observation for arXiv:2506.06866."}