{"id":"W7110382014","doi":"10.4230/lipics.itcs.2025.20","title":"Estimating Euclidean Distance to Linearity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Estimator; Function (biology); Oracle; Euclidean distance; Linearity; Upper and lower bounds; Euclidean geometry","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005495004,0.001051346,0.00182296,0.001403118,0.0006589125,0.002483184,0.002708015,0.001586088,0.003636987],"category_scores_gemma":[0.06801004,0.0006316195,0.0009560193,0.001642021,0.002447145,0.006681234,0.004411131,0.003480908,0.001171043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002574244,"about_ca_system_score_gemma":0.00147286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002553095,"about_ca_topic_score_gemma":0.001778243,"domain_scores_codex":[0.993343,0.002804081,0.0003883744,0.001534368,0.001315628,0.0006145316],"domain_scores_gemma":[0.9539315,0.0359708,0.002003873,0.004662048,0.002551445,0.0008803474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002107397,0.0003154131,0.01689957,0.0007409436,0.0002804399,0.0002307161,0.0005298948,0.5765693,0.007141539,0.2123634,0.01292157,0.1698997],"study_design_scores_gemma":[0.00003849254,0.0001564942,0.001774324,0.00005550756,0.00002544289,0.0001370504,0.00009841384,0.8714163,0.003398841,0.1212086,0.001647885,0.00004267348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1267462,0.002274878,0.8607566,0.002309125,0.0001372175,0.0001020885,0.0007534807,0.000823668,0.006096708],"genre_scores_gemma":[0.8394385,0.0009965017,0.1526889,0.0005382012,0.0003401885,0.0002662483,0.001799928,0.0002187932,0.00371261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005495004,"threshold_uncertainty_score":0.02906066,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01426574667479549,"score_gpt":0.2872968292728679,"score_spread":0.2730310825980724,"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."}}