{"id":"W4226492525","doi":"10.1109/jiot.2022.3168661","title":"An Efficient and Privacy-Preserving Route Matching Scheme for Carpooling Services","year":2022,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scheme (mathematics); Matching (statistics); Popularity; Computer network; Similarity (geometry); Service (business); Quality of service; Filter (signal processing); The Internet; Blossom algorithm; Computer security; Data mining; World Wide Web; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"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.0007887626,0.0005493781,0.0009679787,0.0008491202,0.001213835,0.001151166,0.001657753,0.001054829,0.002513487],"category_scores_gemma":[0.003633326,0.0002485318,0.0008710452,0.002054389,0.000674898,0.003030156,0.00235227,0.001188444,0.0008952296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001134687,"about_ca_system_score_gemma":0.001704409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001939211,"about_ca_topic_score_gemma":0.001367814,"domain_scores_codex":[0.9976761,0.0005099876,0.0001854967,0.0004885002,0.0007654208,0.0003744456],"domain_scores_gemma":[0.9983842,0.0002490984,0.000216294,0.0007410863,0.0003199835,0.00008933612],"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":[0.001821172,0.000363138,0.002289328,0.0005307536,0.0001982835,0.0008381722,0.0008768382,0.2183046,0.07316385,0.2064235,0.01424154,0.4809489],"study_design_scores_gemma":[0.000179817,0.0004796706,0.0008270665,0.0000309793,0.00008941207,0.001537885,0.0002699756,0.8958998,0.03661851,0.04323377,0.02069377,0.0001393955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05970965,0.0004259381,0.9321743,0.0002692873,0.0001170134,0.0002241554,0.0002939224,0.001090599,0.005695126],"genre_scores_gemma":[0.8561918,0.0003097079,0.1377024,0.000139344,0.00005694215,0.0001495743,0.0004382739,0.00005752849,0.004954433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002513487,"threshold_uncertainty_score":0.008408487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01058857831365278,"score_gpt":0.2466205070306579,"score_spread":0.2360319287170051,"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."}}