{"id":"W2788862636","doi":"10.20382/jocg.v11i1a16","title":"Faster Algorithms for some Optimization Problems on Collinear Points","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Disjoint sets; Interval (graph theory); Dimension (graph theory); Algorithm; Point (geometry); Running time; Range (aeronautics); Set (abstract data type); Server; Computer science; Combinatorics; Mathematics; Geometry; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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"],"consensus_categories":[],"category_scores_codex":[0.0009849828,0.0006796931,0.0006482183,0.0006336852,0.0004954534,0.001188931,0.001577274,0.0004979653,0.00002332833],"category_scores_gemma":[0.0001564121,0.0006526363,0.0004344755,0.0003532164,0.00009058456,0.001593123,0.001063165,0.0005212987,0.0001317372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002581046,"about_ca_system_score_gemma":0.0003053133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003990979,"about_ca_topic_score_gemma":0.000002534531,"domain_scores_codex":[0.9961398,0.00006036137,0.001526618,0.0007250011,0.0007925754,0.0007555907],"domain_scores_gemma":[0.9963216,0.0002403538,0.001003667,0.001113718,0.001082935,0.00023777],"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.0001747154,0.0006347494,0.00004652635,0.001881729,0.0003579699,0.000001992509,0.004212403,0.9400624,0.0000111065,0.01463348,0.01905338,0.01892957],"study_design_scores_gemma":[0.002177673,0.0006141237,0.00002219479,0.0003406363,0.00004262148,0.00001528456,0.00004390466,0.95105,0.0007742441,0.007452339,0.03676285,0.0007041481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004755798,0.00004332661,0.9837262,0.0008822532,0.004439603,0.004057385,0.001266009,0.0002926156,0.000536804],"genre_scores_gemma":[0.02221451,0.00008808738,0.9591185,0.00399011,0.002371731,0.00169398,0.009092504,0.0001288902,0.001301657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02460767,"threshold_uncertainty_score":0.9998479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03458544815699344,"score_gpt":0.2824341130306675,"score_spread":0.2478486648736741,"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."}}