{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000973342,0.00009442441,0.0001873517,0.0001497843,0.00007081314,0.0001960137,0.0008732267,0.00004340596,0.000003274438],"category_scores_gemma":[0.00007674992,0.00005728169,0.0001111683,0.0004877741,0.0002347444,0.001879439,0.000202076,0.0001181206,8.001534e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001644823,"about_ca_system_score_gemma":0.0001393428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002531839,"about_ca_topic_score_gemma":7.852145e-8,"domain_scores_codex":[0.9986395,0.00003039917,0.0005788986,0.00009488696,0.000508107,0.0001481822],"domain_scores_gemma":[0.9983746,0.0006847896,0.0004166088,0.0001115935,0.000332254,0.00008012106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001620959,0.00004443003,0.0001710391,0.000009710222,0.00002030902,4.358388e-7,0.0005661186,0.008102009,0.0006416345,0.005949979,0.000630497,0.9838476],"study_design_scores_gemma":[0.0004073107,0.0001080631,0.0004343445,0.00002238322,0.000006157954,0.0001836789,0.0000256738,0.9841524,0.007612877,0.002694832,0.004274316,0.00007794339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.121409,0.0001043361,0.8766021,0.001459181,0.0002574624,0.00007025008,0.000001396917,0.000009283222,0.00008703869],"genre_scores_gemma":[0.4147597,0.00003947903,0.5839592,0.0009559655,0.0002749883,0.000003366744,9.099268e-7,0.00000217255,0.000004286545],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9837697,"threshold_uncertainty_score":0.233588,"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."}}