{"id":"W4396661433","doi":"10.1007/s00182-024-00896-1","title":"Stable source connection and assignment problems as multi-period shortest path problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Period (music); Connection (principal bundle); Shortest path problem; Path (computing); Constrained Shortest Path First; Mathematics; Computer science; K shortest path routing; Mathematical optimization; Combinatorics; Computer network; Physics; Graph; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.001142998,0.0001361019,0.0001581417,0.000273465,0.00006366226,0.000619324,0.0006889273,0.00004588797,0.00007410142],"category_scores_gemma":[0.00007579373,0.000111679,0.000106792,0.0001531385,0.00009915161,0.0007356194,0.0002055218,0.0003071181,0.0000200842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001058556,"about_ca_system_score_gemma":0.0001135314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001532033,"about_ca_topic_score_gemma":0.000004078963,"domain_scores_codex":[0.9985356,0.0001158206,0.0003989916,0.0002287862,0.0005539177,0.0001668845],"domain_scores_gemma":[0.9991469,0.0002017324,0.0001685429,0.000137049,0.0002443975,0.0001013278],"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.00008098283,0.0005104062,0.00064809,0.00006233797,0.0007175616,0.0004624044,0.01005099,0.007526119,0.006404271,0.520007,0.0004767576,0.4530531],"study_design_scores_gemma":[0.001480652,0.0009629507,0.001324026,0.001468932,0.00005490681,0.006060591,0.0007410685,0.3107239,0.002118664,0.5992131,0.0753188,0.0005323756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02085162,0.002389633,0.97205,0.00151893,0.002097455,0.0001212092,0.000005873672,0.00008104964,0.0008842268],"genre_scores_gemma":[0.9910617,0.0001845013,0.00738554,0.0001840183,0.0002896278,0.000006829812,0.000001585714,0.00001302728,0.0008731395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9702101,"threshold_uncertainty_score":0.5972155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02003350954797259,"score_gpt":0.2676365030996414,"score_spread":0.2476029935516688,"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."}}