{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007668147,0.0005758493,0.0005252616,0.0010571,0.0005994911,0.0008752065,0.003576297,0.0003094902,0.00005389275],"category_scores_gemma":[0.00004498759,0.0005576965,0.000128835,0.0009930789,0.0009172258,0.001479194,0.001616837,0.001003582,0.00002962575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001524514,"about_ca_system_score_gemma":0.000367024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004867678,"about_ca_topic_score_gemma":0.0002827862,"domain_scores_codex":[0.9962124,0.00003307702,0.000594129,0.001401162,0.001006067,0.0007531159],"domain_scores_gemma":[0.9975208,0.0004078298,0.000192938,0.001349366,0.0002773872,0.0002516621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001577486,0.00002198274,0.0000106881,0.00003605964,0.00001158665,0.00002951598,0.001163113,0.006376626,0.00001372481,0.0328633,0.00003453312,0.9594373],"study_design_scores_gemma":[0.0002695374,0.00009674393,0.0000931173,0.0002411798,0.000008350963,0.0001541041,3.389173e-7,0.7684569,0.00009711829,0.2190974,0.01083408,0.0006511832],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002760617,0.001165801,0.9881634,0.002188393,0.001356108,0.0003717443,0.00001262016,0.000242221,0.00647212],"genre_scores_gemma":[0.007883485,0.0003682924,0.988533,0.001913987,0.0006343077,0.00001392264,0.000008554573,0.00003770244,0.0006067889],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9587861,"threshold_uncertainty_score":0.9996874,"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."}}