{"id":"W3189289076","doi":"10.28924/2291-8639-19-2021-633","title":"The Maximum Distance Problem and Minimum Spanning Trees","year":2021,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Minimum spanning tree; Spanning tree; Cover (algebra); Lemma (botany); Hausdorff distance; Combinatorics; Minimum distance; Hausdorff space; Lipschitz continuity; RADIUS; Measure (data warehouse); Discrete mathematics; Mathematical analysis; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544096,0.00005369468,0.00009776124,0.0001337138,0.000182261,0.0003842746,0.0002881254,0.00001568173,0.000003942128],"category_scores_gemma":[0.00002633166,0.00003939087,0.00007948597,0.0005385646,0.00003743261,0.0002226891,0.00009271889,0.00006598637,8.267646e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001525275,"about_ca_system_score_gemma":0.00005639693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002978698,"about_ca_topic_score_gemma":0.00003947741,"domain_scores_codex":[0.9992277,0.0000307346,0.0002780835,0.0001315087,0.0002694509,0.0000625036],"domain_scores_gemma":[0.9988543,0.0001769318,0.0002157004,0.0001106558,0.0005898746,0.00005257561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001149877,0.00009804088,0.00482546,0.000003576755,0.001222501,0.00001743544,0.0003053666,0.005546639,0.002150859,0.4112116,0.0004090722,0.5741979],"study_design_scores_gemma":[0.001098986,0.00009267699,0.0903217,0.00005034505,0.0006669812,0.0006055627,0.0006440032,0.1916279,0.003423273,0.2658471,0.4452056,0.0004158477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00929263,0.001784983,0.981661,0.006696391,0.0000649167,0.00003116766,0.000003294024,0.000005240953,0.000460425],"genre_scores_gemma":[0.9605367,0.0009822003,0.0377476,0.0001726454,0.0002084038,0.00000924137,0.000008010381,0.000002235821,0.0003329257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9512441,"threshold_uncertainty_score":0.3705569,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007706067556432191,"score_gpt":0.2633791899531915,"score_spread":0.2556731223967593,"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."}}