Public report of BioSystemsUM/DeepMol, published 17 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 17 November 2026, 00:17 UTC · Survey ID cd_f1a12c36824343afaedd0732f6077397
BioSystemsUM/DeepMol
Measured 17 November 2026, 00:15 UTC, at code version 6aeeb40
Bus factor is not measured: No living knowledge left to concentrate.
CAI scoreAt risk
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 24,150 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Production Readiness, 45.8
Findings by how serious they are
33 critical215 serious114 minor
14 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 00:15 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
42of 42 dimensions measured by tools.
338of 362 findings point to an exact file and line, so you can open each one in the code. The other 24 concern the repository as a whole, such as missing documentation.
42dimensions across 6 lenses, read from 24,150 lines of product code in 1 project.
BioSystemsUM/DeepMol is rated At risk because critical security findings are open. Its score is held back because we found no automated security scanning of the code, its secrets or its dependencies. It scores 55.9 out of 100, which the At risk rating leaves unchanged.
Production Readiness, at 45.8, is the weakest lens and counts most in the score. The best first step is adding automated security scanning, worth about 6.3 points. Having someone learn and document the 80 files no active contributor knows comes next, worth about 4.5 points. Raising Production Readiness to 70 would lift the score to about 62.9.
Sixteen places in the code run text as code, which an attacker could use. Six pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Replacing text run as code with direct calls and pinning each tool to an exact version would close both risks. Updating the vulnerable packages would fix the five packages with a known security hole, and the three unsafe settings in infrastructure or container files need changing to safe values.
The product code is 24,150 lines, about €30,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Production Readiness rose from 45.8 to 70, the lowest score rated Strong, the score would rise from 55.9 to about 62.9.
Code composition: what the lines of code are
Product code 80%Tests 20%
Rebuild cost: about €30,000 · Estimate
Cost to rebuild
€10,000 to €51,000, for 168 to 534 hours of work, about 0.2 person-years for one engineer
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.8 at a score of 56. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 24,150 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €30,000 to build again, about 0.2 person-years of work. Its weakest lens is Production Readiness, at 45.8 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing. Of all the actions in this report, it raises the score most for the work it takes: about 6.3 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.8 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 3% to 6% on every change. The history of the code shows how much it changes: about 88 lines over the last 90 days, which is about 357 lines a year. At that pace, the extra work comes to an estimated 0 to 0.2 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
95 modules, with 116 dependencies between them. Every module uses only modules listed above it, so there are no loops.
The table shows the 40 modules with the most connections; 55 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
base.estimator uses datasets.datasets, so a change to datasets.datasets can break base.estimator, while a change to base.estimator can't break datasets.datasets.
Position
Below the diagonal: base.estimator uses a module listed above it, which is the healthy direction.
base.predictor uses datasets.datasets, so a change to datasets.datasets can break base.predictor, while a change to base.predictor can't break datasets.datasets.
Position
Below the diagonal: base.predictor uses a module listed above it, which is the healthy direction.
parameter_optimization.base_hyperparameter_optimization uses datasets.datasets, so a change to datasets.datasets can break parameter_optimization.base_hyperparameter_optimization, while a change to parameter_optimization.base_hyperparameter_optimization can't break datasets.datasets.
Position
Below the diagonal: parameter_optimization.base_hyperparameter_optimization uses a module listed above it, which is the healthy direction.
parameter_optimization.base_hyperparameter_optimization uses metrics.metrics, so a change to metrics.metrics can break parameter_optimization.base_hyperparameter_optimization, while a change to parameter_optimization.base_hyperparameter_optimization can't break metrics.metrics.
Position
Below the diagonal: parameter_optimization.base_hyperparameter_optimization uses a module listed above it, which is the healthy direction.
splitters.splitters uses datasets.datasets, so a change to datasets.datasets can break splitters.splitters, while a change to splitters.splitters can't break datasets.datasets.
Position
Below the diagonal: splitters.splitters uses a module listed above it, which is the healthy direction.
base.transformer uses datasets.datasets, so a change to datasets.datasets can break base.transformer, while a change to base.transformer can't break datasets.datasets.
Position
Below the diagonal: base.transformer uses a module listed above it, which is the healthy direction.
base.transformer uses base.estimator, so a change to base.estimator can break base.transformer, while a change to base.transformer can't break base.estimator.
Position
Below the diagonal: base.transformer uses a module listed above it, which is the healthy direction.
models.deepchem_models uses datasets.datasets, so a change to datasets.datasets can break models.deepchem_models, while a change to models.deepchem_models can't break datasets.datasets.
Position
Below the diagonal: models.deepchem_models uses a module listed above it, which is the healthy direction.
models.deepchem_models uses metrics.metrics, so a change to metrics.metrics can break models.deepchem_models, while a change to models.deepchem_models can't break metrics.metrics.
Position
Below the diagonal: models.deepchem_models uses a module listed above it, which is the healthy direction.
models.deepchem_models uses base.predictor, so a change to base.predictor can break models.deepchem_models, while a change to models.deepchem_models can't break base.predictor.
Position
Below the diagonal: models.deepchem_models uses a module listed above it, which is the healthy direction.
models.deepchem_models uses splitters.splitters, so a change to splitters.splitters can break models.deepchem_models, while a change to models.deepchem_models can't break splitters.splitters.
Position
Below the diagonal: models.deepchem_models uses a module listed above it, which is the healthy direction.
models.ensembles uses datasets.datasets, so a change to datasets.datasets can break models.ensembles, while a change to models.ensembles can't break datasets.datasets.
Position
Below the diagonal: models.ensembles uses a module listed above it, which is the healthy direction.
models.ensembles uses base.predictor, so a change to base.predictor can break models.ensembles, while a change to models.ensembles can't break base.predictor.
Position
Below the diagonal: models.ensembles uses a module listed above it, which is the healthy direction.
models.models uses datasets.datasets, so a change to datasets.datasets can break models.models, while a change to models.models can't break datasets.datasets.
Position
Below the diagonal: models.models uses a module listed above it, which is the healthy direction.
parameter_optimization.deepchem_hyperparameter_optimization uses datasets.datasets, so a change to datasets.datasets can break parameter_optimization.deepchem_hyperparameter_optimization, while a change to parameter_optimization.deepchem_hyperparameter_optimization can't break datasets.datasets.
Position
Below the diagonal: parameter_optimization.deepchem_hyperparameter_optimization uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in parameter_optimization.deepchem_hyperparameter_optimization uses a type in parameter_optimization.base_hyperparameter_optimization.
parameter_optimization.deepchem_hyperparameter_optimization uses parameter_optimization.base_hyperparameter_optimization, so a change to parameter_optimization.base_hyperparameter_optimization can break parameter_optimization.deepchem_hyperparameter_optimization, while a change to parameter_optimization.deepchem_hyperparameter_optimization can't break parameter_optimization.base_hyperparameter_optimization.
Position
Below the diagonal: parameter_optimization.deepchem_hyperparameter_optimization uses a module listed above it, which is the healthy direction.
parameter_optimization.hyperparameter_optimization uses datasets.datasets, so a change to datasets.datasets can break parameter_optimization.hyperparameter_optimization, while a change to parameter_optimization.hyperparameter_optimization can't break datasets.datasets.
Position
Below the diagonal: parameter_optimization.hyperparameter_optimization uses a module listed above it, which is the healthy direction.
parameter_optimization.hyperparameter_optimization uses metrics.metrics, so a change to metrics.metrics can break parameter_optimization.hyperparameter_optimization, while a change to parameter_optimization.hyperparameter_optimization can't break metrics.metrics.
Position
Below the diagonal: parameter_optimization.hyperparameter_optimization uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in parameter_optimization.hyperparameter_optimization uses a type in parameter_optimization.base_hyperparameter_optimization.
parameter_optimization.hyperparameter_optimization uses parameter_optimization.base_hyperparameter_optimization, so a change to parameter_optimization.base_hyperparameter_optimization can break parameter_optimization.hyperparameter_optimization, while a change to parameter_optimization.hyperparameter_optimization can't break parameter_optimization.base_hyperparameter_optimization.
Position
Below the diagonal: parameter_optimization.hyperparameter_optimization uses a module listed above it, which is the healthy direction.
splitters.graph_part_similarity_split uses datasets.datasets, so a change to datasets.datasets can break splitters.graph_part_similarity_split, while a change to splitters.graph_part_similarity_split can't break datasets.datasets.
Position
Below the diagonal: splitters.graph_part_similarity_split uses a module listed above it, which is the healthy direction.
splitters.graph_part_similarity_split uses splitters.splitters, so a change to splitters.splitters can break splitters.graph_part_similarity_split, while a change to splitters.graph_part_similarity_split can't break splitters.splitters.
Position
Below the diagonal: splitters.graph_part_similarity_split uses a module listed above it, which is the healthy direction.
splitters.multitask_splitter uses datasets.datasets, so a change to datasets.datasets can break splitters.multitask_splitter, while a change to splitters.multitask_splitter can't break datasets.datasets.
Position
Below the diagonal: splitters.multitask_splitter uses a module listed above it, which is the healthy direction.
splitters.multitask_splitter uses splitters.splitters, so a change to splitters.splitters can break splitters.multitask_splitter, while a change to splitters.multitask_splitter can't break splitters.splitters.
Position
Below the diagonal: splitters.multitask_splitter uses a module listed above it, which is the healthy direction.
tokenizers.tokenizer uses datasets.datasets, so a change to datasets.datasets can break tokenizers.tokenizer, while a change to tokenizers.tokenizer can't break datasets.datasets.
Position
Below the diagonal: tokenizers.tokenizer uses a module listed above it, which is the healthy direction.
tokenizers.tokenizer uses base.estimator, so a change to base.estimator can break tokenizers.tokenizer, while a change to tokenizers.tokenizer can't break base.estimator.
Position
Below the diagonal: tokenizers.tokenizer uses a module listed above it, which is the healthy direction.
compound_featurization.base_featurizer uses datasets.datasets, so a change to datasets.datasets can break compound_featurization.base_featurizer, while a change to compound_featurization.base_featurizer can't break datasets.datasets.
Position
Below the diagonal: compound_featurization.base_featurizer uses a module listed above it, which is the healthy direction.
compound_featurization.base_featurizer uses base.transformer, so a change to base.transformer can break compound_featurization.base_featurizer, while a change to compound_featurization.base_featurizer can't break base.transformer.
Position
Below the diagonal: compound_featurization.base_featurizer uses a module listed above it, which is the healthy direction.
compound_featurization.one_hot_encoder uses datasets.datasets, so a change to datasets.datasets can break compound_featurization.one_hot_encoder, while a change to compound_featurization.one_hot_encoder can't break datasets.datasets.
Position
Below the diagonal: compound_featurization.one_hot_encoder uses a module listed above it, which is the healthy direction.
compound_featurization.one_hot_encoder uses base.transformer, so a change to base.transformer can break compound_featurization.one_hot_encoder, while a change to compound_featurization.one_hot_encoder can't break base.transformer.
Position
Below the diagonal: compound_featurization.one_hot_encoder uses a module listed above it, which is the healthy direction.
compound_featurization.one_hot_encoder uses tokenizers.tokenizer, so a change to tokenizers.tokenizer can break compound_featurization.one_hot_encoder, while a change to compound_featurization.one_hot_encoder can't break tokenizers.tokenizer.
Position
Below the diagonal: compound_featurization.one_hot_encoder uses a module listed above it, which is the healthy direction.
compound_featurization.similarity_matrix uses datasets.datasets, so a change to datasets.datasets can break compound_featurization.similarity_matrix, while a change to compound_featurization.similarity_matrix can't break datasets.datasets.
Position
Below the diagonal: compound_featurization.similarity_matrix uses a module listed above it, which is the healthy direction.
compound_featurization.similarity_matrix uses base.transformer, so a change to base.transformer can break compound_featurization.similarity_matrix, while a change to compound_featurization.similarity_matrix can't break base.transformer.
Position
Below the diagonal: compound_featurization.similarity_matrix uses a module listed above it, which is the healthy direction.
encoders.label_encoder uses datasets.datasets, so a change to datasets.datasets can break encoders.label_encoder, while a change to encoders.label_encoder can't break datasets.datasets.
Position
Below the diagonal: encoders.label_encoder uses a module listed above it, which is the healthy direction.
encoders.label_encoder uses base.transformer, so a change to base.transformer can break encoders.label_encoder, while a change to encoders.label_encoder can't break base.transformer.
Position
Below the diagonal: encoders.label_encoder uses a module listed above it, which is the healthy direction.
encoders.label_one_hot_encoder uses datasets.datasets, so a change to datasets.datasets can break encoders.label_one_hot_encoder, while a change to encoders.label_one_hot_encoder can't break datasets.datasets.
Position
Below the diagonal: encoders.label_one_hot_encoder uses a module listed above it, which is the healthy direction.
encoders.label_one_hot_encoder uses base.transformer, so a change to base.transformer can break encoders.label_one_hot_encoder, while a change to encoders.label_one_hot_encoder can't break base.transformer.
Position
Below the diagonal: encoders.label_one_hot_encoder uses a module listed above it, which is the healthy direction.
feature_importance.shap_values uses datasets.datasets, so a change to datasets.datasets can break feature_importance.shap_values, while a change to feature_importance.shap_values can't break datasets.datasets.
Position
Below the diagonal: feature_importance.shap_values uses a module listed above it, which is the healthy direction.
feature_importance.shap_values uses models.models, so a change to models.models can break feature_importance.shap_values, while a change to feature_importance.shap_values can't break models.models.
Position
Below the diagonal: feature_importance.shap_values uses a module listed above it, which is the healthy direction.
feature_selection.base_feature_selector uses datasets.datasets, so a change to datasets.datasets can break feature_selection.base_feature_selector, while a change to feature_selection.base_feature_selector can't break datasets.datasets.
Position
Below the diagonal: feature_selection.base_feature_selector uses a module listed above it, which is the healthy direction.
feature_selection.base_feature_selector uses base.transformer, so a change to base.transformer can break feature_selection.base_feature_selector, while a change to feature_selection.base_feature_selector can't break base.transformer.
Position
Below the diagonal: feature_selection.base_feature_selector uses a module listed above it, which is the healthy direction.
models.atmol.atmol uses datasets.datasets, so a change to datasets.datasets can break models.atmol.atmol, while a change to models.atmol.atmol can't break datasets.datasets.
Position
Below the diagonal: models.atmol.atmol uses a module listed above it, which is the healthy direction.
models.atmol.atmol uses models.models, so a change to models.models can break models.atmol.atmol, while a change to models.atmol.atmol can't break models.models.
Position
Below the diagonal: models.atmol.atmol uses a module listed above it, which is the healthy direction.
models.keras_models uses datasets.datasets, so a change to datasets.datasets can break models.keras_models, while a change to models.keras_models can't break datasets.datasets.
Position
Below the diagonal: models.keras_models uses a module listed above it, which is the healthy direction.
models.keras_models uses metrics.metrics, so a change to metrics.metrics can break models.keras_models, while a change to models.keras_models can't break metrics.metrics.
Position
Below the diagonal: models.keras_models uses a module listed above it, which is the healthy direction.
models.keras_models uses splitters.splitters, so a change to splitters.splitters can break models.keras_models, while a change to models.keras_models can't break splitters.splitters.
Position
Below the diagonal: models.keras_models uses a module listed above it, which is the healthy direction.
models.keras_models uses models.models, so a change to models.models can break models.keras_models, while a change to models.keras_models can't break models.models.
Position
Below the diagonal: models.keras_models uses a module listed above it, which is the healthy direction.
models.sklearn_models uses datasets.datasets, so a change to datasets.datasets can break models.sklearn_models, while a change to models.sklearn_models can't break datasets.datasets.
Position
Below the diagonal: models.sklearn_models uses a module listed above it, which is the healthy direction.
models.sklearn_models uses metrics.metrics, so a change to metrics.metrics can break models.sklearn_models, while a change to models.sklearn_models can't break metrics.metrics.
Position
Below the diagonal: models.sklearn_models uses a module listed above it, which is the healthy direction.
models.sklearn_models uses splitters.splitters, so a change to splitters.splitters can break models.sklearn_models, while a change to models.sklearn_models can't break splitters.splitters.
Position
Below the diagonal: models.sklearn_models uses a module listed above it, which is the healthy direction.
models.sklearn_models uses models.models, so a change to models.models can break models.sklearn_models, while a change to models.sklearn_models can't break models.models.
Position
Below the diagonal: models.sklearn_models uses a module listed above it, which is the healthy direction.
models.transformer_models uses datasets.datasets, so a change to datasets.datasets can break models.transformer_models, while a change to models.transformer_models can't break datasets.datasets.
Position
Below the diagonal: models.transformer_models uses a module listed above it, which is the healthy direction.
models.transformer_models uses models.models, so a change to models.models can break models.transformer_models, while a change to models.transformer_models can't break models.models.
Position
Below the diagonal: models.transformer_models uses a module listed above it, which is the healthy direction.
pipeline.pipeline uses datasets.datasets, so a change to datasets.datasets can break pipeline.pipeline, while a change to pipeline.pipeline can't break datasets.datasets.
Position
Below the diagonal: pipeline.pipeline uses a module listed above it, which is the healthy direction.
pipeline.pipeline uses parameter_optimization.base_hyperparameter_optimization, so a change to parameter_optimization.base_hyperparameter_optimization can break pipeline.pipeline, while a change to pipeline.pipeline can't break parameter_optimization.base_hyperparameter_optimization.
Position
Below the diagonal: pipeline.pipeline uses a module listed above it, which is the healthy direction.
pipeline.pipeline uses base.transformer, so a change to base.transformer can break pipeline.pipeline, while a change to pipeline.pipeline can't break base.transformer.
Position
Below the diagonal: pipeline.pipeline uses a module listed above it, which is the healthy direction.
scalers.base_scaler uses datasets.datasets, so a change to datasets.datasets can break scalers.base_scaler, while a change to scalers.base_scaler can't break datasets.datasets.
Position
Below the diagonal: scalers.base_scaler uses a module listed above it, which is the healthy direction.
scalers.base_scaler uses base.transformer, so a change to base.transformer can break scalers.base_scaler, while a change to scalers.base_scaler can't break base.transformer.
Position
Below the diagonal: scalers.base_scaler uses a module listed above it, which is the healthy direction.
standardizer.molecular_standardizer uses datasets.datasets, so a change to datasets.datasets can break standardizer.molecular_standardizer, while a change to standardizer.molecular_standardizer can't break datasets.datasets.
Position
Below the diagonal: standardizer.molecular_standardizer uses a module listed above it, which is the healthy direction.
standardizer.molecular_standardizer uses base.transformer, so a change to base.transformer can break standardizer.molecular_standardizer, while a change to standardizer.molecular_standardizer can't break base.transformer.
Position
Below the diagonal: standardizer.molecular_standardizer uses a module listed above it, which is the healthy direction.
tokenizers.atom_level_smiles_tokenizer uses datasets.datasets, so a change to datasets.datasets can break tokenizers.atom_level_smiles_tokenizer, while a change to tokenizers.atom_level_smiles_tokenizer can't break datasets.datasets.
Position
Below the diagonal: tokenizers.atom_level_smiles_tokenizer uses a module listed above it, which is the healthy direction.
tokenizers.atom_level_smiles_tokenizer uses tokenizers.tokenizer, so a change to tokenizers.tokenizer can break tokenizers.atom_level_smiles_tokenizer, while a change to tokenizers.atom_level_smiles_tokenizer can't break tokenizers.tokenizer.
Position
Below the diagonal: tokenizers.atom_level_smiles_tokenizer uses a module listed above it, which is the healthy direction.
tokenizers.np_bert_tokenizer uses datasets.datasets, so a change to datasets.datasets can break tokenizers.np_bert_tokenizer, while a change to tokenizers.np_bert_tokenizer can't break datasets.datasets.
Position
Below the diagonal: tokenizers.np_bert_tokenizer uses a module listed above it, which is the healthy direction.
tokenizers.np_bert_tokenizer uses tokenizers.tokenizer, so a change to tokenizers.tokenizer can break tokenizers.np_bert_tokenizer, while a change to tokenizers.np_bert_tokenizer can't break tokenizers.tokenizer.
Position
Below the diagonal: tokenizers.np_bert_tokenizer uses a module listed above it, which is the healthy direction.
unsupervised.base_unsupervised uses datasets.datasets, so a change to datasets.datasets can break unsupervised.base_unsupervised, while a change to unsupervised.base_unsupervised can't break datasets.datasets.
Position
Below the diagonal: unsupervised.base_unsupervised uses a module listed above it, which is the healthy direction.
unsupervised.base_unsupervised uses base.transformer, so a change to base.transformer can break unsupervised.base_unsupervised, while a change to unsupervised.base_unsupervised can't break base.transformer.
Position
Below the diagonal: unsupervised.base_unsupervised uses a module listed above it, which is the healthy direction.
compound_featurization.deepchem_featurizers uses datasets.datasets, so a change to datasets.datasets can break compound_featurization.deepchem_featurizers, while a change to compound_featurization.deepchem_featurizers can't break datasets.datasets.
Position
Below the diagonal: compound_featurization.deepchem_featurizers uses a module listed above it, which is the healthy direction.
compound_featurization.deepchem_featurizers uses base.transformer, so a change to base.transformer can break compound_featurization.deepchem_featurizers, while a change to compound_featurization.deepchem_featurizers can't break base.transformer.
Position
Below the diagonal: compound_featurization.deepchem_featurizers uses a module listed above it, which is the healthy direction.
compound_featurization.deepchem_featurizers uses compound_featurization.base_featurizer, so a change to compound_featurization.base_featurizer can break compound_featurization.deepchem_featurizers, while a change to compound_featurization.deepchem_featurizers can't break compound_featurization.base_featurizer.
Position
Below the diagonal: compound_featurization.deepchem_featurizers uses a module listed above it, which is the healthy direction.
compound_featurization.llms uses datasets.datasets, so a change to datasets.datasets can break compound_featurization.llms, while a change to compound_featurization.llms can't break datasets.datasets.
Position
Below the diagonal: compound_featurization.llms uses a module listed above it, which is the healthy direction.
compound_featurization.llms uses compound_featurization.base_featurizer, so a change to compound_featurization.base_featurizer can break compound_featurization.llms, while a change to compound_featurization.llms can't break compound_featurization.base_featurizer.
Position
Below the diagonal: compound_featurization.llms uses a module listed above it, which is the healthy direction.
compound_featurization.nc_mfp_generator uses datasets.datasets, so a change to datasets.datasets can break compound_featurization.nc_mfp_generator, while a change to compound_featurization.nc_mfp_generator can't break datasets.datasets.
Position
Below the diagonal: compound_featurization.nc_mfp_generator uses a module listed above it, which is the healthy direction.
compound_featurization.nc_mfp_generator uses compound_featurization.base_featurizer, so a change to compound_featurization.base_featurizer can break compound_featurization.nc_mfp_generator, while a change to compound_featurization.nc_mfp_generator can't break compound_featurization.base_featurizer.
Position
Below the diagonal: compound_featurization.nc_mfp_generator uses a module listed above it, which is the healthy direction.
compound_featurization.rdkit_descriptors uses datasets.datasets, so a change to datasets.datasets can break compound_featurization.rdkit_descriptors, while a change to compound_featurization.rdkit_descriptors can't break datasets.datasets.
Position
Below the diagonal: compound_featurization.rdkit_descriptors uses a module listed above it, which is the healthy direction.
compound_featurization.rdkit_descriptors uses compound_featurization.base_featurizer, so a change to compound_featurization.base_featurizer can break compound_featurization.rdkit_descriptors, while a change to compound_featurization.rdkit_descriptors can't break compound_featurization.base_featurizer.
Position
Below the diagonal: compound_featurization.rdkit_descriptors uses a module listed above it, which is the healthy direction.
models uses models.deepchem_models, so a change to models.deepchem_models can break models, while a change to models can't break models.deepchem_models.
Position
Below the diagonal: models uses a module listed above it, which is the healthy direction.
pipeline_optimization uses datasets.datasets, so a change to datasets.datasets can break pipeline_optimization, while a change to pipeline_optimization can't break datasets.datasets.
Position
Below the diagonal: pipeline_optimization uses a module listed above it, which is the healthy direction.
pipeline_optimization uses base.predictor, so a change to base.predictor can break pipeline_optimization, while a change to pipeline_optimization can't break base.predictor.
Position
Below the diagonal: pipeline_optimization uses a module listed above it, which is the healthy direction.
pipeline_optimization uses base.transformer, so a change to base.transformer can break pipeline_optimization, while a change to pipeline_optimization can't break base.transformer.
Position
Below the diagonal: pipeline_optimization uses a module listed above it, which is the healthy direction.
pipeline_optimization uses models.keras_models, so a change to models.keras_models can break pipeline_optimization, while a change to pipeline_optimization can't break models.keras_models.
Position
Below the diagonal: pipeline_optimization uses a module listed above it, which is the healthy direction.
tokenizers.kmer_smiles_tokenizer uses datasets.datasets, so a change to datasets.datasets can break tokenizers.kmer_smiles_tokenizer, while a change to tokenizers.kmer_smiles_tokenizer can't break datasets.datasets.
Position
Below the diagonal: tokenizers.kmer_smiles_tokenizer uses a module listed above it, which is the healthy direction.
tokenizers.kmer_smiles_tokenizer uses tokenizers.tokenizer, so a change to tokenizers.tokenizer can break tokenizers.kmer_smiles_tokenizer, while a change to tokenizers.kmer_smiles_tokenizer can't break tokenizers.tokenizer.
Position
Below the diagonal: tokenizers.kmer_smiles_tokenizer uses a module listed above it, which is the healthy direction.
tokenizers.kmer_smiles_tokenizer uses tokenizers.atom_level_smiles_tokenizer, so a change to tokenizers.atom_level_smiles_tokenizer can break tokenizers.kmer_smiles_tokenizer, while a change to tokenizers.kmer_smiles_tokenizer can't break tokenizers.atom_level_smiles_tokenizer.
Position
Below the diagonal: tokenizers.kmer_smiles_tokenizer uses a module listed above it, which is the healthy direction.
compound_featurization uses datasets.datasets, so a change to datasets.datasets can break compound_featurization, while a change to compound_featurization can't break datasets.datasets.
Position
Below the diagonal: compound_featurization uses a module listed above it, which is the healthy direction.
compound_featurization uses compound_featurization.rdkit_descriptors, so a change to compound_featurization.rdkit_descriptors can break compound_featurization, while a change to compound_featurization can't break compound_featurization.rdkit_descriptors.
Position
Below the diagonal: compound_featurization uses a module listed above it, which is the healthy direction.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
49
High / Critical
A03:2025 — Software Supply Chain Failures
16
High / Critical
A02:2025 — Security Misconfiguration
5
High / Critical
Roadmap
Top priorities: Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing; Resolve the 80 Orphaned file finding(s) in Knowledge Freshness — start with REDACTED (7), REDACTED (2), REDACTED; Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 33
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 215
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 114
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 14
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 42 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 42 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 338 of 362 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the Python half could not be measured — the pytest suite could not be run in the analyzer image (its dependency install could not be served by 172.31.7.1 (pip: No matching distribution found for tensorflow==2.15.0), so its suite was not run against dependencies it does not declare). Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo — a coverage step in CI (pytest, with `--cov` in pyproject.toml) shows coverage is measured in your own CI.
D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.py) and this repository declares a Python test suite (repository root, 70 test files), but it was not re-run: its dependency install could not be served by 172.31.7.1 (pip: No matching distribution found for tensorflow==2.15.0), so its suite was not run against dependencies it does not declare. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. All 83 significant source file(s) were last meaningfully changed so long ago that no living knowledge remains — nothing since has been substantial enough to re-establish ownership (a broad, mechanical sweep that touches many files shallowly does not count, and neither does no activity at all). There is no concentration to measure, so the bus factor is not scored. This is not a clean bill: nobody currently holds working knowledge of this code (see D34 Knowledge Freshness). Counted over 83 of the 133 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: it declares a published package (pyproject.toml), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict.
D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D26 Project Cohesion — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `(repository root)` (24150 LoC, 203 module-visible types across 26 directories) is over its size bounds, and whether one unit is a coherent whole or a grab-bag is read from its type references: the parts of it that reach the rest only through its shared core. Those are read over the C#/VB code model, which this unit's source did not supply. Its size alone is no verdict on its cohesion, so none is published.
C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Java was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby, Scala and Rust source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby, Scala or Rust was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala, Kotlin and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala, Kotlin or Rust was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala, PHP and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala, PHP or Rust was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript (Vue and Svelte components included), Java, Rust, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, Kotlin source, and Rust source only, and no C# was loaded, no TypeScript was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned REDACTED, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
DM6 Domain ↔ infrastructure boundary: Infrastructure reached through a hand-rolled wrapper, a domain-named facade, reflection, or a string-keyed service locator resolves to a non-infra type and isn't seen; the body scan is symbol resolution over syntax, not full dataflow. A clean result means "no resolved infra reference in a domain body", not a proof of purity.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 9 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with _utils.preset_deepchem_models (cyclomatic 39), _utils.get_prediction_from_proba (cyclomatic 32), SmilesDataset._validate_params (cyclomatic 26). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 9 together lifts Cyclomatic Complexity from 8.3 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 33 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 60 down to 60 or less in Cognitive Complexity — start with _utils.get_prediction_from_proba (cognitive 95). — Refactoring it lifts Cognitive Complexity from 5.1 to about 5.8/10.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.6 / 10Stronggated by 2 serious findings✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
2 over-large unit(s) detected — types, modules or files that carry too much.
FileTooLong: REDACTED · ×2REDACTED
What to do
Resolve the 2 FileTooLong finding(s) in God Classes — start with REDACTED, sklearn_model_builders.py. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D4 · Code Duplication4.5 / 10Weak✓ Tool-verified
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
64 duplicated block group(s) detected. 13.8 % of the production lines (3,324 of 24,150) are in a reported copy. A further 40 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.
Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3src/deepmol/compound_featurization/nc_mfp/Fingerprint_representation_step.py:28
+ 67 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 5 Duplicated block (19 lines × 2) finding(s) in Code Duplication — start with REDACTED (2), evaluator.py, atom_level_smiles_tokenizer.py. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 Duplicated block (22 lines × 2) finding(s) in Code Duplication — start with base_featurizer.py, shap_values.py, REDACTED. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 4 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with REDACTED (2), splitters.py, np_bert_tokenizer.py. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with sklearn_models.py, models.py. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
15 outdated, 0 yanked pinned Python distributions. 21 of 37 shipped distributions were graded against pypi.org (0 not published there, 16 declared without an exact pin, which installs the newest release the declaration admits and so cannot be behind one). Only EXACT pins are graded for currency: a floor or a range already installs the newest release it admits, so reporting one would report this repository for being current. Whether a deliberate upper cap has itself gone stale is a different and weaker question, and is not asked. Whether any distribution is UNMAINTAINED is not graded — PyPI publishes no maintenance status, and release age does not stand in for one. Lockfiles are not read (poetry.lock, uv.lock, Pipfile.lock, pdm.lock), so a lock-resolved install is outside this verdict. Known CVEs in this dependency graph are D30's question.
Outdated: cached-property · ×15
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 178 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 37 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (141 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version. 28 of them publish no licence on PyPI this pass can read; that is missing data, not a violation, and none of them is charged. This repository publishes itself under BSD 2-Clause License, which is its own choice and is not judged here.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
20 deducted task-comment markers across 24150 LoC (0.1/KLoC) → score 9.8. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
TodoComment · ×20REDACTED:172
What to do
Resolve the 20 TodoComment finding(s) in Explicit Debt — start with REDACTED (9), REDACTED (3), REDACTED (2). — One of this dimension's main actionable groups (20 warning-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
77 % of calls cross a namespace and 0 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
49 finding(s): 0 critical, 25 high, 24 medium, 0 low. 6 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 16 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (12), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (16 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
No action in Static Analysis (SAST) — all 6 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (6 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
Resolve the 2 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 2 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 3 High IaC finding(s) in IaC & Container Security — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Resolve the 2 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
83 of 83 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/deepmol/models/sklearn_model_builders.py. Counted over 83 of the 133 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Orphaned file · ×80REDACTED:1
Most significant orphaned file · ×3src/deepmol/models/sklearn_model_builders.py:1
Dormant codebase
What to do
Resolve the 80 Orphaned file finding(s) in Knowledge Freshness — start with REDACTED (7), REDACTED (2), REDACTED. — One of this dimension's main actionable groups (80 recommendation-level).
Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with sklearn_model_builders.py, REDACTED, datasets.py. — One of this dimension's main actionable groups (3 recommendation-level).
Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 0 platform declaration(s) and 37 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
`Dataset` declares 17 abstract methods: `smiles`, `mols`, `removed_elements`, `X`, `y`, `ids`, `feature_names`, `label_names`, `n_tasks`, `mode`, `get_shape`, `remove_nan`, `remove_elements`, `select_features_by_index`, `select_features_by_name`, `select`, `select_to_split`. Counted over its `@abstractmethod`s (and abstract properties), once per name; concrete methods are helpers an implementer inherits, not a burden, and `_`-prefixed members are not counted. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/deepmol/datasets/datasets.py:18
What to do
Split fat interfaces into focused role-interfaces so clients depend only on what they use.
Other · Domain Modelling — Whether the domain layer stays free of infrastructure dependencies — a domain aggregate fused to a persistence ORM (Django/SQLAlchemy) on its own declaration (active-record) couples the domain to infrastructure. The clean-architecture dependency rule.
Method: Roslyn (DDD-gated): domain-layer types scanned for infrastructure usage in member SIGNATURES and inside method/accessor BODIES — resolved calls and object-creations into EF/Marten/HTTP/Mongo/Redis/message-bus types (not just a namespace allowlist). Deterministic, symbol-resolved, exhaustive over domain-layer bodies, DDD-native.
Coverage: Domain layer identified by NAMESPACE heuristic; infrastructure then resolved by symbol in member SIGNATURES and method/accessor BODIES — rename the layer and the check evaporates.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:4
`REDACTED` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — REDACTED:1
What to do
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release. — REDACTED:15
What to do
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — REDACTED:91
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×3) — src/deepmol/tokenizers/__init__.py:4, src/deepmol/compound_featurization/base_featurizer.py:107, src/deepmol/compound_featurization/llms.py:73
`except` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×3) — src/deepmol/tokenizers/np_bert_tokenizer.py:39, src/deepmol/compound_featurization/rdkit_descriptors.py:66, src/deepmol/compound_featurization/rdkit_descriptors.py:244
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 1 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 5 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 73 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — 34 | RUN /bin/bash /home/Miniconda3-py310_23.5.2-0-Linux-x86_64.sh -f -b -p $CONDA_DIR && \ -------------------- ERROR: failed to solve: process "/bin/sh -c wget https://repo.anaconda.com/miniconda/Miniconda3-py310_23.5.2-0-Linux-x86_64.sh" did not complete successfully: exit code: 4; likely cause (the repository): a RUN step of the repository's REDACTED exited with code 4 (`/bin/sh -c wget https://repo.anaconda.com/miniconda/Miniconda3-py310_23.5.2-0-Linux-x86_64.sh`): the build's own command failed, for example a compile or test error; runtime evidence skipped The cause is in the repository, not in our sandbox: a RUN step of the repository's REDACTED exited with code 4 (`/bin/sh -c wget https://repo.anaconda.com/miniconda/Miniconda3-py310_23.5.2-0-Linux-x86_64.sh`): the build's own command failed, for example a compile or test error. Nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository registers no route and starts no server another machine can reach (no Flask/FastAPI/Starlette route, Django urlpatterns or class-based view, Tornado handler). Access control is therefore N/A here — a library or command-line tool is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or MongoEngine model, a migration or a SQL schema — and no database or data-store client (Django ORM, SQLAlchemy, psycopg, PyMongo, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~5960 lines of test source are present (.py) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — the .py suite was found but not re-run
D16 Bus Factor — dormant codebase — no living knowledge left to concentrate
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D21 Naming Consistency — D21 withholds its case and prefix conventions rows: 7 candidate(s) found and not reported.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Aggregate roots were found in only one source directory (deepmol), which is a layered codebase, not two contexts. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .py, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — D26 could not read how the parts of this repository's one build unit reference each other, so its cohesion was not measured. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D5 Coupling — Not applicable — this Python build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not measured — Python suite
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Python source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
TodoComment REDACTED:172— # TODO: PolynomialFeatures only woks with square matrices — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:173— # TODO: KernelCenter only woks with square matrices — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/pipeline_optimization/_utils.py:144— # TODO: "mpnn_model" is not working (DeepChem-> AttributeError: 'GraphData' object has no attribute 'get_num_atoms') — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/pipeline_optimization/_utils.py:145— # TODO: "megnet_model" is not working (error with torch_geometric (extra_requirement)) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/pipeline_optimization/_utils.py:146— # TODO: "cnn_model" is not working (raise PicklingError( — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/pipeline_optimization/_utils.py:148— # TODO: "multitask_irv_classifier_model" not working (needs 1D featurizer + irv transformer but it is not working) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/pipeline_optimization/_utils.py:149— # TODO: "progressive_multitask_classifier_model" not working (ValueError: Index out of range using input dim 1; — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/pipeline_optimization/_utils.py:151— # TODO: "sc_score_model" not working (Input 0 of layer "dense" is incompatible with the layer: expected axis -1 of — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/pipeline_optimization/_utils.py:153— # TODO: "robust_multitask_classifier_model" works well except when loading the model back in (probably related with — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/pipeline_optimization/_utils.py:413— # TODO: in multitask when n_classes > 2 for different tasks, this will not work (LabelOneHotEncoder needs to work — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:210— # TODO: should this return classes or probabilities? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/parameter_optimization/deepchem_hyperparameter_optimization.py:13— # TODO: it would probably be better if we tried to create a scikit-learn wrapper for DeepchemModel models, — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:14— # TODO: review this function — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/models/base_models.py:10— # TODO: add more pre-defined models — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:210— # TODO: better way to validate model.mode and dataset.mode — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:235— # TODO: Wait for the implementation of iterbactches — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:459— # TODO: isto está testado ? estes transformers nao é um boleano — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/feature_selection/base_feature_selector.py:153— # TODO: takes too long to run, check if its normal or a code problem — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/feature_importance/shap_values.py:90— # TODO: check this — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/deepmol/compound_featurization/rdkit_descriptors.py:364— # TODO : check whether sdf file is being correctly exported for multi-class classification — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Duplicated block (19 lines × 2) src/deepmol/evaluator/evaluator.py:93— src/deepmol/evaluator/evaluator.py:93-111 | REDACTED:365-383 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `metrics` to `Union[Metric, List[Metric]]` in one and `List[Metric]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (19 lines × 2) src/deepmol/tokenizers/atom_level_smiles_tokenizer.py:92— src/deepmol/tokenizers/atom_level_smiles_tokenizer.py:92-110 | src/deepmol/tokenizers/transformers_tokenizer.py:46-64 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: `Dataset` names `deepmol.datasets` in one and `deepmol.datasets.datasets` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (19 lines × 2) REDACTED:1211— REDACTED:1211-1229 | REDACTED:1257-1275 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1211` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19 lines × 2) REDACTED:1188— REDACTED:1188-1206 | REDACTED:1234-1252 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1188` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (19 lines × 2) src/deepmol/compound_featurization/rdkit_descriptors.py:441— src/deepmol/compound_featurization/rdkit_descriptors.py:441-459 | src/deepmol/datasets/datasets.py:1068-1086 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (22 lines × 2) src/deepmol/compound_featurization/base_featurizer.py:99— src/deepmol/compound_featurization/base_featurizer.py:99-120 | src/deepmol/compound_featurization/llms.py:65-86 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (22 lines × 2) src/deepmol/feature_importance/shap_values.py:241— src/deepmol/feature_importance/shap_values.py:241-262 | src/deepmol/feature_importance/shap_values.py:265-286 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22 lines × 2) REDACTED:1348— REDACTED:1348-1369 | REDACTED:1373-1394 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1348` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (22 lines × 2) REDACTED:182— REDACTED:182-204 | src/deepmol/models/keras_models.py:168-189 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: `Dataset` names `deepmol.datasets` in one and `deepmol.datasets.datasets` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (7 lines × 2) src/deepmol/pipeline_optimization/_utils.py:241— src/deepmol/pipeline_optimization/_utils.py:241-247 | src/deepmol/pipeline_optimization/_utils.py:251-258 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/deepmol/pipeline_optimization/_utils.py:241` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/deepmol/splitters/_utils.py:99— src/deepmol/splitters/_utils.py:99-105 | src/deepmol/splitters/_utils.py:133-139 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/deepmol/splitters/splitters.py:811— src/deepmol/splitters/splitters.py:811-817 | src/deepmol/splitters/splitters.py:841-847 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/deepmol/tokenizers/np_bert_tokenizer.py:214— src/deepmol/tokenizers/np_bert_tokenizer.py:214-220 | src/deepmol/tokenizers/transformers_tokenizer.py:172-178 — before extracting anything, compare `src/deepmol/tokenizers/np_bert_tokenizer.py` and `src/deepmol/tokenizers/transformers_tokenizer.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `src/deepmol/tokenizers/np_bert_tokenizer.py:210` calls `to_pickle` and `src/deepmol/tokenizers/transformers_tokenizer.py:168` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 2) src/deepmol/compound_featurization/neural_npfp_generator.py:44— src/deepmol/compound_featurization/neural_npfp_generator.py:44-48 | src/deepmol/compound_featurization/neural_npfp_generator.py:50-54 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) REDACTED:1454— REDACTED:1454-1458 | REDACTED:1479-1483 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/deepmol/compound_featurization/neural_npfp/model.py:144— src/deepmol/compound_featurization/neural_npfp/model.py:144-148 | src/deepmol/compound_featurization/neural_npfp/model.py:221-225 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) REDACTED:1555— REDACTED:1555-1559 | REDACTED:1588-1592 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Swallowed exception (caught, then discarded) REDACTED:91— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) src/deepmol/tokenizers/np_bert_tokenizer.py:39— `except` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) src/deepmol/compound_featurization/rdkit_descriptors.py:66— `except` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) src/deepmol/compound_featurization/rdkit_descriptors.py:244— `except` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (4 members, 50+ identical tokens) src/deepmol/compound_featurization/nc_mfp/Fingerprint_representation_step.py:28— src/deepmol/compound_featurization/nc_mfp/Fingerprint_representation_step.py:28-41 | REDACTED:40-53 | REDACTED:50-63 | src/deepmol/parallelism/multiprocessing.py:15-28 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) src/deepmol/models/keras_model_builders.py:273— src/deepmol/models/keras_model_builders.py:273-358 | src/deepmol/models/keras_model_builders.py:394-463 | src/deepmol/models/keras_model_builders.py:500-581 | src/deepmol/models/keras_model_builders.py:620-708 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:828— REDACTED:828-848 | REDACTED:852-872 | REDACTED:876-896 | REDACTED:900-920 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (9 lines × 2) src/deepmol/compound_featurization/rdkit_fingerprints.py:463— src/deepmol/compound_featurization/rdkit_fingerprints.py:463-471 | src/deepmol/compound_featurization/rdkit_fingerprints.py:495-503 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/deepmol/compound_featurization/rdkit_fingerprints.py:463` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/deepmol/pipeline_optimization/_utils.py:231— src/deepmol/pipeline_optimization/_utils.py:231-239 | src/deepmol/pipeline_optimization/_utils.py:241-249 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/deepmol/pipeline_optimization/_utils.py:231` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/deepmol/splitters/splitters.py:618— src/deepmol/splitters/splitters.py:618-626 | src/deepmol/splitters/splitters.py:797-805 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/deepmol/unsupervised/base_unsupervised.py:387— src/deepmol/unsupervised/base_unsupervised.py:387-394 | src/deepmol/unsupervised/umap.py:86-93 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) src/deepmol/unsupervised/base_unsupervised.py:201— src/deepmol/unsupervised/base_unsupervised.py:201-208 | src/deepmol/unsupervised/umap.py:98-105 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `src/deepmol/unsupervised/base_unsupervised.py:201` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/deepmol/tokenizers/np_bert_tokenizer.py:74— src/deepmol/tokenizers/np_bert_tokenizer.py:74-81 | src/deepmol/tokenizers/transformers_tokenizer.py:35-42 — before extracting anything, compare `src/deepmol/tokenizers/np_bert_tokenizer.py` and `src/deepmol/tokenizers/transformers_tokenizer.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Swallowed exception (empty catch) src/deepmol/tokenizers/__init__.py:4— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) src/deepmol/compound_featurization/base_featurizer.py:107— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) src/deepmol/compound_featurization/llms.py:73— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
FileTooLong: REDACTED REDACTED— FileTooLong — 714 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 214 over it, 1.43× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: models/sklearn_model_builders.py src/deepmol/models/sklearn_model_builders.py— FileTooLong — 570 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 70 over it, 1.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (6 members, 50+ identical tokens) src/deepmol/pipeline_optimization/_keras_model_objectives.py:14— src/deepmol/pipeline_optimization/_keras_model_objectives.py:14-60 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:67-116 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:123-169 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:176-219 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:226-273 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:280-327 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) REDACTED:1564— REDACTED:1564-1593 | REDACTED:1597-1622 | REDACTED:1626-1651 | REDACTED:1655-1681 | REDACTED:1685-1710 | REDACTED:1714-1740 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (5 members, 50+ identical tokens) src/deepmol/models/keras_model_builders.py:239— src/deepmol/models/keras_model_builders.py:239-261 | src/deepmol/models/keras_model_builders.py:363-385 | src/deepmol/models/keras_model_builders.py:468-490 | src/deepmol/models/keras_model_builders.py:586-608 | src/deepmol/models/keras_model_builders.py:713-735 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) REDACTED:594— REDACTED:594-612 | REDACTED:616-634 | REDACTED:677-695 | REDACTED:699-718 | REDACTED:742-760 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication· Edited copy of a member (22 corresponding lines) · ×2
Edited copy of a member (22 corresponding lines) REDACTED:1439— REDACTED:1439-1460 | REDACTED:1464-1485 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (22 corresponding lines) src/deepmol/imbalanced_learn/imbalanced_learn.py:151— src/deepmol/imbalanced_learn/imbalanced_learn.py:151-172 | src/deepmol/imbalanced_learn/imbalanced_learn.py:375-398 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (16 corresponding lines) · ×2
Edited copy of a member (16 corresponding lines) src/deepmol/tokenizers/np_bert_tokenizer.py:191— src/deepmol/tokenizers/np_bert_tokenizer.py:191-210 | src/deepmol/tokenizers/transformers_tokenizer.py:153-168 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (16 corresponding lines) src/deepmol/unsupervised/base_unsupervised.py:256— src/deepmol/unsupervised/base_unsupervised.py:256-271 | src/deepmol/unsupervised/umap.py:131-146 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (28 corresponding lines) · ×2
Edited copy of a member (28 corresponding lines) src/deepmol/compound_featurization/rdkit_descriptors.py:1031— src/deepmol/compound_featurization/rdkit_descriptors.py:1031-1058 | src/deepmol/compound_featurization/rdkit_descriptors.py:1080-1108 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (28 corresponding lines) src/deepmol/compound_featurization/base_featurizer.py:39— src/deepmol/compound_featurization/base_featurizer.py:39-70 | src/deepmol/compound_featurization/llms.py:89-116 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (21 corresponding lines) · ×2
Edited copy of a member (21 corresponding lines) src/deepmol/pipeline_optimization/_feature_selector_objectives.py:73— src/deepmol/pipeline_optimization/_feature_selector_objectives.py:73-93 | src/deepmol/pipeline_optimization/_feature_selector_objectives.py:97-117 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) src/deepmol/unsupervised/base_unsupervised.py:152— src/deepmol/unsupervised/base_unsupervised.py:152-172 | src/deepmol/unsupervised/umap.py:51-71 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (18 lines × 2) REDACTED:764— REDACTED:764-781 | REDACTED:786-803 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:764` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) REDACTED:1821— REDACTED:1821-1838 | REDACTED:1843-1860 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/deepmol/models/keras_model_builders.py:568— src/deepmol/models/keras_model_builders.py:568-579 | src/deepmol/models/keras_model_builders.py:695-706 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/deepmol/models/keras_models.py:218— src/deepmol/models/keras_models.py:218-229 | src/deepmol/models/sklearn_models.py:146-157 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10–11 lines × 2) src/deepmol/compound_featurization/neural_npfp/model.py:115— src/deepmol/compound_featurization/neural_npfp/model.py:115-125 | src/deepmol/compound_featurization/neural_npfp/model.py:162-171 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10–11 lines × 2) src/deepmol/compound_featurization/rdkit_fingerprints.py:496— src/deepmol/compound_featurization/rdkit_fingerprints.py:496-505 | src/deepmol/compound_featurization/rdkit_fingerprints.py:571-581 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/deepmol/compound_featurization/rdkit_fingerprints.py:496` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) REDACTED:225— REDACTED:225-235 | src/deepmol/models/transformer_models.py:340-350 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: `Dataset` names `deepmol.datasets` in one and `deepmol.datasets.datasets` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (11 lines × 2) src/deepmol/models/keras_model_builders.py:551— src/deepmol/models/keras_model_builders.py:551-561 | src/deepmol/models/keras_model_builders.py:671-681 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–10 lines × 2) src/deepmol/models/keras_model_builders.py:342— src/deepmol/models/keras_model_builders.py:342-351 | src/deepmol/models/keras_model_builders.py:451-459 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–10 lines × 2) src/deepmol/models/keras_models.py:378— src/deepmol/models/keras_models.py:378-386 | src/deepmol/models/sklearn_models.py:274-283 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 3) src/deepmol/models/keras_model_builders.py:457— src/deepmol/models/keras_model_builders.py:457-463 | src/deepmol/models/keras_model_builders.py:575-581 | src/deepmol/models/keras_model_builders.py:702-708 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (7 lines × 3) REDACTED:1337— REDACTED:1337-1343 | REDACTED:1362-1368 | REDACTED:1387-1393 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1337` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) src/deepmol/compound_featurization/rdkit_fingerprints.py:186— src/deepmol/compound_featurization/rdkit_fingerprints.py:186-191 | src/deepmol/compound_featurization/rdkit_fingerprints.py:530-535 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) src/deepmol/tokenizers/np_bert_tokenizer.py:224— src/deepmol/tokenizers/np_bert_tokenizer.py:224-229 | src/deepmol/tokenizers/transformers_tokenizer.py:182-187 — before extracting anything, compare `src/deepmol/tokenizers/np_bert_tokenizer.py` and `src/deepmol/tokenizers/transformers_tokenizer.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Low cohesion: SklearnModel (LCOM4 5) src/deepmol/models/sklearn_models.py:17— SklearnModel's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Model (LCOM4 4) src/deepmol/models/models.py:19— Model's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
_utils.preset_deepchem_models (cyclomatic 39) src/deepmol/pipeline_optimization/_utils.py:128— _utils.preset_deepchem_models has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_utils.get_prediction_from_proba (cyclomatic 32) REDACTED:136— _utils.get_prediction_from_proba has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SmilesDataset._validate_params (cyclomatic 26) src/deepmol/datasets/datasets.py:462— SmilesDataset._validate_params has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
HyperparameterOptimizerValidation.fit (cyclomatic 22) src/deepmol/parameter_optimization/hyperparameter_optimization.py:35— HyperparameterOptimizerValidation.fit has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FragmentIdentifying.identify_Fragment_Smarts (cyclomatic 19) src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:7— FragmentIdentifying.identify_Fragment_Smarts has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
VotingClassifier.predict (cyclomatic 18) src/deepmol/models/ensembles.py:94— VotingClassifier.predict has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SFCPAssigning.assign_All_SFCP_Smarts (cyclomatic 17) src/deepmol/compound_featurization/nc_mfp/SFCP_assigning_step.py:8— SFCPAssigning.assign_All_SFCP_Smarts has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
HyperparameterOptimizerCV.fit (cyclomatic 17) src/deepmol/parameter_optimization/hyperparameter_optimization.py:190— HyperparameterOptimizerCV.fit has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
keras_model_builders.keras_bidirectional_rnn_model_builder (cyclomatic 16) src/deepmol/models/keras_model_builders.py:611— keras_model_builders.keras_bidirectional_rnn_model_builder has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_utils.get_prediction_from_proba (cognitive 95) REDACTED:136— _utils.get_prediction_from_proba has cognitive complexity 95 (threshold 15). Drivers by points: if/else 19 (53 pts), ternaries 5 (32 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
VotingClassifier.predict (cognitive 53) src/deepmol/models/ensembles.py:94— VotingClassifier.predict has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 9 (24 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FragmentIdentifying.identify_Fragment_Smarts (cognitive 52) src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:7— FragmentIdentifying.identify_Fragment_Smarts has cognitive complexity 52 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 7 (17 pts), error handling 2 (9 pts), boolean chains 3 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SFCPAssigning.assign_All_SFCP_Smarts (cognitive 46) src/deepmol/compound_featurization/nc_mfp/SFCP_assigning_step.py:8— SFCPAssigning.assign_All_SFCP_Smarts has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 7 (17 pts), error handling 2 (9 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HyperparameterOptimizerValidation.fit (cognitive 43) src/deepmol/parameter_optimization/hyperparameter_optimization.py:35— HyperparameterOptimizerValidation.fit has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (28 pts), error handling 2 (7 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Pipeline._fit (cognitive 40) src/deepmol/pipeline/pipeline.py:117— Pipeline._fit has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 4 (12 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MHFPEncoder.shingling_from_mol (cognitive 34) REDACTED:248— MHFPEncoder.shingling_from_mol has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 6 (14 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train_ae.train (cognitive 33) src/deepmol/compound_featurization/neural_npfp/model.py:220— train_ae.train has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 3 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SmilesDataset._validate_params (cognitive 33) src/deepmol/datasets/datasets.py:462— SmilesDataset._validate_params has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 6 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NPClassifierFP._featurize (cognitive 27) src/deepmol/compound_featurization/np_classifier_fp.py:16— NPClassifierFP._featurize has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (12 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SDFLoader.create_dataset (cognitive 26) src/deepmol/loaders/loaders.py:333— SDFLoader.create_dataset has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (7 pts), ternaries 3, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ObjectiveTrainEval._run (cognitive 26) src/deepmol/pipeline_optimization/objective_wrapper.py:121— ObjectiveTrainEval._run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, ternaries 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
KerasModel._fit (cognitive 24) src/deepmol/models/keras_models.py:102— KerasModel._fit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MACCSkeysFingerprint.draw_bit (cognitive 23) src/deepmol/compound_featurization/rdkit_fingerprints.py:232— MACCSkeysFingerprint.draw_bit has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 7 (8 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
_utils.get_train_valid_test_indexes (cognitive 22) src/deepmol/splitters/_utils.py:10— _utils.get_train_valid_test_indexes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SmilesDataset.select (cognitive 21) src/deepmol/datasets/datasets.py:951— SmilesDataset.select has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_utils.preset_deepchem_models (cognitive 21) src/deepmol/pipeline_optimization/_utils.py:128— _utils.preset_deepchem_models has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LLMDataset.__getitem__ (cognitive 20) src/deepmol/datasets/llm_smiles_dataset.py:77— LLMDataset.__getitem__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DeepChemModel.predict_proba (cognitive 20) REDACTED:274— DeepChemModel.predict_proba has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HyperparameterOptimizerCV.fit (cognitive 20) src/deepmol/parameter_optimization/hyperparameter_optimization.py:190— HyperparameterOptimizerCV.fit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (19 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
rdkit_descriptors.generate_conformers_to_sdf_file (cognitive 19) src/deepmol/compound_featurization/rdkit_descriptors.py:365— rdkit_descriptors.generate_conformers_to_sdf_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MorganFingerprint.draw_bits (cognitive 19) src/deepmol/compound_featurization/rdkit_fingerprints.py:130— MorganFingerprint.draw_bits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
keras_model_builders.keras_bidirectional_rnn_model_builder (cognitive 19) src/deepmol/models/keras_model_builders.py:611— keras_model_builders.keras_bidirectional_rnn_model_builder has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9, if/else 4 (6 pts), loops 3, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
SimilaritySplitter.split (cognitive 19) src/deepmol/splitters/splitters.py:378— SimilaritySplitter.split has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train_model.train (cognitive 18) src/deepmol/compound_featurization/neural_npfp/model.py:143— train_model.train has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RDKFingerprint.draw_bits (cognitive 18) src/deepmol/compound_featurization/rdkit_fingerprints.py:476— RDKFingerprint.draw_bits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ButinaSplitter.split (cognitive 18) src/deepmol/splitters/splitters.py:761— ButinaSplitter.split has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
SmilesDataset.remove_nan (cognitive 17) src/deepmol/datasets/datasets.py:889— SmilesDataset.remove_nan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SmilesDataset.to_sdf (cognitive 17) src/deepmol/datasets/datasets.py:1056— SmilesDataset.to_sdf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VotingPipeline.predict (cognitive 17) REDACTED:224— VotingPipeline.predict has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VotingPipeline.predict_proba) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
VotingPipeline.predict_proba (cognitive 17) REDACTED:283— VotingPipeline.predict_proba has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VotingPipeline.predict) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
_keras_model_objectives._get_keras_model (cognitive 17) src/deepmol/pipeline_optimization/_keras_model_objectives.py:341— _keras_model_objectives._get_keras_model has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 6 (7 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_utils.preset_sklearn_models (cognitive 17) src/deepmol/pipeline_optimization/_utils.py:343— _utils.preset_sklearn_models has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
setup.get_extra_requires (cognitive 16) setup.py:4— setup.get_extra_requires has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DeepChemModel._fit (cognitive 16) REDACTED:201— DeepChemModel._fit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
keras_model_builders.keras_fcnn_model_builder (cognitive 16) src/deepmol/models/keras_model_builders.py:10— keras_model_builders.keras_fcnn_model_builder has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 10, if/else 2 (4 pts), loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
DeepchemBaseSearchCV.fit (cognitive 16) src/deepmol/parameter_optimization/deepchem_hyperparameter_optimization.py:66— DeepchemBaseSearchCV.fit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_utils.preset_keras_models (cognitive 16) src/deepmol/pipeline_optimization/_utils.py:393— _utils.preset_keras_models has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 2 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Members sharing a duplicated core (11 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (11 members, 50+ identical tokens) src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:9— src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:9-84 | src/deepmol/compound_featurization/nc_mfp/SFCP_assigning_step.py:10-83 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:8-26 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:31-47 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:53-70 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:75-91 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:96-113 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:118-134 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:165-181 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:212-228 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:259-275 — These 11 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 11 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 11 times.
D4 · Code Duplication· Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (7 members, 50+ identical tokens) REDACTED:339— REDACTED:339-365 | REDACTED:401-427 | REDACTED:433-462 | REDACTED:528-562 | REDACTED:787-813 | REDACTED:819-845 | REDACTED:851-879 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
D4 · Code Duplication· Edited copy of a member (82 corresponding lines) · ×1
Edited copy of a member (82 corresponding lines) src/deepmol/models/keras_model_builders.py:17— src/deepmol/models/keras_model_builders.py:17-98 | src/deepmol/models/keras_model_builders.py:137-234 — These two members are one piece of code written twice and then edited apart: 82 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (66 corresponding lines) · ×1
Edited copy of a member (66 corresponding lines) src/deepmol/compound_featurization/rdkit_fingerprints.py:132— src/deepmol/compound_featurization/rdkit_fingerprints.py:132-198 | src/deepmol/compound_featurization/rdkit_fingerprints.py:477-542 — These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (37 corresponding lines) · ×1
Edited copy of a member (37 corresponding lines) src/deepmol/unsupervised/base_unsupervised.py:175— src/deepmol/unsupervised/base_unsupervised.py:175-214 | src/deepmol/unsupervised/umap.py:74-110 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (57 corresponding lines) · ×1
Edited copy of a member (57 corresponding lines) REDACTED:225— REDACTED:225-281 | REDACTED:284-341 — These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (45 corresponding lines) · ×1
Edited copy of a member (45 corresponding lines) src/deepmol/loaders/loaders.py:100— src/deepmol/loaders/loaders.py:100-144 | src/deepmol/loaders/loaders.py:206-259 — These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (20 corresponding lines) · ×1
Edited copy of a member (20 corresponding lines) REDACTED:131— REDACTED:131-153 | REDACTED:156-175 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (38 corresponding lines) · ×1
Edited copy of a member (38 corresponding lines) REDACTED:207— REDACTED:207-244 | src/deepmol/models/transformer_models.py:320-360 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 53+ corresponding lines) · ×1
Edited copies of one member (3 members, 53+ corresponding lines) REDACTED:418— REDACTED:418-473 | src/deepmol/models/keras_models.py:334-386 | src/deepmol/models/sklearn_models.py:227-283 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 53 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (43 corresponding lines) · ×1
Edited copy of a member (43 corresponding lines) src/deepmol/compound_featurization/base_featurizer.py:78— src/deepmol/compound_featurization/base_featurizer.py:78-120 | src/deepmol/compound_featurization/llms.py:42-86 — These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (15 corresponding lines) · ×1
Edited copy of a member (15 corresponding lines) src/deepmol/compound_featurization/neural_npfp/model.py:16— src/deepmol/compound_featurization/neural_npfp/model.py:16-30 | src/deepmol/compound_featurization/neural_npfp/model.py:44-58 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (35 corresponding lines) · ×1
Edited copy of a member (35 corresponding lines) REDACTED:108— REDACTED:108-148 | REDACTED:193-227 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (39 corresponding lines) · ×1
Edited copy of a member (39 corresponding lines) src/deepmol/evaluator/evaluator.py:72— src/deepmol/evaluator/evaluator.py:72-111 | REDACTED:345-383 — These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (34 corresponding lines) · ×1
Edited copy of a member (34 corresponding lines) src/deepmol/compound_featurization/deepchem_featurizers.py:442— src/deepmol/compound_featurization/deepchem_featurizers.py:442-475 | src/deepmol/compound_featurization/deepchem_featurizers.py:530-565 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (27 corresponding lines) · ×1
Edited copy of a member (27 corresponding lines) src/deepmol/tokenizers/np_bert_tokenizer.py:144— src/deepmol/tokenizers/np_bert_tokenizer.py:144-170 | src/deepmol/tokenizers/transformers_tokenizer.py:106-132 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (29 corresponding lines) · ×1
Edited copy of a member (29 corresponding lines) src/deepmol/splitters/splitters.py:225— src/deepmol/splitters/splitters.py:225-253 | src/deepmol/splitters/splitters.py:265-293 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (26 corresponding lines) · ×1
Edited copy of a member (26 corresponding lines) REDACTED:1744— REDACTED:1744-1769 | REDACTED:1773-1799 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 22+ corresponding lines) · ×1
Edited copies of one member (3 members, 22+ corresponding lines) src/deepmol/imbalanced_learn/imbalanced_learn.py:306— src/deepmol/imbalanced_learn/imbalanced_learn.py:306-327 | src/deepmol/imbalanced_learn/imbalanced_learn.py:462-484 | src/deepmol/imbalanced_learn/imbalanced_learn.py:544-566 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 14+ corresponding lines) · ×1
Edited copies of one member (4 members, 14+ corresponding lines) src/deepmol/models/transformer_models.py:403— src/deepmol/models/transformer_models.py:403-416 | src/deepmol/models/transformer_models.py:432-450 | src/deepmol/models/transformer_models.py:466-481 | src/deepmol/models/transformer_models.py:491-505 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (31 corresponding lines) · ×1
Edited copy of a member (31 corresponding lines) src/deepmol/compound_featurization/deepchem_featurizers.py:406— src/deepmol/compound_featurization/deepchem_featurizers.py:406-439 | src/deepmol/compound_featurization/deepchem_featurizers.py:497-527 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 19+ corresponding lines) · ×1
Edited copies of one member (3 members, 19+ corresponding lines) src/deepmol/feature_importance/shap_values.py:112— src/deepmol/feature_importance/shap_values.py:112-131 | src/deepmol/feature_importance/shap_values.py:134-152 | src/deepmol/feature_importance/shap_values.py:219-238 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 10+ corresponding lines) · ×1
Edited copies of one member (4 members, 10+ corresponding lines) src/deepmol/pipeline_optimization/_utils.py:76— src/deepmol/pipeline_optimization/_utils.py:76-85 | src/deepmol/pipeline_optimization/_utils.py:89-98 | src/deepmol/pipeline_optimization/_utils.py:102-111 | src/deepmol/pipeline_optimization/_utils.py:115-125 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (4 corresponding lines) · ×1
Edited copy of a member (4 corresponding lines) src/deepmol/compound_featurization/neural_npfp/utils.py:61— src/deepmol/compound_featurization/neural_npfp/utils.py:61-64 | src/deepmol/compound_featurization/neural_npfp/utils.py:164-168 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 26+ corresponding lines) · ×1
Edited copies of one member (4 members, 26+ corresponding lines) src/deepmol/compound_featurization/rdkit_fingerprints.py:336— src/deepmol/compound_featurization/rdkit_fingerprints.py:336-364 | src/deepmol/compound_featurization/rdkit_fingerprints.py:414-448 | src/deepmol/compound_featurization/rdkit_fingerprints.py:627-655 | src/deepmol/compound_featurization/rdkit_fingerprints.py:697-722 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Duplicated block (63–68 lines × 2) src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:10— src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:10-72 | src/deepmol/compound_featurization/nc_mfp/SFCP_assigning_step.py:11-78 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (42 lines × 2) src/deepmol/loaders/loaders.py:30— src/deepmol/loaders/loaders.py:30-71 | src/deepmol/loaders/loaders.py:159-200 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (3–41 lines × 6) src/deepmol/models/keras_model_builders.py:273— src/deepmol/models/keras_model_builders.py:273-319 | src/deepmol/models/keras_model_builders.py:394-434 | src/deepmol/models/keras_model_builders.py:500-546 | src/deepmol/models/keras_model_builders.py:548-550 | src/deepmol/models/keras_model_builders.py:620-666 | src/deepmol/models/keras_model_builders.py:668-670 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (37 lines × 2) src/deepmol/loaders/loaders.py:100— src/deepmol/loaders/loaders.py:100-136 | src/deepmol/loaders/loaders.py:206-242 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (34 lines × 2) REDACTED:56— REDACTED:56-89 | REDACTED:66-99 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (2–31 lines × 6) src/deepmol/pipeline_optimization/_keras_model_objectives.py:42— src/deepmol/pipeline_optimization/_keras_model_objectives.py:42-43 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:176-206 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:226-256 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:258-259 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:280-310 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:312-313 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (30–31 lines × 2) REDACTED:247— REDACTED:247-276 | REDACTED:306-336 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (31 lines × 2) REDACTED:14— REDACTED:14-44 | REDACTED:61-91 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (24 lines × 6) REDACTED:1564— REDACTED:1564-1587 | REDACTED:1597-1620 | REDACTED:1626-1649 | REDACTED:1655-1678 | REDACTED:1685-1708 | REDACTED:1714-1737 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1564` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24 lines × 3) REDACTED:1531— REDACTED:1531-1554 | REDACTED:1744-1767 | REDACTED:1773-1796 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:1531` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24 lines × 2) src/deepmol/tokenizers/np_bert_tokenizer.py:144— src/deepmol/tokenizers/np_bert_tokenizer.py:144-167 | src/deepmol/tokenizers/transformers_tokenizer.py:106-129 — before extracting anything, compare `src/deepmol/tokenizers/np_bert_tokenizer.py` and `src/deepmol/tokenizers/transformers_tokenizer.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (2–23 lines × 8) REDACTED:339— REDACTED:339-361 | REDACTED:401-423 | REDACTED:433-455 | REDACTED:549-550 | REDACTED:551-554 | REDACTED:787-809 | REDACTED:819-841 | REDACTED:851-873 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:455` calls `suggest_categorical`, `str` and `REDACTED:550` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (21–22 lines × 3) src/deepmol/models/transformer_models.py:147— src/deepmol/models/transformer_models.py:147-168 | src/deepmol/models/transformer_models.py:173-194 | src/deepmol/models/transformer_models.py:205-225 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (21 lines × 5) src/deepmol/models/keras_model_builders.py:239— src/deepmol/models/keras_model_builders.py:239-259 | src/deepmol/models/keras_model_builders.py:363-383 | src/deepmol/models/keras_model_builders.py:468-488 | src/deepmol/models/keras_model_builders.py:586-606 | src/deepmol/models/keras_model_builders.py:713-733 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (18–20 lines × 2) REDACTED:131— REDACTED:131-150 | REDACTED:156-173 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:131` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (4–17 lines × 5) REDACTED:594— REDACTED:594-610 | REDACTED:616-632 | REDACTED:677-693 | REDACTED:713-716 | REDACTED:742-758 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:594` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `REDACTED:738` calls `linear_svr_model`, `one_class_svm_step` and `REDACTED:713` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (17 lines × 3) src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:165— src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:165-181 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:212-228 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:259-275 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (4–17 lines × 4) REDACTED:828— REDACTED:828-844 | REDACTED:852-868 | REDACTED:890-893 | REDACTED:900-916 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:828` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:844` calls `suggest_int` and `REDACTED:893` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (14–16 lines × 2) src/deepmol/models/atmol/model_gat_pre.py:64— src/deepmol/models/atmol/model_gat_pre.py:64-79 | src/deepmol/models/atmol/model_gat_pre.py:86-99 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 4) src/deepmol/compound_featurization/nc_mfp/Fingerprint_representation_step.py:28— src/deepmol/compound_featurization/nc_mfp/Fingerprint_representation_step.py:28-41 | REDACTED:40-53 | REDACTED:50-63 | src/deepmol/parallelism/multiprocessing.py:15-28 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (13–14 lines × 3) src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:13— src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:13-26 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:58-70 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:101-113 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (25 lines × 2) src/deepmol/compound_featurization/nc_mfp/Fragment_list_generation_step.py:11— src/deepmol/compound_featurization/nc_mfp/Fragment_list_generation_step.py:11-35 | src/deepmol/compound_featurization/nc_mfp/Fragment_list_generation_step.py:40-64 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12–13 lines × 9) src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:9— src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:9-20 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:32-43 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:54-65 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:76-87 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:97-108 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:119-130 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:166-178 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:213-225 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:260-272 — all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:21` calls `MolFromSmarts` and `src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:44` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11 lines × 8) src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:9— src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:9-19 | src/deepmol/compound_featurization/nc_mfp/SFCP_assigning_step.py:10-20 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:8-18 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:31-41 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:53-63 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:75-85 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:96-106 | src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:118-128 — there are 8 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:21` calls `MolFromSmarts` and `src/deepmol/compound_featurization/nc_mfp/Scaffold_matching_step.py:43` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (2–10 lines × 6) src/deepmol/pipeline_optimization/_keras_model_objectives.py:58— src/deepmol/pipeline_optimization/_keras_model_objectives.py:58-59 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:114-115 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:167-168 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:209-217 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:262-271 | src/deepmol/pipeline_optimization/_keras_model_objectives.py:316-325 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `src/deepmol/pipeline_optimization/_keras_model_objectives.py:209` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 2) src/deepmol/compound_featurization/rdkit_fingerprints.py:168— src/deepmol/compound_featurization/rdkit_fingerprints.py:168-177 | src/deepmol/compound_featurization/rdkit_fingerprints.py:511-520 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6–7 lines × 3) src/deepmol/unsupervised/base_unsupervised.py:189— src/deepmol/unsupervised/base_unsupervised.py:189-195 | src/deepmol/unsupervised/base_unsupervised.py:389-394 | src/deepmol/unsupervised/umap.py:88-94 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `src/deepmol/unsupervised/base_unsupervised.py:189` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/compound_featurization/rdkit_descriptors.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/splitters/splitters.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/compound_featurization/deepchem_featurizers.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/models/keras_model_builders.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/unsupervised/base_unsupervised.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/compound_featurization/rdkit_fingerprints.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/models/deepchem_model_builders.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/imbalanced_learn/imbalanced_learn.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/pipeline_optimization/_utils.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/pipeline_optimization/_keras_model_objectives.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/compound_featurization/neural_npfp/model.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/models/transformer_models.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/feature_selection/base_feature_selector.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/parameter_optimization/hyperparameter_optimization.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/models/keras_models.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/pipeline/pipeline.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/loaders/loaders.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/feature_importance/shap_values.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/scalers/sklearn_scalers.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/deepmol/compound_featurization/neural_npfp/utils.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Duplicated predicate src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:34— `atom_symbol == 'O' or atom_symbol == 'N'` appears character-identically in 2 files — src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py, src/deepmol/compound_featurization/nc_mfp/SFCP_assigning_step.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate src/deepmol/base/estimator.py:63— `hasattr(self, '_is_fitted') and self._is_fitted` appears character-identically in 2 files — src/deepmol/base/estimator.py, src/deepmol/base/predictor.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate src/deepmol/compound_featurization/base_featurizer.py:110— `isinstance(features[0], np.ndarray) and len(features[0].shape) == 2` appears character-identically in 2 files — src/deepmol/compound_featurization/base_featurizer.py, src/deepmol/compound_featurization/llms.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate src/deepmol/models/keras_models.py:223— `predictions.shape[1] == len(dataset.mols) and predictions.shape[0] == dataset.n_tasks` appears character-identically in 2 files — src/deepmol/models/keras_models.py, src/deepmol/models/sklearn_models.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py:36— `qMol.GetAtoms()[atom_idx-1].GetSymbol() == 'C' and qMol.GetAtoms()[atom_idx+1].GetSymbol() == 'C'` appears character-identically in 2 files — src/deepmol/compound_featurization/nc_mfp/Fragment_identifying_step.py, src/deepmol/compound_featurization/nc_mfp/SFCP_assigning_step.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D34 · Knowledge Freshness· Most significant orphaned file · ×3
Most significant orphaned file src/deepmol/models/sklearn_model_builders.py:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file REDACTED:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file src/deepmol/datasets/datasets.py:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Fat interface: Dataset (17 abstract methods) src/deepmol/datasets/datasets.py:18— `Dataset` declares 17 abstract methods: `smiles`, `mols`, `removed_elements`, `X`, `y`, `ids`, `feature_names`, `label_names`, `n_tasks`, `mode`, `get_shape`, `remove_nan`, `remove_elements`, `select_features_by_index`, `select_features_by_name`, `select`, `select_to_split`. Counted over its `@abstractmethod`s (and abstract properties), once per name; concrete methods are helpers an implementer inherits, not a burden, and `_`-prefixed members are not counted. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Dormant codebase — 83 of 83 significant files have no living knowledge — the codebase as a whole is dormant, not 83 separate risks. Counted over 83 of the 133 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No SAST REDACTED:4— No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
No dependency-update automation REDACTED:1— `REDACTED` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
No release approval gate REDACTED:15— The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Outdated: cached-property — `cached-property` is pinned to 1.5.2, but 2.0.1 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 1.5.2 until the declaration is edited. This crosses a major version, so it is a migration rather than a bump.
Outdated: chembl-structure-pipeline — `chembl-structure-pipeline` is pinned to 1.1.0, but 1.2.4 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 1.1.0 until the declaration is edited.
Outdated: dill — `dill` is pinned to 0.3.6, but 0.4.1 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.3.6 until the declaration is edited.
Outdated: kaleido — `kaleido` is pinned to 0.2.1, but 1.5.1 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.2.1 until the declaration is edited. This crosses a major version, so it is a migration rather than a bump.
Outdated: kneed — `kneed` is pinned to 0.8.2, but 0.9.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.8.2 until the declaration is edited.
Outdated: optuna — `optuna` is pinned to 4.1.0, but 5.1.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 4.1.0 until the declaration is edited. This crosses a major version, so it is a migration rather than a bump.
Outdated: pydantic — `pydantic` is pinned to 2.6.4, but 2.14.3 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2.6.4 until the declaration is edited.
Outdated: rdkit — `rdkit` is pinned to 2025.9.6, but 2026.9.2 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2025.9.6 until the declaration is edited. This crosses a major version, so it is a migration rather than a bump.
Outdated: scikeras — `scikeras` is pinned to 0.12.0, but 0.13.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.12.0 until the declaration is edited.
Outdated: shap — `shap` is pinned to 0.44.0, but 0.54.1 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.44.0 until the declaration is edited.
Outdated: tensorflow — `tensorflow` is pinned to 2.15.0, but 2.21.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2.15.0 until the declaration is edited.
Outdated: tensorflow-probability — `tensorflow-probability` is pinned to 0.23.0, but 0.25.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.23.0 until the declaration is edited.
Outdated: torch — `torch` is pinned to 2.6.0, but 2.15.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2.6.0 until the declaration is edited.
Outdated: torch-geometric — `torch-geometric` is pinned to 2.6.1, but 2.8.1 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2.6.1 until the declaration is edited.
Outdated: umap-learn — `umap-learn` is pinned to 0.5.1, but 0.6.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.5.1 until the declaration is edited.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a1e6db-dfff-73c9-8e45-2fcbc5e5e2bb · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 33 · Warnings: 215 · Recommendations: 99 · Info: 15 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 17-11-2026 @ 00:15 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.