{"as_of":"2026-08-09T15:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab89e91b5f27b102f336c0832dbb11cbf50273a295dbf830a8717b2bf554e8bd","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:58:31.624209Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2506.03974/citation-record","integrity":"/paper/2506.03974/integrity","json":"/paper/2506.03974/citation-record.json","paper":"/paper/2506.03974"},"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-07T10:58:43.379392Z","title":"Proceedings of the National Academy of Sciences 96(12), 6745–6750 (1999)","venue":null,"work_id":"5f30cfdb-5d33-48bd-81f0-9f51341b4fa4","year":1999},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:25.298647Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:5ec47b42c83f361b1e6cd2e780433bac76ee2b9112f2543eaa1b8704edb720ed","observation_id":"c3bf3866-950d-43f9-967b-6fbedcc2a11b","resolution":{"observed_at":"2026-08-07T10:58:43.539377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:43.135580Z","title":null,"venue":null,"work_id":"566b91d6-17d7-4529-af22-687298b2a268","year":2020},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:25.410400Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:9824fbd6fbbc724e035c58c948ab39333358fb8c8ebbcbf8b85cad49f4248907","observation_id":"b579185c-11c0-4674-a014-b5edfefc793d","resolution":{"observed_at":"2026-08-07T10:58:43.261269Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:42.864171Z","title":"Version 10.1","venue":null,"work_id":"f4331620-f654-4d31-9af6-d4cca8a22f52","year":2024},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:25.589421Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:3f5ccd708f9215b8d95ee3ffb7b986863a08a6cae47a23cd8d5a5835dc5cd9c5","observation_id":"50597a31-7859-4c82-8b1c-0392c5247aa1","resolution":{"observed_at":"2026-08-07T10:58:43.021156Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:42.609279Z","title":"In: Proceedings of the International Conference on Machine Learning, pp","venue":null,"work_id":"304c11a6-8ec4-4c84-a2b1-5dc6db45a398","year":2020},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:25.723494Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:2b1f22f28222c21d095227cceddcbb656af5f60a479602d957d7c8d0a598b2e9","observation_id":"b1338185-eec7-4b20-a7ea-b2455982720c","resolution":{"observed_at":"2026-08-07T10:58:42.741302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:42.394887Z","title":"Optimization for Machine Learning 5, 19–53 (2011)","venue":null,"work_id":"2614c18a-798a-4d5a-80fa-e4d86a9aff25","year":2011},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:25.854855Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:79cdc1946af454959128a62ae70b1e009091f7509eeccae9e1ddd13be6630b72","observation_id":"6a47a3f5-e235-4cb8-9a30-9c24993795a4","resolution":{"observed_at":"2026-08-07T10:58:42.480526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:42.115607Z","title":"Springer (2017)","venue":null,"work_id":"49dae945-be97-4cb1-affe-3e323b01dc68","year":2017},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:26.007630Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:c204451a9f72faeeda110c878ea5202bcdb50d6e2f2146de3846e817171c5fee","observation_id":"9bf05735-8cda-4fe6-997f-4dcc9ee139a4","resolution":{"observed_at":"2026-08-07T10:58:42.279047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:41.874163Z","title":"SIAM (2017)","venue":null,"work_id":"896bbf19-4957-4440-acc9-7df5666a85a8","year":2017},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:26.121198Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:ce2f19f690f3f5f110f5e1c3da4788019ecd047815cbc0cec12897b9f0861cca","observation_id":"584eeb57-0ad9-45cf-b9c1-b138f48d5aaf","resolution":{"observed_at":"2026-08-07T10:58:41.963663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:26.229691Z","title":"SIAM Journal on Imaging Sciences 2(1), 183–202 (2009)","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:26.229691Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:d8892397a1470674eb43f747636d8ec0eb3e89277d41540f2dfae920e0f10d8a","observation_id":"d444438e-1325-4840-80db-97ab7b7fdb1b","resolution":{"observed_at":"2026-08-07T10:58:26.229691Z","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-07T10:58:41.565066Z","title":"Optimization Methods and Software 37(5), 1740–1769 (2022)","venue":null,"work_id":"9087e9bd-1341-4a37-ba33-0d9511804577","year":2022},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:26.369125Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:d930e2e9f1f6498d5a321190afba2feabb3d70cd4aee2bbffb1b123cebee4daa","observation_id":"dea2a266-e01e-4e3c-a4aa-09d2237e116c","resolution":{"observed_at":"2026-08-07T10:58:41.705336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:41.291184Z","title":"Proceedings of the Advances in Neural Information Processing Systems 35, 38950–38965 (2022)","venue":null,"work_id":"038186f5-37cc-4fcc-b69a-8280ae231bb6","year":2022},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:26.479550Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:6a9395e1e346e30606ded593c20768377fbf04ed7253a90833451d4af25c868c","observation_id":"f5a6b88d-5842-45b7-a7a0-079141476bd8","resolution":{"observed_at":"2026-08-07T10:58:41.436795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:41.097087Z","title":"SIAM Journal on Optimization 31(3), 2340– 2367 (2021)","venue":null,"work_id":"9a4927bd-e424-4052-b084-8fd3fd691594","year":2021},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:26.633635Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:c2aa5c0f22af95f73879c52d51c0be6b4043d3c49f1654d6946e994c9f5b514b","observation_id":"4146ac5c-b1f7-42ee-8eb2-e7248d759e6d","resolution":{"observed_at":"2026-08-07T10:58:41.193821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:40.815575Z","title":"The Annals of Statistics 44(2), 813–852 (2016)","venue":null,"work_id":"8e738ea9-19d2-4aaf-933b-2aa76436b4c6","year":2016},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:26.756339Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:4f20284c697329fc8749383d4cbc3f74d21b8b261ad4eb611dd46ec912bb5230","observation_id":"36cdba17-b9a7-4063-a09f-fcfef630f43d","resolution":{"observed_at":"2026-08-07T10:58:40.941205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:40.503943Z","title":"Applied and Computational Harmonic Analysis 27(3), 265–274 (2009)","venue":null,"work_id":"822ac46d-0e63-491e-9f21-52f9d4b7fb66","year":2009},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:26.858858Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:3b3467c802e6f766f46d6a5873b0bbd191baf89406c31323208fd3db7360d8d6","observation_id":"fa7ccf52-2b23-4651-ba45-16ec078a6ab8","resolution":{"observed_at":"2026-08-07T10:58:40.656540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:40.264178Z","title":"IEEE Transactions on Signal Processing 64(6), 1405–1419 (2015)","venue":null,"work_id":"6c23f1d1-6334-4f4e-a6c5-3272723ddbdd","year":2015},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:26.979818Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:2e79e1874804a47bd791ac7a87ffaf13ea96d799fa4ca6a98b33e23ab0f89cef","observation_id":"e1379499-dc67-414f-bbc5-0dd617b0e16e","resolution":{"observed_at":"2026-08-07T10:58:40.364366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:40.010893Z","title":"Foundations and Trends® in Machine learning 3(1), 1–122 (2011)","venue":null,"work_id":"a24a2d60-22d7-4527-8ab3-af6a5acede9b","year":2011},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:27.091372Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:2a3b4d8587a388e5bc1e9299f7d6dc2f30e892e915364a8dc0c888208d0a52a9","observation_id":"fe0c24b8-ea5a-4061-97d4-7af8ea18d2b5","resolution":{"observed_at":"2026-08-07T10:58:40.110641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:39.748621Z","title":"Annual Review of Statistics and Its Application 1, 255–278 (2014)","venue":null,"work_id":"6f7a1197-d7f5-4667-aea3-f0da6f2fe924","year":2014},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:27.208247Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:95d89af047c1457cfd9e23814e5bc08bcf315df5bf4064a6ec2cd500f1a75692","observation_id":"34ac9ca8-8fab-4dcb-89a3-c66898082573","resolution":{"observed_at":"2026-08-07T10:58:39.882602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:39.493288Z","title":"Springer Science & Business Media (2021)","venue":null,"work_id":"a5312f80-4645-4a0b-bec8-0491c3309926","year":2021},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:27.309791Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:b056fdbb1131b097dd1f9ffca70b12f0e1bfc067bddfa5f2346ef770403c37a1","observation_id":"e8ff1042-bc0a-4eee-a6dc-002606750790","resolution":{"observed_at":"2026-08-07T10:58:39.610574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:39.205869Z","title":"In: Proceedings of the International Con- ference on Acoustics, Speech and Signal Processing, pp","venue":null,"work_id":"af7f5ad4-1fd4-4f8e-aaaf-75bcc1bdcdb7","year":2014},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:27.403313Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:c868e80693836eba769befc0a44f7354ac61a29f1023ab6a6dc759f1253d1ec4","observation_id":"e68c0839-dd02-477f-ad84-7e927868f7fb","resolution":{"observed_at":"2026-08-07T10:58:39.338970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:38.945311Z","title":"In: Proceedings of the European Signal Processing Conference, pp","venue":null,"work_id":"ca55877d-2120-42d5-9e00-23c70a73de40","year":2013},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:27.519894Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:2ae0cfd9f1cf3dd11ed37a25d5f894c76a915b78fca0889df206cfa07c142dc5","observation_id":"e3766fc8-d017-4cee-beed-05b05e69db7a","resolution":{"observed_at":"2026-08-07T10:58:39.056378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:38.719801Z","title":"ACM Transactions on Intelligent Systems and Technology 2(3), 1–27 (2011)","venue":null,"work_id":"5d800822-6096-4358-8251-5928d10f53ff","year":2011},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:27.595161Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:77c35032e05ce4e8a12f7ebe805ddf8f17a76013d1a1b4de010cacd3f5f8ad6f","observation_id":"cae6377b-4fd2-4892-99f3-c91270c4794a","resolution":{"observed_at":"2026-08-07T10:58:38.810705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:38.452578Z","title":"International Journal of Control 50(5), 1873–1896 (1989)","venue":null,"work_id":"1f7d9cab-9566-4133-b672-7c8f68454fce","year":1989},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:27.724822Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:9923fc4c40c110c926f96335956c78ff4e3f9f4d1c94a9a28d13b7b18586cdef","observation_id":"025aeaf2-0192-4b9c-a5e7-0f4be8d0ed94","resolution":{"observed_at":"2026-08-07T10:58:38.581437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:38.280070Z","title":"Mathematical Programming 143(1), 371–383 (2014)","venue":null,"work_id":"0c8af61f-faf8-4d02-8eeb-0ae5e4279631","year":2014},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:27.877776Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:85df32b6ad64695ab36254446353cbb46ea5aa9dd0a2f0f8087d97d149f273fc","observation_id":"d698c786-98d6-448a-9baf-3e154aa2f7d1","resolution":{"observed_at":"2026-08-07T10:58:38.339684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:28.005142Z","title":"1: User’s manual for cplex","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.005142Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:e4d6318b7183abbe83b28cd528493d7221b65115309afc18126d20611a889d22","observation_id":"c6a5960b-0f77-42bd-9b07-9e5b8a8a1168","resolution":{"observed_at":"2026-08-07T10:58:28.005142Z","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-07T10:58:38.024533Z","title":"The Journal of Machine Learning Research22(1), 6008– 6054 (2021)","venue":null,"work_id":"61ded595-0e6b-470f-8070-40b9f7347e15","year":2021},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.087786Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:969c64e984d6b3213287c75e10171de7ff4a42a6e7291553dee8f837a69ef5bc","observation_id":"d6641314-8610-46f5-b462-580f610bb16b","resolution":{"observed_at":"2026-08-07T10:58:38.145189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:37.797401Z","title":"In: arXiv preprint (2022) Title Suppressed Due to Excessive Length 39","venue":null,"work_id":"072550fc-68b3-4fa0-bcf5-645b85c18a1e","year":2022},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.227252Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:21474fda2cf996b8ff339b1d8d90a3024dc829439550008a8da57cd18f560050","observation_id":"64e6f958-dad9-48c4-8cb8-efa836c3e1fb","resolution":{"observed_at":"2026-08-07T10:58:37.937648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:37.613462Z","title":"IEEE Transactions on Image Processing 18(9), 2059–2070 (2009)","venue":null,"work_id":"3596ec4a-f7f2-41ee-b6d5-2afe656d041f","year":2009},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.304468Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:8a046a5ba5643521c1fab90882153d30ddbcc09b2c5268d39353c515a93efb6e","observation_id":"2e85cae8-63b0-432c-b640-3318d11d8793","resolution":{"observed_at":"2026-08-07T10:58:37.719702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:37.454057Z","title":"The Annals of Applied Statistics 3(2), 521–541 (2009)","venue":null,"work_id":"82c87b4b-fedf-40a3-b938-6f24b5d9a85f","year":2009},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.423512Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:6e995cc229b402adee34ef6229b6babc006dae760d4f1a0f6d09858502cc0981","observation_id":"38187c53-5d32-4f6b-8545-b1d1f3db096a","resolution":{"observed_at":"2026-08-07T10:58:37.539409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:37.234116Z","title":"Journal of Statistical Software 33(1), 1–22 (2010)","venue":null,"work_id":"4497ba7a-774b-4dd5-8f7d-f7e5239d149a","year":2010},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.513184Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:ec4856da0a5e4b54d3e3d93869469d18918fa0ef5d08d14e146772afff46cc05","observation_id":"a5fd09a0-0e85-4fb8-b26c-019cd8e073b8","resolution":{"observed_at":"2026-08-07T10:58:37.340121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:36.972561Z","title":"Science 286(5439), 531–537 (1999)","venue":null,"work_id":"eb3ac1ac-0d31-407a-87d3-509fd38977fa","year":1999},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.599808Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:52e182693de947b922d69735ff82733fcf1c24beef536af79d6906b665e4c48c","observation_id":"b88a7970-5cee-4311-8726-cf5be8ffa496","resolution":{"observed_at":"2026-08-07T10:58:37.072852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:36.734459Z","title":"In: Proceedings of the International Conference on Acoustics, Speech and Signal Processing, pp","venue":null,"work_id":"8126a41d-8d10-4f74-94e6-2abbf1a2f76d","year":2022},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.702608Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:2ab77e24e5dadeb2875b832c38626b07fd9d5acae1b79177392ef219bf4c910b","observation_id":"7a74a5de-e63d-4aff-99c9-3cd934fe3d02","resolution":{"observed_at":"2026-08-07T10:58:36.840636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:36.473710Z","title":"arXiv preprint (2025)","venue":null,"work_id":"f255678d-e9e4-4adc-82fe-d18f0ed0ad47","year":2025},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.859092Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:099bdcd2cc588d096523c30e8f5f4c3654d20bc75174a5b80c16a52578864ac5","observation_id":"cf09d285-4e9d-4004-80d0-2b96896a6ce3","resolution":{"observed_at":"2026-08-07T10:58:36.603843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:36.275773Z","title":"In: Proceedings of the International Conference on Machine Learning, pp","venue":null,"work_id":"d1715d7d-b445-4789-8f04-b18c71e25ff2","year":2024},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:28.974829Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:7c0f0ba41cf70c7ad5abd7062256a912ede94143fe29ef85a30bfda4540394c4","observation_id":"580473bf-5d5d-4ad0-8338-010e3e3f18cc","resolution":{"observed_at":"2026-08-07T10:58:36.347147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:36.110697Z","title":"In: NIPS Workshop on Feature Extraction and Feature Selection, vol","venue":null,"work_id":"f2e31789-7a6a-4c35-9a7f-17c1a8006a62","year":2003},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:29.073343Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:20ae06e1f4ff2de24e23b472b23d3e4e703e6ea8e42b2ec52febab3b82d477b9","observation_id":"05214265-a8f6-4efc-bb73-15c8a464285b","resolution":{"observed_at":"2026-08-07T10:58:36.179037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:35.908464Z","title":"Journal of Machine Learning Research 24(205), 1–8 (2023)","venue":null,"work_id":"69fc75dc-6826-455d-b918-813d5c11728d","year":2023},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:29.166051Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:2c265049c3e2794b74dba6326527532cebb5cfe9f49490e2507579a43f6dfd5a","observation_id":"9520e160-e91f-44ad-b581-35d8f10bc23a","resolution":{"observed_at":"2026-08-07T10:58:36.002095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:35.721691Z","title":"Mathematical Programming 196(1), 347–388 (2022)","venue":null,"work_id":"a50377a7-63a8-4b34-a13c-88ac25ced727","year":2022},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:29.267866Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:1d3c74831ac412062ed98637d2942058db28754ae581ecfb69bc5418be0ffbd1","observation_id":"d97c758f-1e1a-4fab-8b30-5e1a114bc4e6","resolution":{"observed_at":"2026-08-07T10:58:35.806719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:35.538320Z","title":"In: Proceedings of the European Signal Processing Conference, pp","venue":null,"work_id":"5b8bb6ef-38cb-4dd1-9f6e-ba3f66f495a8","year":2010},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:29.381362Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:aa2eed9b6a135d28027e93e9c9b5568a05af98e0f301095a0999a51be50a4772","observation_id":"cd2549ee-bf8c-4c43-a3af-f0e2e1269a48","resolution":{"observed_at":"2026-08-07T10:58:35.618124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:35.320095Z","title":"Optimization and Engineering 20, 397–455 (2019)","venue":null,"work_id":"cc8852e6-02cb-4b2d-aa2e-0b74e87aa5b6","year":2019},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:29.503165Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:d97695aa2ee27fe1520d54d2bc0dde328c9fae3309825c4bc4313ce81b6fc965","observation_id":"6ba18cdf-627b-4c47-b633-86eaba8f4ae8","resolution":{"observed_at":"2026-08-07T10:58:35.415509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:35.155731Z","title":"In: Proceedings of the Advances in Neural Information Processing Systems, pp","venue":null,"work_id":"92a919ef-1ace-4d73-b3b9-107bf7171460","year":2006},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:29.655195Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:06b456c8e32d793f426a50b7fb3cd2106e03d4c4e6a07940a40e8b302f7fdf6f","observation_id":"96478871-2577-450c-81f6-b534564c4c07","resolution":{"observed_at":"2026-08-07T10:58:35.239579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:34.955125Z","title":"Computing Surveys 50(6), 1–45 (2017)","venue":null,"work_id":"67cef2f3-3cd1-427d-ac61-9c2d304ee2aa","year":2017},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:29.797676Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:744d91529c258f2600ce5b9547d84f8e021a7f4e173d9af2fb719bcfb085082b","observation_id":"e3a0c08a-dc41-46c3-beed-cca1351f05ce","resolution":{"observed_at":"2026-08-07T10:58:35.054596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:34.752468Z","title":"Cell 173(2), 400– 416 (2018)","venue":null,"work_id":"737da983-a808-48a6-8406-45bc23dd4a13","year":2018},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:29.939683Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:69d82a1efc708ec1390e7c44fcf45ec6a681dd65d5dce135a8f64325c4c8e775","observation_id":"1b222369-6a16-4056-8378-845e036f88b3","resolution":{"observed_at":"2026-08-07T10:58:34.861743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:34.544327Z","title":"SIAM (2013)","venue":null,"work_id":"720d7e17-c64a-49eb-85e6-d63bf994ffad","year":2013},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:30.073152Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:8b55f18eeb3925e5f7945039b279f0cc454af6aba1d6bc385ee3928bc39fc4c2","observation_id":"e3356191-629d-4894-9d57-f90c94aacbcf","resolution":{"observed_at":"2026-08-07T10:58:34.635778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:34.341538Z","title":"In: NIPS Workshop on Optimization for Machine Learning (2017)","venue":null,"work_id":"db5441cf-3a02-4a5b-bdaa-d5ac73df2c2e","year":2017},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:30.183047Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:29366be11e0a26582b9f920a43ce3e732595b4663179dd05a535d10fd0005a61","observation_id":"22110f71-91ec-4256-b04d-78c6d49689d6","resolution":{"observed_at":"2026-08-07T10:58:34.438051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:34.171200Z","title":"In: Proceedings of the International Conference on Acoustics, Speech and Signal Processing, pp","venue":null,"work_id":"d9ad9b2c-e65d-46fd-894b-1f55e1b5f019","year":2020},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:30.314649Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:d8d2083dfa9b640bc735896a3a68f714e53271ff463a21f4fac1b505adce4374","observation_id":"9f908c3f-0091-4a3a-b5f4-60eb0879d32b","resolution":{"observed_at":"2026-08-07T10:58:34.258532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:33.956193Z","title":"Applied and Computational Harmonic Analysis 26(3), 301–321 (2009)","venue":null,"work_id":"dfd8aa63-2a83-44d9-976f-1dbaa0ee8fe4","year":2009},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:30.428043Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:85f3215c67594feb009de23c4708b1bebca79f31efbb7da16a4777d2dcd71cf9","observation_id":"45e6c61d-9e4a-4e93-aa49-8d51c3371405","resolution":{"observed_at":"2026-08-07T10:58:34.044039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:33.766292Z","title":"Mathematical Programming 151(1), 63–87 (2015)","venue":null,"work_id":"9350766c-f1cf-4a96-866a-3e9cf6cd5d9b","year":2015},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:30.568585Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:6e693b8c9cf44617dce3c8e0edbc245b076c9fc274f3588a045bbfec8ecea0fd","observation_id":"176fa3f6-8ff4-4238-9ac0-cd5451608370","resolution":{"observed_at":"2026-08-07T10:58:33.855865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:33.539845Z","title":"Research Synthesis Methods 12(4), 448–474 (2021)","venue":null,"work_id":"68696a39-9c30-49b5-b3d5-4819dc59bbc9","year":2021},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:30.745026Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:d0a6173010ce8e9d97f69902cac0fb7d9fc4a46400fe054151e52d5c405b3424","observation_id":"e212eed4-702c-4260-9910-0b6843cb5df2","resolution":{"observed_at":"2026-08-07T10:58:33.667995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:33.284785Z","title":"Optimization Methods and Software 39(1), 4–41 (2024)","venue":null,"work_id":"60255867-76b6-4333-86d3-10090bbf08fb","year":2024},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:30.872881Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:3b1cf5dfcf87b7c14ceaddf45a06a9d7aca4d91b3192b7a539f1de46602f2eb6","observation_id":"64e93eea-13fd-4c29-bf1d-3ef244d67ab3","resolution":{"observed_at":"2026-08-07T10:58:33.450677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:33.067118Z","title":"SIAM Journal on Imaging Sciences 8(3), 1607–1639 (2015)","venue":null,"work_id":"f274e0b3-9614-4e73-9eb4-decfd73e8c80","year":2015},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:30.997523Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:b658c39ad6ae15e4c66767345fa57904bb29dafd136073e97216cc865ef380fc","observation_id":"afd4f004-12ca-45ba-9539-87f3bf02e6d0","resolution":{"observed_at":"2026-08-07T10:58:33.176202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:32.859379Z","title":"IEEE Transactions on Signal Processing 59(10), 4572–4584 (2011)","venue":null,"work_id":"bb190f15-7ac8-478e-91ef-cad268b68d7a","year":2011},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:31.089319Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:442e733cd02c3b6211e51c75879eca4a5b3bf8e5f8bc068320233308305ad5d7","observation_id":"93b3297d-0f09-4c18-8e04-e34492ceed18","resolution":{"observed_at":"2026-08-07T10:58:32.943988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:32.689595Z","title":"Journal of the Royal Statistical Society Series B: Statistical Methodology 58(1), 267–288 (1996) 40 Cl´ ement Elvira et al","venue":null,"work_id":"c183e913-a0b3-4268-a25e-8f29656d0050","year":1996},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:31.213823Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:eafd1eb009623ece42b094a626f2357977387dc249d3b20dfc045b1459cb9b69","observation_id":"f877ec2a-95b9-496b-8fa2-322e8a722041","resolution":{"observed_at":"2026-08-07T10:58:32.777550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:32.484739Z","title":"SIAM Review 66(3), 403–477 (2024)","venue":null,"work_id":"4c24c723-3ff7-45fa-a535-05a2a2a0fcd1","year":2024},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:31.261454Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:01a5f9382380f072fc69105f80bb4b750084c3325de861c3cb1a7631918531fb","observation_id":"5d3c8547-444f-41e7-bfb8-1c0285da830c","resolution":{"observed_at":"2026-08-07T10:58:32.572576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:32.276137Z","title":"Proceedings of the IEEE 98(6), 948–958 (2010)","venue":null,"work_id":"01dc13b1-6c2e-4d1f-a1a7-63f80cda5e40","year":2010},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:31.356346Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:c556ed47ab2d648312cfa2b4800dffc23102f07e296d0244f5fcd57cd2042206","observation_id":"890d17fb-4b81-41b6-8ff9-1e8184f20aae","resolution":{"observed_at":"2026-08-07T10:58:32.389221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:32.078133Z","title":"Mathematical programming 151(1), 3–34 (2015)","venue":null,"work_id":"a75451a9-aad8-402c-bf39-e51369ec73d0","year":2015},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:31.439263Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:a2d3e3241c418964fa5d3bb996da74c3d29e3a2f55925a1c1f0483e3a7c29151","observation_id":"0da21eb0-3ad7-40f5-89d7-df1700d04231","resolution":{"observed_at":"2026-08-07T10:58:32.169351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:31.903270Z","title":"The Annals of Statistics 38(2), 894–942 (2010)","venue":null,"work_id":"e1b8cf38-73d5-4e32-a784-6876f1988d32","year":2010},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:31.549151Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:049a1b6d54fe8e5d61825a392d9dd3400b4e9938376273073f7c6947723837aa","observation_id":"c565c835-3810-4b65-bbeb-f86571824f9c","resolution":{"observed_at":"2026-08-07T10:58:31.978248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:58:31.736525Z","title":"Journal of the Royal Statistical Society Series B: Statistical Methodology 67(2), 301–320 (2005)","venue":null,"work_id":"74b53486-d43b-48d1-a474-3b0f39e3f92a","year":2005},"citing_paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T10:58:31.624209Z"},"links":{"citing_paper":"/paper/2506.03974"},"observation_digest":"sha256:63cdacf1448e8781f5f62e619a04f7a1f97bde48d0e6a9dcac120c8685996122","observation_id":"fd98624e-8df1-40e6-a0ec-886a2e7c0e53","resolution":{"observed_at":"2026-08-07T10:58:31.817280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03974","last_updated":"2025-06-04T14:05:49Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T10:47:55.767964Z","submitted_at":"2025-06-04T14:05:49Z","title":"A Generic Branch-and-Bound Algorithm for $\\ell_0$-Penalized Problems with Supplementary Material"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":51},"total_outbound_references":55},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:2506.03974."}