{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002246063,0.0003491457,0.0004106681,0.0001870335,0.0009504557,0.0004695179,0.00280199,0.0001173481,0.00000172469],"category_scores_gemma":[0.0003059627,0.0002901315,0.000202605,0.002303716,0.0002428312,0.0003494132,0.0007246254,0.0006932379,0.0000151814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002075263,"about_ca_system_score_gemma":0.0001204874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002770102,"about_ca_topic_score_gemma":0.00002173028,"domain_scores_codex":[0.9964102,0.0003975267,0.0007918956,0.0008973997,0.0006011944,0.0009017753],"domain_scores_gemma":[0.9967558,0.001030186,0.0002395164,0.001558799,0.0002364964,0.0001792086],"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.000007692336,0.0004630509,0.004983129,0.00002219167,0.000009096324,0.00002790634,0.0007356117,0.0001766856,0.00003017929,0.921967,0.0002129816,0.07136448],"study_design_scores_gemma":[0.0006007744,0.0002111236,0.04206638,0.00005822043,0.000003323604,0.00002055013,0.00002198922,0.1251302,0.0000421412,0.829596,0.001900916,0.0003484185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5785875,0.002753932,0.3899153,0.01281734,0.004959644,0.002165731,0.000006639351,0.001375096,0.007418769],"genre_scores_gemma":[0.9853785,0.00003303635,0.01414649,0.0003219849,0.00007809728,0.000008511158,0.000002798863,0.00001062612,0.00001996764],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.406791,"threshold_uncertainty_score":0.9999551,"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."}}