{"package":"optmatch","ecosystem":"cran","latest_version":"0.10.8","description":"Functions for Optimal Matching. Distance based bipartite matching using minimum cost flow, oriented to matching of treatment and control groups in observational studies ('Hansen' and 'Klopfer' 2006 <doi:10.1198/106186006X137047>). Routines are provided to generate distances from generalised linear models (propensity score matching","license":"MIT + file LICENSE","license_risk":"unknown","commercial_use_notes":"verify manually — license not parseable / not declared.","homepage":"http://optmat.ch","repository":"https://github.com/markmfredrickson/optmatch","downloads_weekly":1886,"health":{"score":45,"risk":"high","breakdown":{"maintenance":5,"popularity":6,"security":25,"maturity":6,"community":3},"deprecated":false,"max_score":100},"vulnerabilities":{"count":0,"critical":0,"high":0,"medium":0,"low":0,"details":[]},"versions":{"latest":"0.10.8","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2024-09-19 06:49:00","last_published":"2024-09-19T05:20:02+00:00","dependencies_count":7,"dependencies":["Rcpp","dplyr","stats","tibble","methods","graphics","rlemon"]},"github_stats":{"stars":50,"forks":14,"open_issues":34,"is_archived":false,"pushed_at":"2026-03-05T16:20:54Z","subscribers_count":10},"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.10.8","version_hint":null,"summary":"optmatch@0.10.8 is safe to use (health: 45/100)"},"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}}