{"id":"W4409184428","doi":"10.1021/acs.jctc.5c00074","title":"Persistent Directed Flag Laplacian (PDFL)-Based Machine Learning for Protein–Ligand Binding Affinity Prediction","year":2025,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"National Institute of Allergy and Infectious Diseases; National Institute of General Medical Sciences; Michigan State University; Bristol-Myers Squibb; National Institutes of Health; National Science Foundation","keywords":"Flag (linear algebra); Computer science; Ligand (biochemistry); Artificial intelligence; Machine learning; Chemistry; Computational biology; Mathematics; Receptor; Biology; Biochemistry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088456,0.0007693288,0.0009466534,0.001844081,0.0004953183,0.000725249,0.002173303,0.001173799,0.002318241],"category_scores_gemma":[0.004514288,0.0003672508,0.0007799199,0.00135059,0.0006591543,0.001828044,0.001382606,0.00123603,0.0009709941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001191371,"about_ca_system_score_gemma":0.001237308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007052577,"about_ca_topic_score_gemma":0.007467313,"domain_scores_codex":[0.9995769,0.0001459674,0.0000182963,0.00007896963,0.0001268212,0.00005304531],"domain_scores_gemma":[0.9982577,0.001041321,0.0001356141,0.0001654144,0.0002867256,0.0001132031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001093797,0.0001170873,0.002828448,0.0001074851,0.00006347193,0.00008775205,0.0000371691,0.8760625,0.001855561,0.007419861,0.006606559,0.1047048],"study_design_scores_gemma":[0.000003546028,0.000008391827,0.00007597202,0.000001954731,0.00000170012,0.00000859821,0.000002481667,0.9961795,0.000137065,0.003407404,0.0001701935,0.000003231135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07472652,0.0009495678,0.9138061,0.0009048832,0.00008239582,0.00008903353,0.0009935501,0.005660012,0.002787901],"genre_scores_gemma":[0.8267199,0.0005168389,0.1658597,0.0006596023,0.000104581,0.0002344378,0.002106254,0.0004335429,0.003365034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007052577,"threshold_uncertainty_score":0.01402307,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01610145339089029,"score_gpt":0.2853000915023668,"score_spread":0.2691986381114765,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}