{"id":"W1968440069","doi":"10.1016/j.comgeo.2015.02.003","title":"Fast algorithms for approximate Fréchet matching queries in geometric trees","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Path (computing); Combinatorics; Matching (statistics); Mathematics; Tree (set theory); Data structure; Algorithm; Line segment; Line (geometry); Computer science; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.001019521,0.0002552098,0.0003157687,0.001690232,0.0001644882,0.0003119145,0.0006397461,0.0001037056,0.000009729718],"category_scores_gemma":[0.0003137663,0.0002696889,0.0001125276,0.003648158,0.00005056338,0.0009629404,0.0002437193,0.0001704249,0.00004628484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001768704,"about_ca_system_score_gemma":0.0003125564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003113901,"about_ca_topic_score_gemma":0.00001248618,"domain_scores_codex":[0.9976245,0.00008559888,0.0005460653,0.0006197957,0.0006936316,0.0004304117],"domain_scores_gemma":[0.998211,0.000646665,0.0001816948,0.0002732342,0.0004730544,0.0002143504],"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.00002561878,0.0001850835,0.001060873,0.00003393998,0.00002708235,0.000009312955,0.0006755627,0.8674642,0.00003257359,0.05760747,0.001547439,0.0713308],"study_design_scores_gemma":[0.00160234,0.0001735074,0.01550892,0.00002606429,0.000007033351,0.00004662197,0.0002058929,0.8087975,0.0002357778,0.1701903,0.002772821,0.0004332143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06724786,0.000554639,0.9297734,0.0006639265,0.0007504547,0.0003790837,0.00002964866,0.0001746483,0.0004262662],"genre_scores_gemma":[0.5710654,0.000005017486,0.4277681,0.0003304999,0.0002331678,0.00009040868,0.0002146981,0.00001791857,0.0002747617],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5038176,"threshold_uncertainty_score":0.9999755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04676608069297396,"score_gpt":0.2937886833154292,"score_spread":0.2470226026224553,"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."}}