{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002074556,0.0003184458,0.0004219882,0.0004154107,0.00007709393,0.00007435917,0.0004054901,0.000322453,0.0000698713],"category_scores_gemma":[0.000009755491,0.0004604154,0.00019757,0.0009897515,0.00003833055,0.0001798199,0.00007371684,0.0005020346,0.000004485885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000275855,"about_ca_system_score_gemma":0.00008683205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003087786,"about_ca_topic_score_gemma":0.009261941,"domain_scores_codex":[0.998456,0.00004146781,0.0003888524,0.0007050617,0.00006133101,0.0003472916],"domain_scores_gemma":[0.9987884,0.0001220393,0.00008818086,0.0006549681,0.0002201783,0.0001261896],"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.00004617478,0.0001163697,0.004664718,0.0008012436,0.00009713771,0.0000237668,0.0002786577,0.9922023,0.0001883634,0.00147487,0.000007069121,0.00009927908],"study_design_scores_gemma":[0.0008949385,0.0000159069,0.08304908,0.0003739382,0.0001012996,2.217606e-7,0.0004130293,0.9126201,0.00006565053,0.001957836,0.00004888509,0.0004591185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5848765,0.00003567104,0.4135827,0.00003334,0.0002627051,0.0006729356,0.0001890986,0.0002791236,0.00006788305],"genre_scores_gemma":[0.9966306,0.0000402251,0.001487821,0.0001209211,0.00001842913,0.00002914315,0.001586309,0.00004568438,0.00004087597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4120949,"threshold_uncertainty_score":0.9997848,"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."}}