{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001034622,0.0002983567,0.0005599835,0.0004787278,0.000304369,0.002643094,0.003980346,0.00009528524,0.001523196],"category_scores_gemma":[0.0003370694,0.000269123,0.0001735299,0.001257803,0.00006916178,0.004613572,0.001011546,0.0003038557,0.00003854343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006794897,"about_ca_system_score_gemma":0.0001838091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002653434,"about_ca_topic_score_gemma":0.000001424941,"domain_scores_codex":[0.9970011,0.0002326398,0.0008272397,0.0006647762,0.0008190593,0.0004552171],"domain_scores_gemma":[0.9976423,0.0002634267,0.0006150503,0.0004766149,0.0005459149,0.0004566252],"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.0001889475,0.0004763015,0.002939953,0.0002223135,0.0001723335,0.00001874968,0.0008849457,0.9088444,0.004127555,0.003113996,0.05584848,0.02316205],"study_design_scores_gemma":[0.001400513,0.0001009533,0.00110625,0.0002147498,0.00001869715,0.000004675802,0.00002123381,0.972609,0.006482566,0.004328222,0.01324961,0.0004635716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00169351,0.001009132,0.987937,0.005577142,0.0005166289,0.001773488,0.00005088351,0.00013251,0.001309706],"genre_scores_gemma":[0.2341281,0.01634752,0.7092555,0.03372212,0.00193666,0.001004242,0.0002237214,0.0004220854,0.002960014],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2786815,"threshold_uncertainty_score":0.9999761,"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."}}