{"id":"W2171769876","doi":"10.1017/s0963548309990204","title":"The Longest Minimum-Weight Path in a Complete Graph","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Minimum weight; Path (computing); Path length; Random graph; Discrete mathematics; Computer science","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.000317399,0.0002546784,0.0003220632,0.0006040657,0.0008006701,0.0007737896,0.0006704457,0.0006801138,0.002453385],"category_scores_gemma":[0.004590319,0.0002094006,0.0002335535,0.0007568399,0.000825471,0.002311307,0.0008284047,0.0005817184,0.0002608185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004779372,"about_ca_system_score_gemma":0.0004871364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006500859,"about_ca_topic_score_gemma":0.0008205942,"domain_scores_codex":[0.9997664,0.00005248859,0.000008105775,0.00006783944,0.00005313664,0.00005202348],"domain_scores_gemma":[0.9984327,0.0008233303,0.0003170135,0.0001173337,0.0001284455,0.0001812744],"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.0006346507,0.0001175614,0.008505217,0.0006753466,0.0001049154,0.001052767,0.0006567642,0.1545141,0.0196833,0.7458602,0.009074884,0.05912024],"study_design_scores_gemma":[0.00005911971,0.0001373409,0.003312541,0.00004858609,0.00003188852,0.0006965821,0.0002973051,0.2164758,0.004717115,0.7657368,0.008448993,0.00003788893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.862172,0.0007528152,0.1227653,0.0013832,0.0000516004,0.0000377839,0.0008848447,0.0001689421,0.01178351],"genre_scores_gemma":[0.9584022,0.0005547088,0.03720811,0.0001086096,0.00006412953,0.00005327518,0.0005516275,0.00004839957,0.003008863],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002453385,"threshold_uncertainty_score":0.008207381,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02440755301033561,"score_gpt":0.2437544791994999,"score_spread":0.2193469261891643,"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."}}