{"as_of":"2026-08-12T03:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7075eda43f3ead589061cb40e7154b4b1720afe64a189a0e1e02f09be07a9ceb","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T10:37:32.664081Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.16815/citation-record","integrity":"/paper/2501.16815/integrity","json":"/paper/2501.16815/citation-record.json","paper":"/paper/2501.16815"},"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-10T10:37:33.396472Z","title":"A determinantal point process for column subset selection","venue":null,"work_id":"772b1758-8ca4-4794-a9cd-8c1d623fa5f4","year":2020},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.432958Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:258bc3b1f11592033187b2644084327dc453fb43063edc720ac8d1f2cd310284","observation_id":"0259d9fc-a17b-42ac-b65d-711d49cd9f32","resolution":{"observed_at":"2026-08-10T10:37:33.403155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.380438Z","title":"and Davies, M","venue":null,"work_id":"75f70070-fb89-48a9-9f57-6d1c8034c177","year":2008},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.440049Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:92f54955cd6693dc17397c7b0fd88688e67d5f8e73753e0b9811c5e4c7a6eb3a","observation_id":"dc4b4e53-145b-481b-a862-7b2fdd624ca7","resolution":{"observed_at":"2026-08-10T10:37:33.385211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.365110Z","title":"and Davies, M","venue":null,"work_id":"2872630b-d21a-4ab9-8ab4-62a60b35ed89","year":2009},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.445993Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:152eb2085c58cd4d30c55b86c79d84b4958b6a6c8351d9b0c69cbe79d76e6951","observation_id":"3c69abef-c247-424c-b182-ae149c52372e","resolution":{"observed_at":"2026-08-10T10:37:33.369851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.349057Z","title":"S., Donoho, D","venue":null,"work_id":"fe8281c1-4ff4-499e-9fcc-8ce6851bfe51","year":2001},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.454158Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:be340f47a88943f6fdc814ffc143faf4c108fc7e3d0a04cfe54eca9ae167e286","observation_id":"912a53dd-18c6-41fa-a0dd-673db3222918","resolution":{"observed_at":"2026-08-10T10:37:33.354763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.331296Z","title":"and Kempe, D","venue":null,"work_id":"9c2893ed-a24a-45f3-a81a-d4baf83b4f14","year":2011},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.460823Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:85c769713495d4021ced131f1fd73f3a9574c47312758e1dcc95f3e9497cfd05","observation_id":"8999d1b9-2c81-41cc-bc04-1e782735ddb3","resolution":{"observed_at":"2026-08-10T10:37:33.337746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.308543Z","title":"and Kempe, D","venue":null,"work_id":"213a80f9-3cf3-4286-9e59-f284a16d3c16","year":2018},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.466869Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:8cff48104da18226556424c0da60a76dc71b8b85e602a6fbcdee9670e2e15d13","observation_id":"0ce96b09-8f4b-4109-914d-1ffe14ed224f","resolution":{"observed_at":"2026-08-10T10:37:33.314262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.289099Z","title":"Adaptive greedy approximations","venue":null,"work_id":"bd6f8d28-c4f4-4c7e-8862-30a9e8d0d05f","year":1997},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.473724Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:d3dcb48833f8e165d6da869c754efaf787a8154f12014d74b220b1c4c9b743ff","observation_id":"f1bd7886-df2b-42e0-bdfa-28f5e054024a","resolution":{"observed_at":"2026-08-10T10:37:33.294976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.270439Z","title":null,"venue":null,"work_id":"0f3cb017-0779-4217-b7e0-9ca6cbf3a423","year":2006},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.479020Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:abb9da3ea48503ff181ab784135aea28362939a8dfec4dd1196e53c235d54f81","observation_id":"47b1e60e-91a2-441b-b208-a4b6cb334c15","resolution":{"observed_at":"2026-08-10T10:37:33.277136Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.251055Z","title":"and Brodley, C","venue":null,"work_id":"0324c234-b512-448f-b9ed-e7d72fcb12f4","year":2000},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.484724Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:14adbae19da1348ef9dc0bdf459e504e9c738923599e7713b01e5c2badb8b567","observation_id":"b302d368-5fb4-46ce-9ff4-bc60dc7a9414","resolution":{"observed_at":"2026-08-10T10:37:33.257697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.232862Z","title":"Least angle regression","venue":null,"work_id":"5ca12a01-62a5-4fa1-b616-e2cf295e24e0","year":2004},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.491065Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:4a30bcce862ff0e48b8991f273a880f0c75f485b9374ddb978cf01fe5329d9cc","observation_id":"f13a764e-bd6f-4c8c-b93d-468a3784c424","resolution":{"observed_at":"2026-08-10T10:37:33.238849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.496132Z","title":"and Li, R","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.496132Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:efbf778448b1ff1068a658ce49766209f5e09fb90a39866d64bbc1aed1f10de2","observation_id":"df4278da-7974-467a-bb5a-5da4590d5194","resolution":{"observed_at":"2026-08-10T10:37:32.496132Z","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-10T10:37:33.196886Z","title":"A threshold of ln n for approximating set cover","venue":null,"work_id":"c3f68076-839e-480f-9dd2-8b50b6638869","year":1998},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.502135Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:18760ec2c206d155b15bdb3a10559fed3b7fc49ff3c493a5a78993b451a48ed2","observation_id":"1629cef4-4b71-4654-8db9-6cf6f72446d8","resolution":{"observed_at":"2026-08-10T10:37:33.201593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.179169Z","title":"Hard thresholding pursuit: An algorithm for compressive sensing","venue":null,"work_id":"80bfdd92-477a-4649-99a0-e226c6b6c652","year":2011},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.507916Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:3c1e2519f451fcffb60b1acb7b503c646a5eaaecd128bf4549f9857854016d4e","observation_id":"707ff1f0-e7e1-43e0-be3b-8b0d990fb350","resolution":{"observed_at":"2026-08-10T10:37:33.184666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.162403Z","title":"F., Ellis, D","venue":null,"work_id":"c56015f0-242d-4b8c-a5da-6a0f262270cf","year":2017},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.514928Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:6ee31e235a4673fd6bd3c6d2450974db03fa222943a56977d14249ae5ba3963f","observation_id":"e39cb41f-d9e1-4054-9d02-8a7751f84a8b","resolution":{"observed_at":"2026-08-10T10:37:33.167754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.519980Z","title":"Superconductivty Data","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.519980Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:3ec65b506522267186b3321140aa37b75f26c631c9f7ab5529f3d6583dd402a2","observation_id":"6d1f0786-6081-4677-8e1c-163e6f295b81","resolution":{"observed_at":"2026-08-10T10:37:32.519980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:37:32.524972Z","title":"The elements of statistical learning: data mining, inference, and prediction, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.524972Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:17850689a3a81064c769ca1ab512d4a2ce5395199e0dab9deaecb171933d1506","observation_id":"cdcce105-bc9c-468f-87ad-f56bd3e8f805","resolution":{"observed_at":"2026-08-10T10:37:32.524972Z","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-10T10:37:33.134958Z","title":"and Mazumder, R","venue":null,"work_id":"852a9a2f-f64d-4109-b538-04658af8d84a","year":2020},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.530177Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:8fdaf8d1efdbbb8b5639b3da12a5cd7070ed98882742f256ab9e35d3d4c95e5b","observation_id":"91e13bf5-2f44-42a8-abca-e664b96cab42","resolution":{"observed_at":"2026-08-10T10:37:33.140192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.118181Z","title":"Learning with structured sparsity","venue":null,"work_id":"3e4efc3e-b7f1-4e83-8116-ea5fa5d160ea","year":2009},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.535126Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:504a5d8cd80aecd68d9d700997b2e702e82cf39717651b5be4612bb5bf351b9f","observation_id":"4f776fcc-1053-4924-801d-7aae5f72456a","resolution":{"observed_at":"2026-08-10T10:37:33.123644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.101674Z","title":"and John, G","venue":null,"work_id":"6aec279c-25e8-451c-978b-3f566b530d47","year":1997},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.540642Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:69cee922c7980283cb0ef196d553950be226ac2f98ecf1d284407c0d048daaa4","observation_id":"597da175-dbdb-4bff-9728-6a4d5f5b62a4","resolution":{"observed_at":"2026-08-10T10:37:33.107119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.083667Z","title":"and Pan, W","venue":null,"work_id":"091b54c2-5b7c-4975-a27b-08967a68efaa","year":2024},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.545384Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:d280e97174b2a1b278a619180c463d0b1d2ae4b97e4598fc4322f26d81b29d34","observation_id":"9f80e9c6-632c-42c2-b44c-b519c3ce9164","resolution":{"observed_at":"2026-08-10T10:37:33.089585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.064140Z","title":null,"venue":null,"work_id":"5dd785ea-685d-42f7-a1bb-6e5faf57bad9","year":1993},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.551480Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:cfe46cb2a3e49108ed1cb0d5b377e74f0f1d30f18669723513567f5b1880ee70","observation_id":"cc726de3-e346-48f6-b3f6-3ef712dc6fc7","resolution":{"observed_at":"2026-08-10T10:37:33.069913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.046262Z","title":"Newtonized orthogonal matching pursuit: Frequency estimation over the continuum","venue":null,"work_id":"08214e0b-2897-4ef4-b78f-bd5eea21a74d","year":2016},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.555823Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:2a97ce72c8db7f4d18380039097e8c44dc5fa3d9405892f059bf71e5c81a6c9f","observation_id":"ea74e519-eb5f-478f-afca-dc725a658e97","resolution":{"observed_at":"2026-08-10T10:37:33.051436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.031053Z","title":"Subset selection in regression","venue":null,"work_id":"7e554aa8-09c6-4584-ad06-f6d3230791a4","year":2002},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.560781Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:8610c79a2982b02dc51a15987d4a3283137395915a2cdfa18a0ccd978c18f6e3","observation_id":"1eb0e486-765d-481d-abeb-7427bcccbe1b","resolution":{"observed_at":"2026-08-10T10:37:33.036178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:33.015284Z","title":"and Tropp, J","venue":null,"work_id":"d1bc7f55-8844-40c2-aa4b-582766dc44d6","year":2009},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.565439Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:deace071e376ec8f9a6adcdc19d92df957f05d3481155c758e53086c025ac83d","observation_id":"4853cd54-c677-4b26-a3dc-987ae096f3b4","resolution":{"observed_at":"2026-08-10T10:37:33.020188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.998334Z","title":"C., Rezaiifar, R., and Krishnaprasad, P","venue":null,"work_id":"4f8b358c-289f-4290-8127-c54d34390fa1","year":1993},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.569973Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:eb12c7c3b97f0ebc0bdde59f3755852b88ccd32a599a7157348d5e78a0725f4d","observation_id":"d67f353f-2103-4b55-80fc-7901b8144d0b","resolution":{"observed_at":"2026-08-10T10:37:33.004026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.574291Z","title":"Scikit-learn: Machine learning in P ython","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.574291Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:2e57b2fd9f86ad457e1c0a0cc11b4045dd0a99f39f0b6b51b127a450745ca8eb","observation_id":"5e9490b6-9e1e-4577-bfeb-a4d79c6cde23","resolution":{"observed_at":"2026-08-10T10:37:32.574291Z","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-10T10:37:32.970186Z","title":"Subset selection by pareto optimization","venue":null,"work_id":"921f0fa9-d417-4f95-a154-963465f6fa45","year":2015},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.579081Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:3cbc987dab8f1495a696208d532e9dab24cfe5a99618b9e09ec3048b20828431","observation_id":"afc276e7-f240-4452-9b19-50a23be599df","resolution":{"observed_at":"2026-08-10T10:37:32.975407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.953905Z","title":"Subset selection under noise","venue":null,"work_id":"eaf74b31-7642-4787-9749-af356a0fbeff","year":2017},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.583662Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:e932b124a499877c5ce897c5e4b5342df38ecbaa7edaf223795de0b0f6b37798","observation_id":"d4ef0e66-d93e-4c02-a1ee-0ee77d65ecb8","resolution":{"observed_at":"2026-08-10T10:37:32.959162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.935864Z","title":"Statistics and Machine Learning Toolbox, 2025","venue":null,"work_id":"3e845468-826a-4fa3-90d6-d3a4da57f9d4","year":2025},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.588380Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:665d0171fe91ff07f0d7a1b63a0f6384bd851ac3be305ad007afe954330bbffd","observation_id":"f5a3044c-5d9d-4d96-8384-767230eeafe8","resolution":{"observed_at":"2026-08-10T10:37:32.940521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.593422Z","title":"Regression shrinkage and selection via the lasso","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.593422Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:a971e5994965fd6ad3016f777fa56e4021ac1ee19a1fb6964776a6244538387e","observation_id":"09060b3f-9503-40fc-af10-bde616fde6be","resolution":{"observed_at":"2026-08-10T10:37:32.593422Z","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-10T10:37:32.901803Z","title":"Revisiting matching pursuit: Beyond approximate submodularity","venue":null,"work_id":"1aeb5d5a-8891-4fe0-a2b9-bacde2679f00","year":2025},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.599655Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:d62873cfe90f0fef591003be6ffb9d526694099f3ae6843bcd131a1e53ab87d1","observation_id":"017c388c-cc35-4803-8f38-45ead7725557","resolution":{"observed_at":"2026-08-10T10:37:32.909012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.882194Z","title":null,"venue":null,"work_id":"3314f9e3-6127-486a-89e1-5f36ec9983af","year":2007},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.606018Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:7236837928cc206a50820cea105a560e3e4768c5b0704367e6a7c5ccacad6b45","observation_id":"f6de3546-e4a3-4c39-a100-e6d4a3b782a5","resolution":{"observed_at":"2026-08-10T10:37:32.888033Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.864382Z","title":"OpenML Dataset 574: House 16H , 2014","venue":null,"work_id":"746d0f36-484a-43b3-9676-2f228255d12f","year":2014},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.611712Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:c3f47210e5a183b52b71c112bcdbcabc0f59bb8c6cc0e3273ecab4fdfb9cd261","observation_id":"12d9d1e5-c744-49e8-9b75-d92df6da4499","resolution":{"observed_at":"2026-08-10T10:37:32.869362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05123","last_updated":"2025-08-26T15:28:36Z","snapshot_observed_at":"2026-08-04T16:46:26.858502Z","submitted_at":"2024-02-04T13:32:01Z","title":"A Survey on Data Selection for LLM Instruction Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05123","snapshot_observed_at":"2026-08-10T10:37:32.617303Z","title":"A survey on data selection for LLM instruction tuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.617303Z"},"links":{"cited_paper":"/paper/2402.05123","citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:bf2594f023df047f399c738dfb12d20daf210db011693840ebf3ca690b276aa1","observation_id":"e0273945-7a8e-44f9-9e4b-474c4a3e9f98","resolution":{"observed_at":"2026-08-10T10:37:32.617303Z","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-10T10:37:32.847735Z","title":"Submodularity in data subset selection and active learning","venue":null,"work_id":"406ad5cb-f4ff-4ed9-871e-6d264c26bdef","year":1954},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.624186Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:ccdd31da9a7396f142cfd3350e2c400331d8ac74ef577ae5fe6d942245233231","observation_id":"58caaf33-f279-4dfc-84ee-f7034cf8f89c","resolution":{"observed_at":"2026-08-10T10:37:32.853317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.830916Z","title":"Nearly unbiased variable selection under minimax concave penalty","venue":null,"work_id":"4769884e-854f-4dbf-93c0-f794c4bfb8d5","year":2010},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.631090Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:204da2acf05d04e4854412631826411a3d676b32c923c0e2b1492d4ccf5e6aa5","observation_id":"5160c311-3a93-449d-b16a-fb69713df2a1","resolution":{"observed_at":"2026-08-10T10:37:32.836388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.813174Z","title":"A polynomial algorithm for best-subset selection problem","venue":null,"work_id":"b274f51b-5e9f-4b43-9f47-cf98fb66d0ae","year":2020},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.639208Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:20777f1573e405f5fe7453f781b6c32a49fe04114e1a9fec6b93d8a753707916","observation_id":"02b49913-2144-4e34-80be-9a3c5885669e","resolution":{"observed_at":"2026-08-10T10:37:32.819060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.792622Z","title":"abess: A fast best-subset selection library in python and R","venue":null,"work_id":"ba3f42cc-b776-4095-8ac5-dd63fa6c8f00","year":2022},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.647308Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:f8ee2e2493b170631b80e9742647058be7f4773ae4511db329e620e4d03f0eae","observation_id":"fbd9a9b2-9efc-4676-9258-2f04ed204f76","resolution":{"observed_at":"2026-08-10T10:37:32.800340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T10:37:32.657436Z","title":"The adaptive lasso and its oracle properties","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.657436Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:42bde410f584c2b3d81811ba75b825fdaa603f3b5420f0ea9ca9350a0192934d","observation_id":"06ce5c1f-c4c7-432c-b340-dbcdbbb3a2e1","resolution":{"observed_at":"2026-08-10T10:37:32.657436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:37:32.664081Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T10:37:32.664081Z"},"links":{"citing_paper":"/paper/2501.16815"},"observation_digest":"sha256:bc2d3274a8bddb885c136d7e1a82772837df7a44bd03e2703cf057008d5e431c","observation_id":"1999af92-6b2b-4851-9b2e-74dfac7b682d","resolution":{"observed_at":"2026-08-10T10:37:32.664081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.16815","last_updated":"2025-08-15T16:03:01Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T10:26:38.140346Z","submitted_at":"2025-01-28T09:44:27Z","title":"Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":40},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2501.16815."}