{"package":"gpyramid","ecosystem":"cran","latest_version":"0.0.1","description":"Identify Efficient Crossing Schemes for Gene Pyramiding. Calculates the cost of crossing in terms of the number of individuals and generations, which is theoretically formulated by Servin et al. (2004) <DOI:10.1534/genetics.103.023358>. This package has been designed for selecting appropriate parental genotypes and find the most efficient crossing scheme ","license":"GPL-2 | GPL-3","license_risk":"unknown","commercial_use_notes":"verify manually — license not parseable / not declared.","homepage":"https://cran.r-project.org/package=gpyramid","repository":"https://CRAN.R-project.org/package=gpyramid","downloads_weekly":53,"health":{"score":42,"risk":"high","breakdown":{"maintenance":15,"popularity":0,"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.0.1","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2025-12-12 21:47:16","last_published":"2025-12-12T20:10:02+00:00","dependencies_count":3,"dependencies":["utils","dplyr","ape"]},"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.0.1","version_hint":null,"summary":"gpyramid@0.0.1 is safe to use (health: 42/100)"},"version_scoped":null,"requested_version":null,"_cache":"miss","_response_ms":353,"_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}}