{"package":"rDecode","ecosystem":"cran","latest_version":"0.1.0","description":"Descent-Based Calibrated Optimal Direct Estimation. Algorithms for solving a self-calibrated l1-regularized quadratic programming problem without parameter tuning. The algorithm, called DECODE, can handle high-dimensional data without cross-validation. It is found useful in high dimensional portfolio selection (see Pun (2018) <https://ssrn.com/abstra","license":"GPL-2","license_risk":"strong_copyleft","commercial_use_notes":"GPL-2.0: derivative works must release source under GPL; static linking forces disclosure.","homepage":"https://cran.r-project.org/package=rDecode","repository":"https://CRAN.R-project.org/package=rDecode","downloads_weekly":51,"health":{"score":39,"risk":"critical","breakdown":{"maintenance":0,"popularity":0,"security":25,"maturity":12,"community":2},"deprecated":false,"max_score":100},"vulnerabilities":{"count":0,"critical":0,"high":0,"medium":0,"low":0,"details":[]},"versions":{"latest":"0.1.0","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2019-12-18 16:32:36","last_published":"2019-12-18T13:20:05+00:00","dependencies_count":1,"dependencies":["stats"]},"bundle":null,"typescript":null,"known_issues":{"bugs_count":0,"bugs_severity":{},"status_breakdown":{},"link":null,"scope":"none"},"historical_compromise":null,"recommendation":{"action":"use_with_caution","issues":["Low health score (39/100)"],"use_version":"0.1.0","version_hint":null,"summary":"rDecode@0.1.0 low health (39/100) — consider alternatives"},"version_scoped":null,"requested_version":null,"_cache":"hit","_response_ms":0,"_powered_by":"depscope.dev — free package intelligence for AI agents","typosquat":{"is_suspected":false},"maintainer_trust":{"available":false},"malicious":{"is_malicious":false},"scorecard":{"available":false},"quality":{"available":false}}