{"id":"W2112263237","doi":"10.1007/978-3-540-31833-0_17","title":"Order-Preserving Transformations and Greedy-Like Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Greedy algorithm; Mathematical proof; Scheduling (production processes); Mathematical optimization; Graph; Class (philosophy); Set (abstract data type); Expressive power; Dominating set; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language","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.0009425612,0.0009362127,0.0009797259,0.001101055,0.001116078,0.0022465,0.001797863,0.001245821,0.007370199],"category_scores_gemma":[0.004685855,0.0005959816,0.001307797,0.003017289,0.002320681,0.004601984,0.002108942,0.003945746,0.002126256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001184376,"about_ca_system_score_gemma":0.0009497535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007680027,"about_ca_topic_score_gemma":0.0008912795,"domain_scores_codex":[0.998833,0.0003355517,0.00006051183,0.0002314639,0.000390568,0.00014898],"domain_scores_gemma":[0.9979101,0.001027843,0.0001191075,0.0006633726,0.0001719944,0.0001076324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007905455,0.00007016763,0.0001098087,0.00008374546,0.00001606152,0.00003705276,0.0000950765,0.01462272,0.001587681,0.9026818,0.006863629,0.0737533],"study_design_scores_gemma":[0.00001938703,0.00001761966,0.00004314795,0.000006959728,0.000007519543,0.00005973811,0.00001878951,0.02266952,0.001296796,0.9700118,0.005840518,0.00000822417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02386522,0.0008825822,0.9130878,0.001271576,0.0003016736,0.0001041284,0.0002076849,0.001604915,0.05867439],"genre_scores_gemma":[0.4365843,0.00228346,0.4948179,0.001017105,0.0004886628,0.0003231472,0.0009800917,0.001138215,0.06236719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007370199,"threshold_uncertainty_score":0.02465576,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02120697823112742,"score_gpt":0.2448936070377454,"score_spread":0.223686628806618,"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."}}