{"as_of":"2026-08-08T11:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:283e7ee55f9c84510da9fdcff13480182cc30d332f852346310248d57c0e858d","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T13:36:45.131766Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2606.02176/citation-record","integrity":"/paper/2606.02176/integrity","json":"/paper/2606.02176/citation-record.json","paper":"/paper/2606.02176"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Notterman, Kenneth W","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:0d977c2ae57558abd28beb0ca9d685989bbcaf5f503c348edb984e739965de47","observation_id":"bdf44a4a-7245-4a33-9b45-5e2bac69190e","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:72b3fd6a680ddef5383a27a1315efab53ef14f6a4b794e5b9e4818c10bc35be9","observation_id":"93dc04ee-d87c-4cd0-ada5-ac41bc0ff728","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems.SIAM journal on imaging sciences, 2(1):183–202, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:cb595d7bc99ce87b679b59a2b167871e1fec02afbd84cded2a65bae833e34e5b","observation_id":"f9f5c7f9-449b-48f2-9df4-171aaf56f54f","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Beyond l1: Faster and better sparse models with skglm","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:063c4cb3ebfacd1115f5c7f1ef9e94c4a83a18d642e70a55e7f29c541332343b","observation_id":"1f167024-7b0e-421e-9938-abd85ea708d7","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Best subset selection via a modern optimization lens.The Annals of Statistics, 44(2):813, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:d1ba33d712d14537fa3f4fca9013e485882101c4dd36c2e051df59512ea7724b","observation_id":"ce2e8a57-8c13-472d-8e39-6a575d73569a","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty.SIAM Journal on Numerical Analysis, 58(1): 858–883, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:cd31c09c1a7ca9746ea7826bfc58aef66006b242423e3a1fda039253c343a3f7","observation_id":"41e55186-7301-458f-bbc8-2acaa74fe033","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Exact sparse approximation problems via mixed-integer programming: Formulations and computational performance.IEEE Transactions on Signal Processing, 64(6):1405–1419, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:9c06f34ccd9b418c285cf24e494ce6a51a84d02e450fdacaac0baaf501129098","observation_id":"e85bc094-51f2-4d4e-836d-3458a8615c34","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:8fa03b02035c67c5d311c3f2e4cc50bb6bdc00b6d03a93ed081f533718b4017e","observation_id":"74f448a0-38a3-45b7-a554-5c63938f25c9","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection.Annals of Applied Statistics, 5 (1):232–253, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:67982a467138d77f43e1a6a1a96d74ffdcbe69cf5dd6266763578ef0215a9d70","observation_id":"f04dd795-d310-4072-b473-25c63dbd6015","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","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":"10.1146/annurev-statistics-022513-115545","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"High-dimensional statistics with a view toward applications in biology.Annual Review of Statistics and Its Application, 1:255–278, 01 2014","venue":"Annual Review of Statistics and Its Application","work_id":"65863485-1369-4137-800a-0c2b3bf8bf48","year":2014},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:9a8075556d7b2b6fc9befdea664396daf608cf80ededcf4533d1fc8b962613ad","observation_id":"f387fbf9-8361-4933-a163-825ca24181c9","resolution":{"observed_at":"2026-06-28T15:12:18.798399Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-28T13:36:45.131766Z","title":"Candes, J","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:5f66452fb63f880e7d68aa826c3be7e85214e30853a9a42083b955da7506e3de","observation_id":"e49eb8f2-2ba2-4559-ae96-1e89b16bce2a","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Candès, Michael B","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:3a665b8932e9a2e9aa47e4e0a5f702cad2b9a718a0b3db754b12698431c15ea6","observation_id":"d55c009e-9872-4dfb-9ad1-6a0b53fdb234","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"On convex envelopes and regularization of non-convex functionals without moving global minima.Journal of Optimization Theory and Applications, 183(1):66–84, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:1b7e2cbb07aed0d9f535be4112674c2b524656ecb7251a7b5fbe277fe112261a","observation_id":"b9e8946e-7461-4214-8c5e-7937c58b1085","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"An unbiased approach to compressed sensing.Inverse Problems, 36(11):115014, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:073f719f646bd8743fd47dccd28722550cce4693fdfa5f862057683f4b8a80ff","observation_id":"8c35c776-e2c4-4e19-8c61-c75c75eb2347","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Spoqℓp- over-ℓq regularization for sparse signal recovery applied to mass spectrometry.IEEE Trans- actions on Signal Processing, 68:6070–6084, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:d681dc2faca253d13d96bcbe8d2c3ec6ac6cc97d187b17f4d9251843fe3fa8fc","observation_id":"0a92556d-b6d8-4dbf-8aca-982659ceab42","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","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":"2511.12157","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T00:06:24.103252Z","title":"Optimization land- scape of l0-bregman relaxations.arXiv preprint arXiv:2511.12157, 2025","venue":null,"work_id":"5292608e-b3fb-4acc-9f47-7fb70c0dee4c","year":2025},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:64f080ef7edb2e4b2ab14fa75a7a78183c1be5ffac8af7d9e5905e5f60d90d73","observation_id":"abfa8c93-ca9e-4930-9ae2-3195e059aab9","resolution":{"observed_at":"2026-07-02T00:06:24.105082Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-28T13:36:45.131766Z","title":"A block coordinate variable metric forward–backward algorithm.Journal of Global Optimization, 66(3):457– 485, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:ec9e23b6db2849d1612bed9d395038084e7bc8bda554eb128500820dde041e68","observation_id":"c8cef650-aaa9-4d3a-8926-2e148e7fc13d","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Proximal splitting methods in signal processing","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:d2e901ff392e6c3dde2735611d5fd5a5dd13050cc30612af90ca84792b0f65f6","observation_id":"521e5031-00f0-4b62-9a11-c96b263c431d","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Learning sparse classifiers: Con- tinuous and mixed integer optimization perspectives.Journal of Machine Learning Re- search, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:7e27b9eaa3651f04ee35823303af8e0f1c7df6d8d151536a152bea9924127c07","observation_id":"aa327972-6524-4e12-84d7-2cdf9382aa15","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Anovelintegerlinearprogramming approach for globalℓ0 minimization.Journal of Machine Learning Research, 24(382):1–28, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:dd4104472dae9cb98ed757fb9d0ff9e4cd3d2019bbc1f3b9de880671e22b8720","observation_id":"1a2b6538-9661-4802-a548-86a59b2d5328","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Least angle regres- sion.The Annals of statistics, 32(2):407–451, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:6f8d0eb378f89737a3ab5c9b53d95ae62a414af45b94ae898d83c1eb9402aa6a","observation_id":"a57fe47c-544d-4624-b66b-a8a7b732567a","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Essafri, L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:ecb6ad669ae9c87d7f033b0e98fcddb77c8e49d5c2e46b2cb9683986d0829d33","observation_id":"ba6c87ce-4cb4-4943-87c1-3c856d42f6f7","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Onℓ0-bregman-relaxations for kullback-leibler sparse regression","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:48e81010db565162d7a2a2f98317ce59dd0e92991ad7fc7c142726334636632b","observation_id":"dc7cf454-1155-4ecc-b5ee-c0dcf877ddbf","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Variable selection via nonconcave penalized likelihood and its oracle properties.Journal of the American Statistical Association, 96:1348 – 1360, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:713c6b61fa6db924f25cb8c3931297c9989faf71b53627c8e14f1a6c9e31a38e","observation_id":"d3d6e7a8-df6c-4ed1-83b0-94e43e01c771","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"A paraboloidal surrogates algorithm for convergent penalized-likelihood emission image reconstruction","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:9b88c1234e8e1fdc5dfffecff54b2e127bcbd010f824900a00147a886127665b","observation_id":"025a06e6-58a9-4865-8c45-00bf00b306ca","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Sparsest solutions of underdetermined linear systems via ℓq-minimization for0< q≤1.Applied and Computational Harmonic Analysis, 26:395–407, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:e61f8802986d9945ae3267508ec6b1f1cab2a7780270d3d70ccb687eba506e9b","observation_id":"82c91973-7259-4780-b75a-1f1fb329d1d1","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Perspective cuts for a class of convex 0–1 mixed integer programs.Mathematical Programming, 106:225–236, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:7d338a63fc5b09dfe25b6abef7d84915a6ecc76e16aa9ff71018483c8bff439d","observation_id":"3369f0c0-f853-44c3-bfbe-9ea00529d382","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Pathwise coordi- nate optimization.The Annals of Applied Statistics, 1(2):302–332, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:0a3f3780460448e44e85f25eb5b9bc53b936bbda4e659be30ea5133fe697641f","observation_id":"3b9661fc-c0ed-4a62-ac43-db0f52d79d01","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Regularization paths for gen- eralized linear models via coordinate descent.Journal of Statistical Software, 33(1):1–22, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:672898264389db5fe4772a4f993f0cc66df090d43c18e001afc815c0fd02c905","observation_id":"1b1ca9bb-1896-474b-a80b-f129be9efc55","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Molecular classification of cancer: class discovery and class prediction by gene expression monitoring.science, 286(5439):531–537, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:5fdcea78814a28a73326ebb2e6a529a874dd44cfa726539ed62660eb4a81b0de","observation_id":"968f9e9a-df84-4c7d-acd5-5471a008efa6","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Perspective reformulations of mixed integer nonlinear programs with indicator variables.Mathematical programming, 124:183–205, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:95841bc1eb881a888ead740cf2dea8615cb130f5a046fd2dca51a2ac5577346a","observation_id":"ed3f185f-d4b0-41f9-bbce-3d579ed0dc47","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"A new branch-and- bound pruning framework for l0-regularized problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:3e6158b25a40bf884304dadf2891a80ada74951d8582b318ae2c6d0f32a808c2","observation_id":"8a9e4ca7-05a2-49ee-8a1a-cc53be292040","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.06373","last_updated":"2025-06-04T13:47:43Z","snapshot_observed_at":"2026-08-08T07:17:56.851755Z","submitted_at":"2025-06-04T13:47:43Z","title":"El0ps: An Exact L0-regularized Problems Solver","version":1},"cited_work":{"arxiv_id":"2506.06373","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.06373","snapshot_observed_at":"2026-07-02T00:06:24.099116Z","title":"El0ps: An exact l0-regularized problems solver.arXiv preprint arXiv:2506.06373, 2025","venue":null,"work_id":"270c79ed-f53e-4943-8687-2a972e8b2237","year":2025},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"cited_paper":"/paper/2506.06373","citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:2020dfbbd6a2edafe7efd2e997aae10a637d7651780888969557ab2aa4b194ba","observation_id":"6bf87033-cecd-45c2-8b8a-931a99f2180b","resolution":{"observed_at":"2026-07-02T00:06:24.101765Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-28T13:36:45.131766Z","title":"Fast best subset selection: Coordinate descent and local combinatorial optimization algorithms.Operations Research, 68(5):1517–1537, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:3aa621d5c5e5b9dea51533e1b74c4f22f8bf2b5e3d48219b38bb211fce06c570","observation_id":"06f9f9c6-f8c2-4ccf-8f8e-23c69ae8414b","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"L0learn: A scalable package for sparse learning using l0 regularization.Journal of Machine Learning Research, 24(205):1–8, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:c0d1ba9368ff24824f5def5f9eb14ad536bf02f397c97e35d37192bee39829a2","observation_id":"2b0ce797-d009-42db-9912-a50cfe09b9f6","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Dc approximation approaches for sparse optimization.European Journal of Operational Research, 244(1): 26–46, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:ff123e48b68b45d9fe65c91bf35e116435e280e412c8d7b0881d4251f27ec2ee","observation_id":"cd5e11f8-6f96-4e2e-96e5-378a76eb00ea","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Mallat and Zhifeng Zhang","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:3defa03c93befc092769b2f53613fd1c26c58a319d0f65409530cbadf7892d63","observation_id":"ca4000f7-0bf0-40a2-8eeb-76bb91c190bf","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"L Mangasarian","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:05ee8c4052ba897591b2435dafefa394299b12e6309bd947a28ad73e49347726","observation_id":"897a1e13-8125-48fc-8a44-f9fc39c2d934","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","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":"10.1198/jasa.2011.tm09738","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparsenet: Coordinate descent with nonconvex penalties.Journal of the American Statistical Association, 106:1125–1138, 01 2010","venue":"Journal of the American Statistical Association","work_id":"add0819c-c5a6-4441-95b2-2f55ba19e771","year":2010},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:692aba45178b0b3b5ddaaf5251aabef3ac5324c7c07cf047630750f586c46991","observation_id":"5c034c04-e197-45c4-a838-a971ff4de161","resolution":{"observed_at":"2026-06-28T15:12:18.800367Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-28T13:36:45.131766Z","title":"A fast approach for overcomplete sparse decomposition based on smoothedℓ 0 norm.IEEE Transactions on Signal Processing, 57:289–301, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:0e6cb7d0d116e90a0f5b70cb266ae0da4a3ed0a61ca629715fbde7456c359e27","observation_id":"4f3afa26-f60e-4c65-90e7-fa127958a0d5","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Natarajan","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:1d5ce984b1df6bb10eb7ddb7f3c9854dfb402248bd8b669b4e67978d35d3ea40","observation_id":"65fbc51c-bd73-4422-b19b-1055583bea19","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Gradient methods for minimizing composite functions.Mathematical pro- gramming, 140(1):125–161, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:fdc2d7e56557658be8f099449d39ac69d1fe737ceb40b9a23ab3594b3104a08e","observation_id":"413f1900-c9ef-411c-afae-62052e3573e9","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Nguyen, Charles Soussen, Jérôme Idier, and El-Hadi Djermoune","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:9be2a2083b9c36e1de1889a3d592fe96305d75031640b4099af0bb2ae333e379","observation_id":"0592c879-4565-40d0-b5e5-8122b2a728f3","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Description of the minimizers of least squares regularized withℓ0-norm","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:92673825e81f049c9fa2d51da0ac789d3cfccff5516342a08e927bc7804631ab","observation_id":"59d68779-9363-4b4c-aee9-b1c0a9d7150c","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision.SIAM Journal on Imaging Sciences, 8(3):331–372, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:134309a6b9b68f6934e31c449d442b081ffe27b8f6acb5254e4174dc24e6e5a1","observation_id":"a7f745ad-d6fe-43e4-8d2d-991f4180b831","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:dc86448449ebd141e0197f7b0e897787c7a710981153dbede15456ff1b049a9d","observation_id":"76349fea-2473-4093-8b50-4b11bfc3c8a6","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Pilanci, M.J","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:bb2b4a6d3e887d11f944e00619d9bcbbf3baa9ef7fb8b4dc64ed8d4e57dd36ff","observation_id":"38fdece3-5883-4d87-8ecd-b4496c4b26c1","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Euclid in a taxicab: Sparse blind deconvolution with smoothedℓ1/ℓ2 regularization.IEEE Signal Processing Letters, 22(5):539–543, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:09484a54437791fb50b22b0ebffb338acec1e85d40941e5c33a7ef8ee816f3a2","observation_id":"b0ee8fca-de3b-47a4-95ac-adf72d928c51","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Systematic variation in gene expression patterns in human cancer cell lines.Nature genetics, 24(3):227–235, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:8239f039997130923423fdb3b7371d517ecbcc113cc82325a61c40e83018ad5b","observation_id":"4223279a-0af3-497c-8cc9-292985c5cf33","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Piecewise linear regularized solution paths.The Annals of Statistics, 35(3):1012–1030, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:6ab5c920324cffbc470c1741fbf77d85f0f72e4e97e07692bdc195d1e34d9447","observation_id":"1f841b9b-b600-41b2-a50d-912c3b49ed56","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"A continuous exactℓ0 penalty (CEL0) for least squares regularized problem.SIAM Journal on Imaging Sciences, 8(3): 1607–1639, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:e7b8732398e6081923caff9b23eeb256dec7da931c72d957634eeee40b75cbbc","observation_id":"6a016c7e-41c7-4c1f-9ff1-f8d1ca46cb3e","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"A unified view of exact con- tinuous penalties forℓ2-ℓ0 minimization.SIAM Journal on Optimization, 27(3):2034–2060, 2017","venue":null,"work_id":null,"year":2034},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:9a6a13cd0d4ced5884fbd97a2ee8ea8ba9c81bfeef8508ba829466494c311602","observation_id":"ca2ca20a-758f-44f3-becd-69191d62354c","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"From bernoulli–gaussian deconvolution to sparse signal restoration.IEEE Transactions on Signal Processing, 59 (10):4572–4584, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:77a7c22780e6204a58b15250587925a5282803db00950344c802a830498ba62d","observation_id":"8b378755-d4dc-457c-b6e0-398ef153e549","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:c59c672fe6e09ff0605dc41785f17163eed5d863137c8a7817fcc9066c2a4539","observation_id":"83f322a6-208a-4718-8de5-cce972f067ee","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Regression shrinkage and selection via the LASSO.Journal of the Royal Statistical Society, 58(1):267–288, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:257c75a82d3349b232b3c1a4d3f04e10fefb37b6776403ae00bcc467ed9d2a2a","observation_id":"c1a57735-4c78-4307-a35d-dd7d4adaa420","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Cardinality minimization, constraints, and regularization: a survey.SIAM Review, 66(3):403–477, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:f3c65dd669907f12c9d8aa660f65dda5039f92c454824b99b3f394973ecc3686","observation_id":"3c50515e-3900-4433-bf7e-2c2a47291338","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:20427982f565d2b88cbdf8203a7b259333891e73c9ec7e7017183f09858c17ff","observation_id":"99ee88cf-af4d-4e8c-b078-640abc0c0c98","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Nearly unbiased variable selection under minimax concave penalty.The Annals of Statistics, 38(2):894 – 942, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:214ddbba6eb65f7f18e0174618572d99c3b15b4a423a71ce388b6438aca2be88","observation_id":"39397c6e-4581-4c57-997c-3cf0621c982f","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T13:36:45.131766Z","title":"Multi-stage convex relaxation for learning with sparse regularization","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-28T13:36:45.131766Z"},"links":{"citing_paper":"/paper/2606.02176"},"observation_digest":"sha256:86fb3d3ec5effbe4440b3725b0a341307ce963d7f7d9cd9850d8001486aca3d0","observation_id":"69c55b56-d387-46fa-a850-d05524f4901e","resolution":{"observed_at":"2026-06-28T13:36:45.131766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.02176","last_updated":"2026-06-01T12:34:27Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-02T09:01:41.576000Z","submitted_at":"2026-06-01T12:34:27Z","title":"Relax and Follow: L0-Path Computation with L0-Bregman Relaxations"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":55,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":59},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2606.02176."}