{"package":"rclsp","ecosystem":"cran","latest_version":"0.5.0","description":"A Modular Two-Step Convex Optimization Estimator for Ill-Posed Problems. Convex Least Squares Programming (CLSP) is a two-step estimator for solving underdetermined, ill-posed, or structurally constrained least-squares problems. It combines pseudoinverse-based estimation with convex-programming correction methods inspired by Lasso, Ridge, and Elastic Net to ensure numeri","license":"MIT + file LICENSE","license_risk":"unknown","commercial_use_notes":"verify manually — license not parseable / not declared.","homepage":"https://github.com/econcz/rclsp","repository":"https://github.com/econcz/rclsp","downloads_weekly":135,"health":{"score":50,"risk":"high","breakdown":{"maintenance":20,"popularity":3,"security":25,"maturity":0,"community":2},"deprecated":false,"max_score":100},"vulnerabilities":{"count":0,"critical":0,"high":0,"medium":0,"low":0,"details":[]},"versions":{"latest":"0.5.0","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2026-03-09 11:23:27","last_published":"2026-03-09T09:30:02+00:00","dependencies_count":5,"dependencies":["Matrix","stats","methods","CVXR","MASS"]},"github_stats":null,"bundle":null,"typescript":null,"known_issues":{"bugs_count":0,"bugs_severity":{},"status_breakdown":{},"link":null,"scope":"none"},"historical_compromise":null,"recommendation":{"action":"safe_to_use","issues":[],"use_version":"0.5.0","version_hint":null,"summary":"rclsp@0.5.0 is safe to use (health: 50/100)"},"version_scoped":null,"requested_version":null,"_cache":"miss","_response_ms":488,"_powered_by":"depscope.dev — free package intelligence for AI agents","typosquat":{"is_suspected":true,"targets":[{"legitimate_package":"Rcpp","distance":2,"reason":"close_name"}]},"maintainer_trust":{"available":false},"malicious":{"is_malicious":false},"scorecard":{"available":false},"quality":{"available":false}}