{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002190004,0.0009919731,0.001643898,0.001692509,0.001039811,0.001814524,0.00208451,0.002212016,0.004684681],"category_scores_gemma":[0.01234428,0.0008299889,0.001340168,0.002140458,0.001724366,0.004534224,0.003071296,0.001928852,0.0007244939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327034,"about_ca_system_score_gemma":0.0007582454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001528685,"about_ca_topic_score_gemma":0.001353548,"domain_scores_codex":[0.9985443,0.0005870018,0.00007714584,0.0003422688,0.0003145253,0.000134734],"domain_scores_gemma":[0.9954846,0.003490289,0.000309665,0.0002280939,0.0002729666,0.0002144543],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001394148,0.00007641652,0.001042164,0.0005377356,0.0001044288,0.0002176951,0.000314753,0.3798502,0.001867873,0.5464146,0.007827179,0.06160766],"study_design_scores_gemma":[0.00003138777,0.0000481524,0.0003099467,0.0000728727,0.00001789462,0.0001604474,0.00009415465,0.4599878,0.0008117362,0.5321789,0.006269355,0.00001739284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.038631,0.002634366,0.9457058,0.001168124,0.00006302017,0.00006742777,0.0005283472,0.0002085518,0.01099331],"genre_scores_gemma":[0.3851193,0.003387809,0.5987412,0.0002995523,0.0002730977,0.0003882193,0.002038334,0.000362084,0.009390371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004684681,"threshold_uncertainty_score":0.01567185,"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."}}