{"id":"W4392517515","doi":"10.26434/chemrxiv-2024-cq702","title":"DeltaGzip: Computing Biopolymer-Ligand Binding Affinity via Kolmogorov Complexity and Lossless Compression","year":2024,"lang":"en","type":"preprint","venue":"ChemRxiv","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Lossless compression; Biopolymer; Compression (physics); Ligand (biochemistry); Kolmogorov complexity; Mathematics; Computer science; Data compression; Chemistry; Materials science; Algorithm; Polymer; Composite material; Biochemistry","routes":{"ca_aff":true,"ca_fund":true,"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.0008085538,0.000708235,0.0007243321,0.001204713,0.0003707858,0.001042503,0.001040392,0.0009253042,0.002000422],"category_scores_gemma":[0.004561732,0.0002835522,0.0003575099,0.0008295335,0.0008128618,0.001555702,0.001132602,0.0009416784,0.0005285643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000964418,"about_ca_system_score_gemma":0.0009665263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002010363,"about_ca_topic_score_gemma":0.002306862,"domain_scores_codex":[0.9996547,0.00006692789,0.00002087216,0.00004193684,0.0001781276,0.0000375231],"domain_scores_gemma":[0.9988816,0.0006556627,0.0001011489,0.0001680238,0.0001339008,0.00005968969],"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.0004329646,0.0001241641,0.003064251,0.0002767075,0.00007486249,0.0001993536,0.0001063718,0.7986144,0.01412299,0.02459444,0.007465221,0.1509242],"study_design_scores_gemma":[0.00001249936,0.00002722905,0.00025808,0.00000501132,0.000002881631,0.0000245657,0.000007103412,0.9891158,0.003520664,0.00655103,0.0004683464,0.000006793863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1581374,0.001131552,0.8287901,0.0004497829,0.0001049362,0.0001528317,0.00116888,0.006840495,0.003223924],"genre_scores_gemma":[0.6992626,0.0005130239,0.2951575,0.0002069911,0.00007568146,0.0002746662,0.001928572,0.0005655694,0.002015378],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002010363,"threshold_uncertainty_score":0.006997347,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06109308626370177,"score_gpt":0.3348081352436465,"score_spread":0.2737150489799448,"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."}}