{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003054033,0.0009190272,0.001233598,0.001497683,0.002042425,0.002152622,0.002566084,0.002164199,0.01016636],"category_scores_gemma":[0.01779126,0.0005290995,0.001189679,0.002536924,0.003123763,0.009223592,0.003086969,0.003629244,0.00133962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001915533,"about_ca_system_score_gemma":0.001117562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001224492,"about_ca_topic_score_gemma":0.0008619193,"domain_scores_codex":[0.9962361,0.001926924,0.0001213138,0.0007336675,0.000652027,0.0003300885],"domain_scores_gemma":[0.9894499,0.008148342,0.0007477553,0.0007060867,0.0005180422,0.0004297256],"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.00003251808,0.00003377677,0.0001176788,0.00009189766,0.00001426766,0.00005896524,0.00009778314,0.01324275,0.0001819253,0.9731559,0.002677313,0.0102953],"study_design_scores_gemma":[0.00001985962,0.00001789254,0.00005391602,0.00001498734,0.000005156779,0.00006269757,0.00003471197,0.02951582,0.0001563809,0.9663603,0.003749557,0.000008901393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06921273,0.002912615,0.8623867,0.006590236,0.0004872667,0.0001724662,0.0004249149,0.000347087,0.05746599],"genre_scores_gemma":[0.760052,0.005166281,0.1927963,0.001498809,0.001671655,0.0007165945,0.0008819468,0.0003175084,0.0368989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01016636,"threshold_uncertainty_score":0.03400981,"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."}}