{"id":"W3125228316","doi":"","title":"Graph-based many-to-one dynamic ride-matching for shared mobility services in congested networks.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Matching (statistics); Computer science; Blossom algorithm; Map matching; Traffic congestion; Graph; Quality of service; Computational complexity theory; IBM; Algorithm; Computer network; Transport engineering; Engineering; Theoretical computer science; Mathematics; Global Positioning System","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018394,0.0009719289,0.001343815,0.001118926,0.00102634,0.0009858462,0.002492615,0.001368179,0.003666139],"category_scores_gemma":[0.003103296,0.0004555445,0.0009241755,0.001421823,0.0007655786,0.002107803,0.002145703,0.0009061244,0.0005259685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001492591,"about_ca_system_score_gemma":0.001953045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01146402,"about_ca_topic_score_gemma":0.01201676,"domain_scores_codex":[0.9993352,0.0002006338,0.00002880358,0.0001683374,0.0001436055,0.0001233758],"domain_scores_gemma":[0.9988253,0.000605349,0.0001422194,0.000191599,0.0001290548,0.000106541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002351555,0.000192908,0.001320879,0.000153914,0.0001295017,0.00007920033,0.0001159242,0.8473877,0.002196457,0.01519364,0.003392705,0.129602],"study_design_scores_gemma":[0.00002233728,0.00005652115,0.000194573,0.000004903405,0.0000162716,0.00004526149,0.0000412673,0.9898718,0.0007073373,0.007811956,0.001220989,0.000006950241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05197449,0.0004901873,0.9420148,0.0002730704,0.00008002738,0.0002570715,0.0002153169,0.001018794,0.003676339],"genre_scores_gemma":[0.628951,0.0002241644,0.3662906,0.0001465903,0.00003395341,0.0001430948,0.0005772494,0.0001443848,0.003489011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01146402,"threshold_uncertainty_score":0.0227946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03499734852095777,"score_gpt":0.1884377730159951,"score_spread":0.1534404244950374,"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."}}