{"as_of":"2026-08-15T15:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:be11af251f3a9ea9efb080e9036300685fc9a19239be940a1239e2e7e0c50297","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:12:39.674155Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2508.18901/citation-record","integrity":"/paper/2508.18901/integrity","json":"/paper/2508.18901/citation-record.json","paper":"/paper/2508.18901"},"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-05T16:12:40.302425Z","title":"Ultrahigh dimensional feature screening via RKHS embeddings","venue":null,"work_id":"c2a6491f-5a30-44eb-9f0a-7ea70fed42b6","year":2013},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.484154Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:9b5d63a82577ca122163f0933e9f228195f992c6be35a5db74833a22f3b1417a","observation_id":"9bd4e2c9-04f6-4522-b8fa-fc32c42e980a","resolution":{"observed_at":"2026-08-05T16:12:40.306388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.287622Z","title":"Barber and Emmanuel J","venue":null,"work_id":"3ce1aae3-2da3-4374-8843-1ac9b72f0614","year":2055},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.488805Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:b373664bfa8d507c5c3a3dd67c78dad87972679dcf23d98f11de448b979f6034","observation_id":"0beb618e-26e9-4e00-8898-e7599f9b3652","resolution":{"observed_at":"2026-08-05T16:12:40.294106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.274296Z","title":"Barber and Emmanuel J","venue":null,"work_id":"aaeae5b3-d784-43bc-bf1e-100fb9ce2231","year":2019},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.492916Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:71ecc301aed1ef09004ced9567a71afa9ca079d31fb7af40033672d8f29b4005","observation_id":"53c319c8-ad45-455a-b9e4-ac1883f4ea5c","resolution":{"observed_at":"2026-08-05T16:12:40.278131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.261075Z","title":"Cand \\`e s, Yingying Fan, Lucas Janson, and Jinchi Lv","venue":null,"work_id":"d07937d7-84e3-44f4-afdf-c8993e50621f","year":2016},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.496645Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:65d5616c6d1b914f12a751518c44220186654fd242d1d7fc386a519d91ce0f01","observation_id":"8dbb3fd6-84d1-46a8-b00a-c6ebaa7dddd4","resolution":{"observed_at":"2026-08-05T16:12:40.265490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.247509Z","title":"Cand \\`e s, Yingying Fan, Lucas Janson, and Jinchi Lv","venue":null,"work_id":"5fd44b1d-7a38-4566-964e-739559095df6","year":2018},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.500480Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:9b7869e26a2e0ba33102758b85fc5ff3378718786c8ab815a3096ee4c950f259","observation_id":"53eb2660-f70d-4cc9-b3f7-0451cc612596","resolution":{"observed_at":"2026-08-05T16:12:40.252209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.235117Z","title":"Block hsic lasso: model-free biomarker detection for ultra-high dimensional data","venue":null,"work_id":"5193087f-7683-4b85-8663-7b43f44990e7","year":2019},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.504593Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:4ce15229f0bc0b5c1dce40b6e9879743b8f9f1d352a9114f191b43eed70d1886","observation_id":"99d25705-db83-41c4-9bd6-b2f09f186d2b","resolution":{"observed_at":"2026-08-05T16:12:40.239191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.222641Z","title":"Global sensitivity analysis with dependence measures","venue":null,"work_id":"71fb60b1-fcee-46fe-bb0a-a6ed15ad6812","year":2015},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.508739Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:cb9e9bc32fdfc171afcf55c3caf253a4c77192b9b0dc7cff27ef1cf2aeb1a792","observation_id":"b68306c7-8d0c-43d1-a4f5-df0346734792","resolution":{"observed_at":"2026-08-05T16:12:40.226559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.04858","last_updated":"2016-12-14T22:04:33Z","snapshot_observed_at":"2026-08-14T21:25:25.100071Z","submitted_at":"2016-12-14T22:04:33Z","title":"Bayesian Optimization for Machine Learning : A Practical Guidebook","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1612.04858","snapshot_observed_at":"2026-08-05T16:12:39.512421Z","title":"Bayesian optimization for machine learning : A practical guidebook","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.512421Z"},"links":{"cited_paper":"/paper/1612.04858","citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:7b32cde767fa71351e3776e97172de786c0001002ffc02ded3b7033d322a8dc6","observation_id":"0e734f59-e122-4250-aafd-a34fe4d2261a","resolution":{"observed_at":"2026-08-05T16:12:39.512421Z","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-05T16:12:39.516365Z","title":"CVXPY : A P ython-embedded modeling language for convex optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.516365Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:c37d9ec0a6046db647367bbb0a0f70e8bbb51cea01f83f8aabdf028ad62d9c1a","observation_id":"228e2eb4-671c-4d9d-bf1b-5edfcf5075d8","resolution":{"observed_at":"2026-08-05T16:12:39.516365Z","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-05T16:12:40.202420Z","title":"Least angle regression","venue":null,"work_id":"c41e793d-bdbb-4c77-b14e-8e162c07cc6b","year":2004},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.520462Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:a495d4d3168d0bd19e5c2ce587192e07d082d0b692c032df77f1af3f0ae9d3c2","observation_id":"7f1bd447-62f4-4070-9e46-9aef77ab9d22","resolution":{"observed_at":"2026-08-05T16:12:40.206228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.190425Z","title":"Variable selection via nonconcave penalized likelihood and its oracle properties","venue":null,"work_id":"9223d9b5-802d-4dd9-ac20-e4cf8252a7d5","year":2001},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.524783Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:a0af7288a8b9a537328c01baff9c0ace086f2565b8df08fca888bf9f98a08179","observation_id":"2e5581c9-8fb3-4311-aa7e-ab59330010c1","resolution":{"observed_at":"2026-08-05T16:12:40.194541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.176325Z","title":"Sure independence screening for ultrahigh dimensional feature space","venue":null,"work_id":"22b475dd-6747-44e7-8c2f-9de3178bdd6c","year":2008},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.528419Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:216d9ed594f117a836ee0240c8529628f41c9371acd67fcf32794a28ec74ab83","observation_id":"9d275ab1-54d7-46c8-a83c-8581a3f5acdb","resolution":{"observed_at":"2026-08-05T16:12:40.182409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.163539Z","title":"Nonconcave penalized likelihood with a diverging number of parameters","venue":null,"work_id":"c19d5d33-d333-48ad-9727-2d739d9f1d09","year":2004},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.531907Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:1e7872e36a7be95e4d0732b4ac2737638907587edee2ba40e638284577fd6714","observation_id":"c6451dd2-d6e5-4c1b-88fd-8a1059f17ba1","resolution":{"observed_at":"2026-08-05T16:12:40.167633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.150348Z","title":"Network exploration via the adaptive lasso and scad penalties","venue":null,"work_id":"dc3a63c7-bdc6-49fe-94cd-9eaefaa8bd01","year":2009},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.536389Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:60a3bd52a6162fc2c6e62769fc1a5c161b41b72c1dc7d8a9d9997daeefa64383","observation_id":"bc2cba14-9ebd-4614-9a92-ab6972e0b83d","resolution":{"observed_at":"2026-08-05T16:12:40.155129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.138062Z","title":"Strong oracle optimality of folded concave penalized estimation","venue":null,"work_id":"9142f747-afb5-4461-9afa-cb0e5adb9b80","year":2014},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.539967Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:3298052383f9dbbc29d717ca35af676304690acd73bc59f4ac58c877fe42985f","observation_id":"da584171-24f0-48c7-9802-4779895fb4d8","resolution":{"observed_at":"2026-08-05T16:12:40.142269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.126079Z","title":"Rank: Large-scale inference with graphical nonlinear knockoffs","venue":null,"work_id":"8fb67dea-9e1b-47f4-aa6a-9684d21242a3","year":2020},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.543673Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:b1b689edbc2661be9737a441e1f172ab73b960380f2426bc213ff3321fc845b7","observation_id":"11edee67-cb4f-423c-8483-1cc0a8891507","resolution":{"observed_at":"2026-08-05T16:12:40.130022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.114181Z","title":"Fermanian and Benjamin Poignard","venue":null,"work_id":"5dc929d8-d718-4c25-bfa6-42c7feae5438","year":2024},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.547389Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:b6106ae6bf35a8ab39b0739149e102278e9bed36f0af31e23a08cc7332d06160","observation_id":"d0529a6c-faac-4555-9e64-171c47c97311","resolution":{"observed_at":"2026-08-05T16:12:40.118014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.102184Z","title":"Sriperumbudur","venue":null,"work_id":"49a91f1b-4da4-4b47-9b67-e2caee9ad6f9","year":2009},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.551218Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:7adb183229dd236616c5c1fc76ac0a3fe9f46d0ef22e1074d9238f574a6a509e","observation_id":"c9b1b3b5-8991-4937-8e19-efc486cd0a63","resolution":{"observed_at":"2026-08-05T16:12:40.105804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.090066Z","title":"Type s error rates for classical and bayesian single and multiple comparison procedures","venue":null,"work_id":"eafc3708-8c72-45ff-aa9c-05c73050ae49","year":2000},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.555285Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:93e2f60211d3dc4b49235f2bf20f3284df8d2aaf25e92a4f40afdfc7520e52d8","observation_id":"d6af030a-acbb-4e7d-8096-7b73614d83bc","resolution":{"observed_at":"2026-08-05T16:12:40.094122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.078085Z","title":"Measuring statistical dependence with H ilbert- S chmidt norms","venue":null,"work_id":"bd73e608-b989-4f45-8aec-cdcb95903e2a","year":2005},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.559106Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:fb8797aa8dddb3700b0ead587f2302d953fc1e94f637c0d8881593d322aa2394","observation_id":"cf9e51e8-dce6-425b-b54e-302a60a283e2","resolution":{"observed_at":"2026-08-05T16:12:40.082096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.065711Z","title":"Kernel methods for measuring independence","venue":null,"work_id":"6aae9897-eda8-4f42-a538-66c38d5fa41b","year":2075},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.563059Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:44ce7c6c2dae9e88add1f07210a4cbecdd5dfed2f9dba27bab03b8705a324f03","observation_id":"6d3c52db-af3f-4ad8-89c6-5150c141efe7","resolution":{"observed_at":"2026-08-05T16:12:40.069699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.053604Z","title":"Teo, Le Song, Bernhard Sch \\\"o lkopf, and Alex Smola","venue":null,"work_id":"5f226d3b-eb57-4f82-a15a-7cd7e2b08d91","year":2007},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.567407Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:7ce62e5255081ea337b7e448ff4174a05d72606d5c93c2bcc93f1c6cf71366ed","observation_id":"14c602a8-6a5e-47a7-8218-c1f451f8de12","resolution":{"observed_at":"2026-08-05T16:12:40.057523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.041392Z","title":"Structure-based design and classifications of small molecules regulating the circadian rhythm period","venue":null,"work_id":"14ec8ae4-ed41-4eb4-8386-8f92f11fbe32","year":2021},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.571105Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:12b438baa0dbd732f0de0e0788fa4ec35434c45be5693af772d602e0dc5afad9","observation_id":"23b1c06b-31de-4993-9735-c075bdb59474","resolution":{"observed_at":"2026-08-05T16:12:40.045512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.029297Z","title":"An introduction to variable and feature selection","venue":null,"work_id":"774b6b4e-7f35-4288-b030-8f56347164a1","year":2003},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.574848Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:6c42811c5e9b1acec3d60a3b4af01f80821c035d6d7b760d600c549e9377ad70","observation_id":"c5a2b379-5818-42aa-8c9c-30b329a3f76f","resolution":{"observed_at":"2026-08-05T16:12:40.033339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.016598Z","title":"Sparsistency and rates of convergence in large covariance matrix estimation","venue":null,"work_id":"85a18224-05c6-4dcf-b699-95b1717241fc","year":2009},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.579051Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:f47a3daff570315be836e112d833756052bd31015397a7005b5598c662650ea0","observation_id":"52c4885f-2678-4594-9a72-b1d86089c77a","resolution":{"observed_at":"2026-08-05T16:12:40.020496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:40.004737Z","title":"Trevino, Jiliang Tang, and Huan Liu","venue":null,"work_id":"ff11919a-6767-4d75-bd6d-65b664112c3e","year":2017},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.582908Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:89b2e83ddee6e925a20961bbbb0f80c4ffc46bb0168397b1a3678bfc08d04281","observation_id":"a46b653c-b0a0-4ea3-b4e4-bcc3d82982f6","resolution":{"observed_at":"2026-08-05T16:12:40.008682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.992548Z","title":"Feature screening via distance correlation learning","venue":null,"work_id":"9d9a8ffc-9866-4ccc-bf10-0df0d95ee249","year":2012},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.586631Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:571aea990abf9ae3f5741937de8663e1d86a48cae2a523ec44c635a1ce56f970","observation_id":"2b139dd5-2111-4593-85b2-564f16a42571","resolution":{"observed_at":"2026-08-05T16:12:39.996729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.980193Z","title":"Model-free feature screening and fdr control with knockoff features","venue":null,"work_id":"1f1e6c61-a3df-4a74-a90e-33db72bed68b","year":2022},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.590258Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:c20ab1ccc4b8fb7339ea2adb8fdeff2b6c2854b90d1f610de55fa0f9cbcf6858","observation_id":"03f057df-3c99-4ab2-b89c-5ba9024ffe63","resolution":{"observed_at":"2026-08-05T16:12:39.984201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.966487Z","title":"Loh and Martin J","venue":null,"work_id":"641bbb3b-db3e-43f5-a7c7-959a7a2d5363","year":2017},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.594010Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:0d68eabea0d7d6bf34a2a158e42220e251dda58deee44d0a5e202e44dfe23dc6","observation_id":"42e74b18-a679-4ae6-b5c9-75db1a86544c","resolution":{"observed_at":"2026-08-05T16:12:39.971704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.954320Z","title":null,"venue":null,"work_id":"49404a1d-ae07-482f-85cb-000f77b05d9f","year":2018},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.597756Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:314f47828b6768a5c517d58431c24b9ba9c56bb2c83cbd57eba82d9495f9bd77","observation_id":"8651490b-1c9f-4352-8ee2-3be4e4163743","resolution":{"observed_at":"2026-08-05T16:12:39.958197Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.942228Z","title":"The kolmogorov filter for variable screening in high dimensional binary classification","venue":null,"work_id":"364bd622-56df-44a0-a71e-f0a9d630ba36","year":2013},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.601488Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:bcb7a6469e60b16aa515ceb31a310f2b4a4d62bac3566d8cba996dd2938bacbc","observation_id":"c0af18df-3507-422d-8ebe-5cd78323610b","resolution":{"observed_at":"2026-08-05T16:12:39.946293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.930304Z","title":"The fused kolmogorov filter: A nonparametric model-free screening method","venue":null,"work_id":"b73075d7-1b47-46bd-94c4-a1775f7e8852","year":2015},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.605128Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:d576fa1cd8161b3d0dd426a4ed21baddcd7857996e51036784412e296ff1e8b2","observation_id":"eec11150-d6de-4902-a51c-e9a64080d997","resolution":{"observed_at":"2026-08-05T16:12:39.934239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.917981Z","title":"Prediction of treatment response in triple negative breast cancer from whole slide images","venue":null,"work_id":"62d78398-8909-407a-b245-e2a6253f9e17","year":2022},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.609407Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:3e9b0bbce44f669a09ba197b4d60e4f216a56ec497cc9acd2116f9d1b2e7fc19","observation_id":"c3cec37a-fe47-46ba-83f9-37d98df8d1e8","resolution":{"observed_at":"2026-08-05T16:12:39.922145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.906052Z","title":"Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy","venue":null,"work_id":"e125a702-c309-4d48-b2b6-606447891005","year":2005},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.613951Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:156c529287a4c67958f53890103e919756f5f4d70511ad86e47dd8e256b3c1a2","observation_id":"b357fc76-6b8b-4e70-9c52-bd9ea2de6706","resolution":{"observed_at":"2026-08-05T16:12:39.910179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.893937Z","title":"Fermanian","venue":null,"work_id":"f6842742-85e4-481f-8f20-199a341d699c","year":2022},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.617632Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:175fbe9989984e03a61a7a1983d780554f1c0cfa3bc9ede546210de56e367e57","observation_id":"82fa7a83-1284-4a80-8283-d718717cf1b5","resolution":{"observed_at":"2026-08-05T16:12:39.898007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.881246Z","title":"Sparse hilbert-schmidt independence criterion regression","venue":null,"work_id":"c9386186-2408-4985-bf6c-2c1440f22161","year":2020},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.621363Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:dc6adac5383fb0895d0c082df836a1780fef508784310206dc4b59acada387fe","observation_id":"fe8fea47-b76e-4467-a574-ff5f48df69d1","resolution":{"observed_at":"2026-08-05T16:12:39.885238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.869279Z","title":"Feature screening with kernel knockoffs","venue":null,"work_id":"2a8843bb-b1ea-4272-a123-aee23cd40bb3","year":1935},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.625132Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:7dc7265394830cb02774733e48351e7f61a633f51c22545d9fa31b239430662a","observation_id":"5f31dfbb-c267-4cfd-8fbb-3460e4c3dbd6","resolution":{"observed_at":"2026-08-05T16:12:39.873161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.856321Z","title":"Cand\\`es","venue":null,"work_id":"c43b31fb-cfdf-4535-90d5-98fadb11e936","year":2020},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.629029Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:aaf2d166bcb40362e068451b9b6f4185dbb90a23201a10173ae87ee29344ab38","observation_id":"76323ccb-4424-4e35-b5b4-010ff2638f0f","resolution":{"observed_at":"2026-08-05T16:12:39.860538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.844360Z","title":"Serfling","venue":null,"work_id":"64d36ca5-296a-4a40-8abb-a2792509161a","year":1980},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.632758Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:42189490b58c0324947c0aad1d6f0ae0ccba9f668dc97021ca52e51b41795a56","observation_id":"0ab59143-8056-43c5-9c06-db94425b5cea","resolution":{"observed_at":"2026-08-05T16:12:39.848170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.832599Z","title":"Feature selection via dependence maximization","venue":null,"work_id":"c95d98c4-9180-44c5-a2a7-f2de9daccdb3","year":2012},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.636602Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:cf10cd68b6b2db3b5d610956177eab0937f963fab351b3ea1f75d4ffd64073dc","observation_id":"9187b6e2-0cf4-4185-89c2-5bab9356f4c4","resolution":{"observed_at":"2026-08-05T16:12:39.836380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.820727Z","title":"Compositional knockoff filter for high-dimensional regression analysis of microbiome data","venue":null,"work_id":"41d13088-47b7-4327-8616-6799135b9855","year":2021},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.643301Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:e34143e56c0ad5f17580a95a72de1e6016760af4ddd459f31f1667fd6dc96cfd","observation_id":"18bb14f4-edb8-47ce-a276-1714f10cc3c3","resolution":{"observed_at":"2026-08-05T16:12:39.824571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.808996Z","title":"Sz \\'e kely and Maria L","venue":null,"work_id":"9b67456c-0d51-4024-8bfe-ef89a544e40d","year":2009},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.647831Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:7da7318bc808ae9a5c11e0fcf2512dcb7b61908dcbce68c02ed4076b0df75f73","observation_id":"80df7c30-cf7b-48af-bca3-9df5a37486bd","resolution":{"observed_at":"2026-08-05T16:12:39.812671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.797053Z","title":"Sz \\'e kely, Maria L","venue":null,"work_id":"8b86cea3-becb-4970-b906-b974ccfc3fac","year":2007},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.651441Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:1daa312536c72f1ee11eb17050e401670330d9b5882c737babdad054aabe6b0e","observation_id":"4c9b45d4-d3f1-4008-87d9-6a3b53b554b7","resolution":{"observed_at":"2026-08-05T16:12:39.801166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.783891Z","title":null,"venue":null,"work_id":"60f331dd-8401-454e-86b7-c2b47b43b932","year":2022},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.655515Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:59b4aa209db703f151bc8c75b848944ef804beebef423a76f4509c2bebd9252f","observation_id":"a96d3411-5fa0-486f-a209-9b18ffeb7252","resolution":{"observed_at":"2026-08-05T16:12:39.788115Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.770656Z","title":"Regression shrinkage and selection via the lasso","venue":null,"work_id":"1699fc8a-2ec2-4384-942a-9e01736e7d7a","year":1996},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.659046Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:b838933c8d3c1844e9021acc81b9e7d358eede7ff2d381576ef07525f93b5fd6","observation_id":"e74eb2b3-bd5f-49a2-bbee-8ec1c5e4a137","resolution":{"observed_at":"2026-08-05T16:12:39.774618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.754940Z","title":"Xing, and Masashi Sugiyama","venue":null,"work_id":"28ff9fc4-9f8d-4bc4-9572-7fcb651111c9","year":2014},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.662693Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:7646ef74c12d4d4efc7027a791a9594ab090bff32bd90fb9f8761eeb48726d04","observation_id":"c694b7ce-fc2d-40f5-8415-764117fbdda6","resolution":{"observed_at":"2026-08-05T16:12:39.759817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.741254Z","title":null,"venue":null,"work_id":"8eed9ed2-6e63-4447-a69c-b85def3c0943","year":2010},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.666879Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:025ad375dd397836843a49e45258b3100a54131bdc79a7dc6c15924fe9829492","observation_id":"81a87e0f-bc86-43e4-8269-38b760a50be6","resolution":{"observed_at":"2026-08-05T16:12:39.745725Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.728031Z","title":"Projection correlation between two random vectors","venue":null,"work_id":"15da0507-b4f0-453c-bd30-972d4ba192d5","year":2017},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.670502Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:40c4c2e2f701e6fa849c96269d12d9690b6c416917fbb3c3d87fa32a13198db5","observation_id":"4f298dbf-e9ab-4fcf-9322-a6e171e3d86d","resolution":{"observed_at":"2026-08-05T16:12:39.732182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T16:12:39.713558Z","title":"One-step sparse estimates in nonconcave penalized likelihood models","venue":null,"work_id":"a38ca232-2ae8-42a2-9410-366d97aed020","year":2008},"citing_paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-05T16:12:39.674155Z"},"links":{"citing_paper":"/paper/2508.18901"},"observation_digest":"sha256:bc6c066ebe4f3f366f97b98f662ef0bdc2c9a15caddd40d76af03641cdcfe564","observation_id":"e23fc5ab-21cc-419b-b2cb-239ad28e90ed","resolution":{"observed_at":"2026-08-05T16:12:39.719182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.18901","last_updated":"2025-08-26T10:18:23Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T03:37:10.383173Z","submitted_at":"2025-08-26T10:18:23Z","title":"Sparse minimum Redundancy Maximum Relevance for feature selection"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":44},"total_outbound_references":49},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2508.18901."}