{"id":"W2016219846","doi":"10.1021/ci0001536","title":"A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees","year":2001,"lang":"en","type":"article","venue":"Journal of Chemical Information and Computer Sciences","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Wiener index; Computation; Index (typography); Algorithm; Computational complexity theory; Mathematics; Tree (set theory); Computer science; Combinatorics; Graph","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.001134847,0.001275721,0.001411315,0.002523569,0.00103329,0.00227729,0.00208286,0.001294689,0.0149583],"category_scores_gemma":[0.005440261,0.0006581022,0.001430309,0.00229651,0.0009504383,0.002921892,0.003050279,0.002402019,0.005717153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00152182,"about_ca_system_score_gemma":0.002246034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003022925,"about_ca_topic_score_gemma":0.005031368,"domain_scores_codex":[0.9990777,0.0001825287,0.00008808188,0.0002117049,0.0003340981,0.0001058157],"domain_scores_gemma":[0.9981411,0.000964082,0.000134792,0.0003145557,0.0003509889,0.00009445252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002721272,0.0001515318,0.0006319345,0.0003268384,0.0001016307,0.00009840833,0.0001834408,0.1080902,0.009331752,0.08123009,0.009536036,0.790046],"study_design_scores_gemma":[0.0001495202,0.000130968,0.0003508142,0.00003856608,0.00003977868,0.0001500911,0.00006260071,0.8158867,0.00628829,0.1691835,0.007655731,0.00006358774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001922358,0.00009055112,0.9956028,0.00006403913,0.00003117799,0.00006823954,0.00006276571,0.001276171,0.000881799],"genre_scores_gemma":[0.0291224,0.0001215873,0.9678895,0.00004386867,0.00004034348,0.0003300707,0.0002791888,0.000322989,0.001850077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0149583,"threshold_uncertainty_score":0.05004048,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02596844196855856,"score_gpt":0.3009394019409087,"score_spread":0.2749709599723501,"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."}}