{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007112267,0.0003687884,0.0004451065,0.0003735272,0.0006552172,0.0008200576,0.002148589,0.0001425919,0.00001349801],"category_scores_gemma":[0.0002939459,0.0003599983,0.0002498909,0.00105879,0.0001077822,0.001332405,0.001118619,0.0004392645,0.0001127168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001282833,"about_ca_system_score_gemma":0.0001118941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002484059,"about_ca_topic_score_gemma":0.00003801803,"domain_scores_codex":[0.9972829,0.00003470862,0.001052449,0.0004003671,0.0004382295,0.0007913749],"domain_scores_gemma":[0.9977694,0.0002466383,0.0002455776,0.001195943,0.0003042399,0.0002381563],"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.0001053239,0.0006655566,0.006883673,0.001435838,0.0002650571,0.00001413616,0.01214087,0.003139846,0.00004619152,0.6854836,0.03026023,0.2595597],"study_design_scores_gemma":[0.001299208,0.0001447448,0.001243173,0.0003797073,0.00001908455,0.00001550494,0.0002276877,0.8106537,0.0005036595,0.02178705,0.1631586,0.0005678849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0125234,0.00003260351,0.9744439,0.001385042,0.002546366,0.0008497359,0.0001751353,0.0004157411,0.007628088],"genre_scores_gemma":[0.2107223,0.000004851532,0.7835771,0.00436827,0.0001898231,0.000138693,0.00009128804,0.0000234421,0.0008842053],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8075138,"threshold_uncertainty_score":0.9998852,"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."}}