{"data":{"full_name":"CyrilJl/OptiMask","name":"OptiMask","description":"Efficiently finding the largest (non-necessarily contiguous) sub-matrix without NaN in Python","stars":1.0,"forks":2.0,"language":"Jupyter Notebook","license":"MIT","archived":0.0,"subcategory":"black-box-optimization","last_pushed_at":"2026-03-20T17:27:05+00:00","pypi_package":null,"npm_package":null,"downloads_monthly":0.0,"dependency_count":0.0,"commits_30d":null,"reverse_dep_count":0.0,"maintenance_score":13.0,"adoption_score":1.0,"maturity_score":9.0,"community_score":13.0,"quality_score":36.0,"quality_tier":"emerging","risk_flags":"['no_package', 'no_dependents']"},"meta":{"timestamp":"2026-04-07T10:31:26.021305+00:00"}}