{"id":"W2557625822","doi":"","title":"Generalizing contexts amenable to greedy and greedy-like algorithms","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Generality; Greedy randomized adaptive search procedure; Computer science; Simple (philosophy); Set (abstract data type); Theoretical computer science; Algorithm; Approximation algorithm; Mathematical optimization; Mathematics","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.0002326126,0.0004699834,0.0005027825,0.0004201381,0.0003410356,0.0008110651,0.00127238,0.0002481545,0.0001930099],"category_scores_gemma":[0.00002121576,0.000441431,0.0001297433,0.0005620617,0.00004365074,0.0006208369,0.0003588027,0.000341736,0.0002684196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004777315,"about_ca_system_score_gemma":0.00008725224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001991796,"about_ca_topic_score_gemma":0.0008104848,"domain_scores_codex":[0.9973977,0.00005659526,0.0004382068,0.001016486,0.0005037442,0.0005873152],"domain_scores_gemma":[0.9983426,0.00007415638,0.0001611967,0.0008114613,0.0002602061,0.0003503911],"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.00001621559,0.0001383549,0.00008569374,0.0002451283,0.0001849817,0.00006210119,0.004865419,0.00005646927,0.001745904,0.1441413,0.06223702,0.7862214],"study_design_scores_gemma":[0.004374834,0.002177181,0.02166862,0.001882101,0.0002602092,0.0003372933,0.003505881,0.4085774,0.01591805,0.1690983,0.3613942,0.01080591],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2134957,0.009900836,0.6046923,0.003420765,0.02540902,0.005960736,0.00008549805,0.003243806,0.1337914],"genre_scores_gemma":[0.02053095,0.0003644488,0.6720158,0.005549938,0.0009907138,0.0004638972,0.0003784458,0.0001504559,0.2995553],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7754155,"threshold_uncertainty_score":0.9998037,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01941707849487074,"score_gpt":0.2631922035951288,"score_spread":0.2437751251002581,"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."}}