{"package":"pcst_fast","ecosystem":"pypi","latest_version":"1.0.10","description":"A fast implementation of the Goemans-Williamson scheme for the prize-collecting Steiner tree / forest problem.","license":"GNU General Public License","license_risk":"unknown","commercial_use_notes":"verify manually — license not parseable / not declared.","homepage":"https://github.com/fraenkel-lab/pcst_fast","repository":"https://github.com/fraenkel-lab/pcst_fast","downloads_weekly":1528,"health":{"score":37,"risk":"critical","breakdown":{"maintenance":0,"popularity":6,"security":25,"maturity":3,"community":3},"deprecated":false,"max_score":100},"vulnerabilities":{"count":0,"critical":0,"high":0,"medium":0,"low":0,"details":[]},"versions":{"latest":"1.0.10","total_count":3,"recent":["1.0.6","1.0.7","1.0.10"]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":null,"last_published":"2024-01-29T22:13:28.457344Z","dependencies_count":1,"dependencies":["pybind11 >=2.1.0"]},"github_stats":{"stars":68,"forks":21,"open_issues":8,"is_archived":false,"pushed_at":"2024-10-17T15:57:12Z","subscribers_count":5},"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 (37/100)"],"use_version":"1.0.10","version_hint":null,"summary":"pcst_fast@1.0.10 low health (37/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},"version_history_summary":{"total_versions":3,"first_release_age_days":null,"last_release_days_ago":820,"avg_days_between_releases":null,"release_velocity":"stale"}}