{"id":"W2306909249","doi":"10.46298/dmtcs.3504","title":"Random assignment and shortest path problems","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Shortest path problem; Mathematical proof; Path (computing); Discrete mathematics; Random assignment; Random graph; Assignment problem; Limit (mathematics); Similarity (geometry); Distance; Graph; Computer science; Statistics; Artificial intelligence","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.00207682,0.0003399682,0.0004672066,0.0001365382,0.0007500113,0.0003510496,0.0007642848,0.00008884691,0.00009642481],"category_scores_gemma":[0.0002072655,0.0002271764,0.0001158323,0.0003812327,0.003733162,0.0002044429,0.0007415911,0.0002292899,0.000006503667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003461388,"about_ca_system_score_gemma":0.00003472971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002421551,"about_ca_topic_score_gemma":8.821871e-7,"domain_scores_codex":[0.9971721,0.0000926717,0.000600755,0.0006068358,0.0008947461,0.0006328764],"domain_scores_gemma":[0.9978398,0.0009373386,0.0001672965,0.0007201948,0.0001197923,0.0002155925],"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.000008606218,0.0001017018,0.00009480739,0.00007413208,0.00001123845,0.000007446935,0.0009927503,0.00003599187,0.0003863134,0.997557,0.0001146104,0.0006153925],"study_design_scores_gemma":[0.0004979696,0.0001020128,0.000140496,0.0001138012,0.00004237883,0.00005744948,0.00005713518,0.1029215,0.0005313383,0.8951789,0.00005231874,0.0003048041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1561515,0.00006890779,0.8257167,0.0002062586,0.0002622493,0.0005935492,0.00001004343,0.0001672494,0.01682354],"genre_scores_gemma":[0.812032,0.000005874253,0.1876693,0.00007771711,0.0001328761,0.00002039459,0.000001756442,0.00002654114,0.00003351626],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6558805,"threshold_uncertainty_score":0.9989781,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01297576128991755,"score_gpt":0.2549273767669025,"score_spread":0.2419516154769849,"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."}}