{"as_of":"2026-08-18T03:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc30783578ea4e9437587b4565559ffa41ab75b2cf092dd4c34f85b8c4a88f98","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:41:24.768818Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.11135/citation-record","integrity":"/paper/2501.11135/integrity","json":"/paper/2501.11135/citation-record.json","paper":"/paper/2501.11135"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:41:25.747634Z","title":"Optimal brain damage,","venue":null,"work_id":"1b06eb42-1848-4273-9f1f-cf609cb3eb9f","year":1990},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.314581Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:933071e4ca669d618a646adf1ee9991ac7d00505a36afd3b873d9408cbd22e4f","observation_id":"6c3c5e3f-26da-41bc-af8a-f8e6c31f9f16","resolution":{"observed_at":"2026-08-10T18:41:25.754516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.727975Z","title":"Learning both weights and connections for efficient neural network,","venue":null,"work_id":"8f1d8d0f-805b-42b9-9de3-40451a7390a4","year":2015},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.321551Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:44bb49dc836ae5dff0ccd44022b9c60e345691007ac304e7a6e2868d4607a1f9","observation_id":"e19a97d8-3be2-44bb-9539-48cd37260d26","resolution":{"observed_at":"2026-08-10T18:41:25.733621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.710581Z","title":"Learning sparse neural networks through ℓ0 regularization,","venue":null,"work_id":"5d2b1099-db9c-4386-9391-5d3a25e5bd2d","year":2018},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.330726Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:6ad80dca46d7be214dc4165faf57eb63ea5c4db6e070bcad22e4efc237c5992f","observation_id":"8af89652-3353-49f7-9f3a-161880930baa","resolution":{"observed_at":"2026-08-10T18:41:25.716650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.693006Z","title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","venue":null,"work_id":"5c0e73ef-a1f4-462e-b566-bd40e1517f2d","year":2019},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.337666Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:e988aeb607220f8bc7968d891f75b205309b6a20fbbd4add3a7a77b344ca06dc","observation_id":"6acc5856-006b-4eb0-89f9-b8a4144ac61f","resolution":{"observed_at":"2026-08-10T18:41:25.698315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.676341Z","title":"Designing energy-efficient convolu- tional neural networks using energy-aware pruning,","venue":null,"work_id":"6ee771a7-4e46-4aca-974a-c3240b0568a1","year":2017},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.344723Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:6c6d80f8665776f948e862a47778688856e05cb8584278eca8121fa3b32e3d6a","observation_id":"07ec68f4-9134-4917-ba6a-541fcfcf297a","resolution":{"observed_at":"2026-08-10T18:41:25.681615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.659933Z","title":"Pruning convolutional neural networks for resource efficient inference,","venue":null,"work_id":"e5bf6835-b777-4b14-bb7c-db8dc66454a6","year":2017},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.354030Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:a9d255e4b0f885ea1a7b6a91fcb54434277fd64d3e02a0e7055353981370cce5","observation_id":"86b81fe1-3010-4fb6-94d3-b6583da3d8e1","resolution":{"observed_at":"2026-08-10T18:41:25.665012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.642713Z","title":"What is the state of neural network pruning?","venue":null,"work_id":"7442f381-b8c0-400b-9b33-9355679c7b8d","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.360534Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:52946353ff6c7cc2bf7b74d29d3d08da5a0dd1a017f193388385bf4704edc2a1","observation_id":"72fd4b82-a371-4a54-b7e5-565e1862935d","resolution":{"observed_at":"2026-08-10T18:41:25.648205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.625779Z","title":"To prune, or not to prune: Exploring the efficacy of pruning for model compression,","venue":null,"work_id":"d48f2628-015e-439b-9f90-062837e1e504","year":2018},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.366851Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:bba413e51034922357c65240ea74788ff9c2c4095a6ec7524111b305082e97ed","observation_id":"873a44b6-bbf2-46f2-9dce-c23c9696325e","resolution":{"observed_at":"2026-08-10T18:41:25.631400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.606602Z","title":"ProxSGD: Training structured neural networks under regularization and constraints,","venue":null,"work_id":"b2b542ba-0b2e-44d3-a6c3-9ce81e963a75","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.372832Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:ee972182960ecf883e8847665cb8a79899c7f82d6d26a225b6364aa7b8f1f948","observation_id":"a37dbd5e-46d1-4116-9f54-6a2c00609bc7","resolution":{"observed_at":"2026-08-10T18:41:25.613312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.587318Z","title":"Adaptive proximal gradient methods for structured neural networks,","venue":null,"work_id":"8022dd91-5476-49c8-ba2b-53b2f5869d6d","year":2021},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.379839Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:3098f4ce0e538d2409b6778cdc4df4faf2e65f27bb52f0d3f0044ae5ff379a6f","observation_id":"e62ee198-0296-496d-b70a-b44b964167f7","resolution":{"observed_at":"2026-08-10T18:41:25.593890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.568620Z","title":"Linear mode connectivity and the lottery ticket hypothesis,","venue":null,"work_id":"d8f11d90-1c97-42b6-b14e-f610d3508e56","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.385313Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:aaf53cf99ed26bcc6873df40dae07b54aa1e45d55d6b4a4ea7d347f7c3c58a00","observation_id":"d10ccac0-731f-4252-8f89-17b8046cb055","resolution":{"observed_at":"2026-08-10T18:41:25.574077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.550862Z","title":"Winning the lottery with continuous sparsification,","venue":null,"work_id":"7e8d80a5-64de-42e8-96cc-6aa24b14ef86","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.395683Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:6bc039ab02c4708c4e66881a64f1ab27c0a7f235df128eccf73349c130109aba","observation_id":"29931445-88ad-417b-bc7c-d342c2a33ede","resolution":{"observed_at":"2026-08-10T18:41:25.556174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.532536Z","title":"Learning efficient convolutional networks through network slimming,","venue":null,"work_id":"88abfa79-ab7f-4cc7-9ea9-1ba7274892c6","year":2017},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.401353Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:0bbd6673d8f2a519b4d3e486fe0e8a3bfcc1828614b8181b85d58265ef65c0f3","observation_id":"a01b871b-65f6-4dfe-b5c2-d953a2030499","resolution":{"observed_at":"2026-08-10T18:41:25.538476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.514482Z","title":"Rethinking the value of network pruning,","venue":null,"work_id":"066cd671-f992-4c3d-a8ab-d947c2f7a3e2","year":2019},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.407364Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:207be41f7b451c638a166827b42ef232670426f227bfd78b0392af27f73692f2","observation_id":"7d9ac10d-e71a-4920-bcd8-78c088b1b250","resolution":{"observed_at":"2026-08-10T18:41:25.520248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.497209Z","title":"SeReNe: Sensitivity-based regularization of neurons for structured sparsity in neural networks,","venue":null,"work_id":"a40b6579-6736-482a-8578-40c76a49392b","year":2022},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.413679Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:064e3ce59b496e92fab6bfff5ebbed66c8075aecb49edf9c1db8a0090af0d4ec","observation_id":"25be4a0e-5dd1-47f8-8f21-e3ebebb7d6f9","resolution":{"observed_at":"2026-08-10T18:41:25.502626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.478897Z","title":"EDropout: Energy-based dropout and pruning of deep neural networks,","venue":null,"work_id":"0425992b-bdbe-4f2f-8f92-27c866860d34","year":2022},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.421888Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:50f87490230ed8d26500edb24c0068d84c1f16a71a77101feb3170b8fa5e9af5","observation_id":"cce0c516-5674-4916-a012-9757eb9469c6","resolution":{"observed_at":"2026-08-10T18:41:25.485096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.460502Z","title":"DSA: More efficient budgeted pruning via differentiable sparsity allocation,","venue":null,"work_id":"373e4c2e-0d9a-45b7-b0a8-15f58a5707f1","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.432895Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:b0e89c6319064a6bb4cd14d65d8206bbb90ed0bab86284449d0929f0ef9a4214","observation_id":"ee82f8e9-a8a9-4e2f-b203-a20f9d70062c","resolution":{"observed_at":"2026-08-10T18:41:25.466370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.440287Z","title":"HRank: Filter pruning using high-rank feature map,","venue":null,"work_id":"0fdfad5a-5cbd-4853-b9ac-d451fc7f0e9f","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.438769Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:0a0d11e3149629e539fe8c05bea1f5f1722ca6efc7f668b212a3bce7b4ad6f2f","observation_id":"847a6313-e15d-423e-bf40-8b5e0b107ff5","resolution":{"observed_at":"2026-08-10T18:41:25.446559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.421938Z","title":"Network pruning using adaptive exemplar filters,","venue":null,"work_id":"d12a0ac2-7040-4af5-b2b8-89fd763c5dc2","year":2021},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.446619Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:cf82510170f1fad139b636e61f6e686d5893c9c4cb1149addfe5659bf0ab8235","observation_id":"3bf4a069-ae50-404d-9c20-815f9522f37d","resolution":{"observed_at":"2026-08-10T18:41:25.428430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.399201Z","title":"Filter sketch for network pruning,","venue":null,"work_id":"02aad0b5-fc04-43fe-8bfa-404902e9d0b6","year":2021},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.452585Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:00cdf6310232d4f459f4fc017202105fe4abf3fed0d0c2e433f16589e8e85834","observation_id":"13bb67dc-d66c-4c8b-9e8f-6504f5ea718b","resolution":{"observed_at":"2026-08-10T18:41:25.408190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.379344Z","title":"Carrying out CNN channel pruning in a white box,","venue":null,"work_id":"e0eda680-6a31-4ec7-b29c-5ec3e71561d4","year":2023},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.459029Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:f09834db7b6cf1baccffc10b51c438035a789821bcb7d07249253baa8b8161fb","observation_id":"f6a4f539-a5b5-4d05-95a4-023610c64a98","resolution":{"observed_at":"2026-08-10T18:41:25.385470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.356642Z","title":"Regression shrinkage and selection via the Lasso,","venue":null,"work_id":"41b3f99f-89f2-4de5-920d-d114fc7b5fb3","year":1996},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.464609Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:f089ca2c45290644ded5edd088341059bbbd1231bf663212405477708d1dedcc","observation_id":"a95b84d1-9e80-4a39-9276-5509533927d7","resolution":{"observed_at":"2026-08-10T18:41:25.365589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.332752Z","title":"Enhancing sparsity by reweighted ℓ1 minimization,","venue":null,"work_id":"eba2a366-6133-4588-9165-8f5f58d11693","year":2008},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.470669Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:359d67df0a26974a9ffd98461c95a0bf39c7474e5955f0751778109c61ac8fce","observation_id":"c326d906-179e-46fb-a5f7-a1cd1f285d16","resolution":{"observed_at":"2026-08-10T18:41:25.338632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.307453Z","title":"Compressed sensing recovery via nonconvex shrinkage penalties,","venue":null,"work_id":"5e8f8f6f-c4f5-4429-832e-99fdda26046d","year":2016},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.476907Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:0ff6829e03c137b1c31aaac15580dd5a0a30898350bdc85ae08d280a154fd1e6","observation_id":"aba1b2b6-dac2-4946-9746-312a93414051","resolution":{"observed_at":"2026-08-10T18:41:25.318499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:24.483417Z","title":"Nearly unbiased variable selection under minimax concave penalty,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.483417Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:20f47126835a58a0fecbf2c627efb94908f781f7a614d38965dc3aeb980ad89e","observation_id":"7ef91d4a-c7ee-47b6-90ef-71a5fa4eb810","resolution":{"observed_at":"2026-08-10T18:41:24.483417Z","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-10T18:41:25.260557Z","title":"Sparsest solutions of underdetermined linear systems via ℓq minimization for 0 < q≤ 1,","venue":null,"work_id":"1fdda3d1-36bf-4b6b-8334-805bc9117806","year":2009},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.489870Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:27ef7fe598b0f18b0e7a4a05b05dd608c6bdcdc8906dad2906ad357589177932","observation_id":"39d86a3d-7839-463b-b49f-6484d76304a2","resolution":{"observed_at":"2026-08-10T18:41:25.270362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.229369Z","title":"Sparse regularization via convex analysis,","venue":null,"work_id":"a5a73a6f-b9ed-4419-9ad8-220393db0712","year":2017},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.495710Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:6d516237027f5be1bfc74d010c92c9eda83bccc76ff6716367ee4d86a0e08288","observation_id":"081d47c9-a304-4af4-a40f-ac418d5b1a32","resolution":{"observed_at":"2026-08-10T18:41:25.243333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.208555Z","title":"Sparse learning with concave regularization: relaxation of the irrepresentable condition,","venue":null,"work_id":"32bef9fc-0522-45d2-9920-b5245baaed47","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.501069Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:5bb0e209836f03774774f281886e6b4f313ad55cf8ee908d2931e150e8a855c3","observation_id":"9980682a-922d-44f6-a556-de9a4fd290b9","resolution":{"observed_at":"2026-08-10T18:41:25.214404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.189512Z","title":"A survey on nonconvex regularization-based sparse and low-rank recovery in signal processing, statistics, and machine learning,","venue":null,"work_id":"ebec436f-b388-4cd6-b032-6b7ae4a0d4f4","year":2018},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.508340Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:d6c1f81fc14bf8839e2153d6a9fca0e48ac66663196f3c85c6c7d286cfbc9ee1","observation_id":"91bfedcd-4cda-48ae-bcfc-ce563659a2ea","resolution":{"observed_at":"2026-08-10T18:41:25.195702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:24.514956Z","title":"On the convergence of the iterative shrinkage/thresholding algorithm with a weakly convex penalty,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.514956Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:35954bc7aa54b77ed4e58bd67cab5b7d7c1057b82680ea42767e92b00b0e121e","observation_id":"59d407c7-ce30-4e29-8057-7e4b4c1d5862","resolution":{"observed_at":"2026-08-10T18:41:24.514956Z","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-10T18:41:25.147986Z","title":"A general iterative shrinkage and thresholding algorithm for non-convex regularized opti- mization problems,","venue":null,"work_id":"7a20b12d-ca76-4092-aca5-f0120cfc0868","year":2013},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.522513Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:304dd65c09a9355a1ebb08dec21f10fbd1e3e4eb8ac1c0f7ff8b329fe2e738b7","observation_id":"8ecd2127-535d-4341-beaa-342e71cf52d7","resolution":{"observed_at":"2026-08-10T18:41:25.155120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.122754Z","title":"Minimization of non-smooth, non-convex functionals by iterative thresholding,","venue":null,"work_id":"f484b2c4-a01e-4a53-b000-509d12571b4a","year":2015},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.531025Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:cea5ac404dccfe0498878dbbc75d48a45b8e36a4cf9a2d566e9b833f14d9a850","observation_id":"10510c37-163c-42c1-a133-b0535d973a53","resolution":{"observed_at":"2026-08-10T18:41:25.129830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.101069Z","title":"Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems,","venue":null,"work_id":"12d27953-f9af-40cd-ab33-505af05221f1","year":2016},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.539906Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:c1609c7bbae1fc160d2a43ac5fe3e66ec8e697e27607317d3f46c95bfccb8ad0","observation_id":"76d4fb7c-e2d6-442c-a799-abba55c42d28","resolution":{"observed_at":"2026-08-10T18:41:25.109311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.078857Z","title":"What’s hidden in a randomly weighted neural network?","venue":null,"work_id":"21f494d4-76cf-482b-aaef-343248eb2126","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.547443Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:78fe735440adf028df60623091f6bb7a8cab5bd7abc30e1cd0df8d2aac1c8cc8","observation_id":"ef172209-39ad-4821-a51b-fc1a5ded65a7","resolution":{"observed_at":"2026-08-10T18:41:25.084977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.058510Z","title":"Proving the lottery ticket hypothesis: Pruning is all you need,","venue":null,"work_id":"3c7d8968-0318-4749-af48-04eb98709cd7","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.554628Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:200250c7332cc83b23508a1e107042872d4bd42c35b0f78dc1ff979d5b2ba36b","observation_id":"087610bd-7bb1-426c-bab1-3979ecd64f5d","resolution":{"observed_at":"2026-08-10T18:41:25.065246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.036968Z","title":"The MNIST Database of Handwritten Digit Images for Machine Learning Research,","venue":null,"work_id":"2cee8bde-2fc5-49ca-bd6b-d706aa0f0663","year":2012},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.561449Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:20a3be77ac70b9db7a28c344c10eb8a49e5db6b47580f093099d8c8a367d28d3","observation_id":"5d7e4fcd-3402-4471-8205-69b3c6ecb333","resolution":{"observed_at":"2026-08-10T18:41:25.045218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:25.015021Z","title":"Gate decorator: Global filter pruning method for accelerating deep convolutional neural networks,","venue":null,"work_id":"3f9796a4-b854-4216-a3be-965371887573","year":2019},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.705088Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:3376e00d06b5b8a38f978a7e2a87f19b214d3473a9209335c19fc2fc4828b406","observation_id":"840b6588-9db5-4e39-b876-8262459c92d9","resolution":{"observed_at":"2026-08-10T18:41:25.021652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1608.08710","last_updated":"2017-03-10T17:57:56Z","snapshot_observed_at":"2026-08-14T21:42:03.106939Z","submitted_at":"2016-08-31T02:29:59Z","title":"Pruning Filters for Efficient ConvNets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.08710","snapshot_observed_at":"2026-08-10T18:41:24.715575Z","title":"Pruning filters for efficient convnets,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.715575Z"},"links":{"cited_paper":"/paper/1608.08710","citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:864a2d8a2a69388e1a3a14f150d0e4febe13769c3a5a9bea973a97ba424db09f","observation_id":"91522b1a-28b1-4b1b-90a0-3d4f508f6fa6","resolution":{"observed_at":"2026-08-10T18:41:24.715575Z","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-10T18:41:24.995643Z","title":"Nisp: Pruning networks using neuron importance score propagation,","venue":null,"work_id":"e27c0b35-67b7-41ea-a33a-a7f1a66db6b2","year":2018},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.722067Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:4509e102d4a21dceaa73fc4c4cb717d76da5882604ed68b0261f3eb51d1ca46b","observation_id":"b27f0fff-65f8-43be-86db-b4a5c5c70b70","resolution":{"observed_at":"2026-08-10T18:41:25.001578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:24.972096Z","title":"Discrimination-aware channel pruning for deep neural networks,","venue":null,"work_id":"9529b8c8-16d4-432a-92b7-4ebed692b36f","year":2018},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.727787Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:2a857177f7ec613236471e83a3ed70f76b003edfbce60323bbd000f702f5f37a","observation_id":"4e7970e2-cccf-498c-8507-69158628cfc1","resolution":{"observed_at":"2026-08-10T18:41:24.979811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:24.946467Z","title":"Scop: Scientific control for reliable neural network pruning,","venue":null,"work_id":"23d30618-ed19-4b6b-bfce-221a0c381135","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.735930Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:0ee04c5000c5433b4fa1edb6b993ff4c26613b889eb89bcb2884d878a4fe6508","observation_id":"fcc14f41-bfea-4e36-8fba-756c1dddfebd","resolution":{"observed_at":"2026-08-10T18:41:24.954972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06866","last_updated":"2018-08-21T12:22:38Z","snapshot_observed_at":"2026-08-14T18:38:54.194750Z","submitted_at":"2018-08-21T12:22:38Z","title":"Soft Filter Pruning for Accelerating Deep Convolutional Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06866","snapshot_observed_at":"2026-08-10T18:41:24.742364Z","title":"Soft filter pruning for accelerating deep convolutional neural networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.742364Z"},"links":{"cited_paper":"/paper/1808.06866","citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:c6db8b3e2a7944da069f864f3d981fe037483c0a3a6f88566d4e32e4ddd4cfc3","observation_id":"9f3fdb0b-d493-4ad7-893e-6855cb77abcc","resolution":{"observed_at":"2026-08-10T18:41:24.742364Z","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-10T18:41:24.923911Z","title":"Towards optimal structured cnn pruning via generative adversarial learning,","venue":null,"work_id":"41e1d5f6-f152-45c8-b23d-0ffba724d90d","year":2019},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.747812Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:5d63e5066cd0c4c486bb04ae1ab70676ad3b96879bd36db3fa7fcc6360cc3514","observation_id":"abfe45a9-5e03-43a0-beb0-d78f7a73700d","resolution":{"observed_at":"2026-08-10T18:41:24.930500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:24.752895Z","title":"Filter pruning via geometric median for deep convolutional neural networks acceleration,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.752895Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:a37971a145edf2982d8e9e355a98973f5a42babd7370f5feceb9768a630fd17a","observation_id":"0583a40f-ccee-44da-93a1-3aaa3d7c9d39","resolution":{"observed_at":"2026-08-10T18:41:24.752895Z","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-10T18:41:24.884661Z","title":"Amc: Automl for model compression and acceleration on mobile devices,","venue":null,"work_id":"496f08a9-6bb6-4786-b74c-44ede47dadcc","year":2018},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.758293Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:65770e3558ac923e4fdd6fe787177f4bf76e67635bee8f90055d7fc45ef20d29","observation_id":"388e6ab6-438b-49b0-97c7-a77b2ebf2347","resolution":{"observed_at":"2026-08-10T18:41:24.891607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:24.865543Z","title":"Operation-aware soft channel pruning using differentiable masks,","venue":null,"work_id":"b2b85fd7-6d60-4fef-a24c-3cf941860b67","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.763544Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:c18eaeb3ecba63ee933bc5d5c56ceba33938eb7651a56a2a80db7c8338f6a565","observation_id":"b566968f-dbc9-4f72-9f47-ac846a078221","resolution":{"observed_at":"2026-08-10T18:41:24.870892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:41:24.845631Z","title":"Learning filter pruning criteria for deep convolutional neural networks acceleration,","venue":null,"work_id":"0a4e5a1f-0ef7-4666-b667-5e12c9fc5516","year":2020},"citing_paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:24.768818Z"},"links":{"citing_paper":"/paper/2501.11135"},"observation_digest":"sha256:a9b8fa7fd435d44fb4394c4c0f1137e4fb237c7b251275f5ffd88d0e250976a7","observation_id":"1a656a52-d238-4c6d-90c8-92195105af6e","resolution":{"observed_at":"2026-08-10T18:41:24.853431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.11135","last_updated":"2025-01-19T18:05:13Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T19:11:30.665542Z","submitted_at":"2025-01-19T18:05:13Z","title":"Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":42},"total_outbound_references":47},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2501.11135."}