{"id":"W3090961338","doi":"10.20382/jocg.v11i1a16","title":"Faster algorithms for some optimization problems on collinear points","year":2020,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Disjoint sets; Interval (graph theory); Dimension (graph theory); Mathematics; Algorithm; Point (geometry); Running time; Combinatorics; Set (abstract data type); Range (aeronautics); Server; Computer science; Geometry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00302207,0.004484726,0.002857401,0.00242311,0.00157198,0.002939427,0.004430986,0.002962064,0.02771607],"category_scores_gemma":[0.01189776,0.001549477,0.003779702,0.004151711,0.001346139,0.007470639,0.004090338,0.006371242,0.008134671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00254341,"about_ca_system_score_gemma":0.002729026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004992135,"about_ca_topic_score_gemma":0.007750449,"domain_scores_codex":[0.9960572,0.0008489357,0.0002547893,0.00123711,0.0009921732,0.0006097906],"domain_scores_gemma":[0.9929439,0.004117893,0.000462986,0.00128921,0.0009951625,0.0001909184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007913701,0.00087232,0.001930448,0.001676682,0.0003964584,0.0003662594,0.0005597665,0.33223,0.006492047,0.114207,0.04954153,0.4909361],"study_design_scores_gemma":[0.0004044674,0.0001366416,0.0004695718,0.00009684655,0.00008322882,0.0002140748,0.0001433263,0.8236116,0.002103782,0.1559773,0.01671042,0.00004869853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007124652,0.00113095,0.9780291,0.0008150482,0.0002656307,0.0002794917,0.0003447352,0.003441944,0.008568445],"genre_scores_gemma":[0.05674362,0.0005303535,0.9341,0.0005794001,0.0002871909,0.0007843844,0.001363384,0.001032132,0.004579476],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02771607,"threshold_uncertainty_score":0.0927195,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3392202321770481,"score_gpt":0.5231738900159135,"score_spread":0.1839536578388655,"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."}}