{"id":"W3118691141","doi":"10.5539/cis.v14n1p8","title":"An O(nlogn/logw) Time Algorithm for Ridesharing","year":2021,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Vertex (graph theory); Carry (investment); Algorithm; Time complexity; Graph; Theoretical computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001522056,0.00004144308,0.000045343,0.00006898856,0.0001174079,0.0001546405,0.00007669247,0.00001583402,0.00001668345],"category_scores_gemma":[0.000005745329,0.00004312264,0.00001024285,0.0003226812,0.00004650211,0.003179473,0.00000839947,0.0000291639,0.00001590545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001195591,"about_ca_system_score_gemma":0.00003539889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.052e-7,"about_ca_topic_score_gemma":4.033654e-7,"domain_scores_codex":[0.9996071,0.000001425228,0.0001493764,0.00006319498,0.00008442916,0.00009442402],"domain_scores_gemma":[0.9996246,0.0000118611,0.00001287773,0.00009446376,0.0002072162,0.0000489948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.29786e-7,0.00001171637,0.0001518073,0.00003382754,0.000005049497,2.51124e-7,0.001688888,0.01724501,0.003390955,0.01245591,0.0006448155,0.9643711],"study_design_scores_gemma":[0.0001326589,0.00001237146,0.01411872,0.000004525692,0.000001538654,0.000004532908,0.00003468911,0.9676398,0.002948673,0.00009177676,0.0149465,0.00006419668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0418746,0.000006640195,0.9565017,0.0000387202,0.0002110406,0.00007231095,0.00002162372,0.0001266807,0.00114674],"genre_scores_gemma":[0.6903014,0.00001979809,0.3081528,0.001155206,0.00008542022,0.00002501681,0.0002279517,0.000005219852,0.00002724273],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.964307,"threshold_uncertainty_score":0.2305041,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008269374183623461,"score_gpt":0.2328846559954866,"score_spread":0.2246152818118631,"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."}}