{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021094,0.001216917,0.001863454,0.001101888,0.001295492,0.004245271,0.003155738,0.003343582,0.01109246],"category_scores_gemma":[0.008964079,0.001043048,0.001475005,0.003100805,0.001643205,0.007257443,0.00213523,0.002928,0.0007476421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002231751,"about_ca_system_score_gemma":0.002037509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001578789,"about_ca_topic_score_gemma":0.002225404,"domain_scores_codex":[0.9980228,0.000986791,0.00008397775,0.0004265318,0.0002577055,0.0002222592],"domain_scores_gemma":[0.9940507,0.004310296,0.0006490262,0.0002550963,0.0002714652,0.000463377],"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.0005558111,0.0002953659,0.000801053,0.0005831451,0.0001830383,0.000379305,0.0004631494,0.3681591,0.001750949,0.5871586,0.01144572,0.02822479],"study_design_scores_gemma":[0.0001408206,0.00008367158,0.0003045494,0.00003482709,0.00005671636,0.0001500246,0.0001934098,0.5320647,0.0004934965,0.4620604,0.004385223,0.00003218775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1417732,0.001298693,0.8194895,0.003231189,0.0003491395,0.0004481355,0.001164327,0.0002600482,0.0319858],"genre_scores_gemma":[0.7776112,0.001963712,0.1792197,0.0004652864,0.0005558361,0.0008157104,0.001010264,0.0002658196,0.03809249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01109246,"threshold_uncertainty_score":0.03710794,"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."}}