{"id":"W4399656344","doi":"","title":"An Optimal Transport Based hr-Adaptive Mesh Pursuit","year":2024,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004455534,0.0002553254,0.000232227,0.0002324126,0.0002864756,0.0006565123,0.002305924,0.0001259733,0.00008029109],"category_scores_gemma":[0.0001777684,0.0002608385,0.0001438936,0.0008872558,0.0001579008,0.0007615067,0.0001659753,0.0003577615,0.0001204911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009032095,"about_ca_system_score_gemma":0.0003791406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001767085,"about_ca_topic_score_gemma":0.00005321268,"domain_scores_codex":[0.9957763,0.001952191,0.0003602233,0.0008695914,0.0006019352,0.000439754],"domain_scores_gemma":[0.9961757,0.000899207,0.0001040003,0.00185437,0.0006922811,0.0002744413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003035439,0.00133479,0.001221717,0.0001474937,0.0001640357,0.0004126116,0.03329249,0.00905893,0.008880178,0.5967432,0.002961101,0.345753],"study_design_scores_gemma":[0.00026401,0.000001989661,0.00228485,0.000484906,0.00001888787,0.00002548509,0.00005212285,0.9695176,0.02101876,0.0006615077,0.005340748,0.0003291219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006875451,0.0004559045,0.9699072,0.007228996,0.0003178694,0.0002210675,0.00002303568,0.001000954,0.01396951],"genre_scores_gemma":[0.4980041,0.00001512655,0.5000562,0.00012523,0.00002218439,0.00002947366,0.00006887467,0.00002600198,0.001652812],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9604587,"threshold_uncertainty_score":0.9999844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01517801138184895,"score_gpt":0.2359621721930726,"score_spread":0.2207841608112236,"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."}}