{"id":"W2256871140","doi":"10.20382/jocg.v7i2a4","title":"Approximability of the discrete Fréchet distance","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Eidgenössische Technische Hochschule Zürich; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Measure (data warehouse); Approximation algorithm; Binary logarithm; Discrete mathematics; Simple (philosophy); Mathematical analysis","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.0006545862,0.0001217928,0.0002394055,0.0004654579,0.0001054335,0.00004913982,0.001055737,0.00005455432,0.000007715868],"category_scores_gemma":[0.0002183445,0.00009840698,0.0002211959,0.002226523,0.0001223243,0.0007875535,0.000250355,0.0002073877,0.000002863857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000183018,"about_ca_system_score_gemma":0.0006110272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000597918,"about_ca_topic_score_gemma":0.000001725835,"domain_scores_codex":[0.9981611,0.0002061893,0.0004145821,0.0001830197,0.0008931685,0.0001419316],"domain_scores_gemma":[0.997393,0.0002701398,0.0006638544,0.0002544617,0.001258871,0.0001596741],"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.0001160252,0.0002205803,0.006430543,0.00003013564,0.0001039642,0.00002442507,0.0005023521,0.7924734,0.0001255667,0.1922849,0.001784765,0.005903345],"study_design_scores_gemma":[0.008593085,0.001444186,0.1705858,0.0002721777,0.000221469,0.0006262056,0.001332406,0.3689133,0.005248699,0.2725361,0.1690494,0.001177246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1969662,0.0001130429,0.7996563,0.000950933,0.0005677455,0.00008194824,0.000008386081,0.00001276432,0.001642692],"genre_scores_gemma":[0.9558402,0.000004390465,0.04350537,0.00009047194,0.0000979016,1.011402e-7,0.000003359649,0.00000427876,0.0004539658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7588739,"threshold_uncertainty_score":0.401292,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01683478104820771,"score_gpt":0.2177033301373702,"score_spread":0.2008685490891625,"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."}}