{"id":"W34613702","doi":"10.1021/acs.est.1c04111","title":"Rigorous analysis of heuristics for NP-hard problems.","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Canada First Research Excellence Fund","keywords":"Heuristics; Heuristic; Computer science; Mathematical optimization; Context (archaeology); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005109159,0.0003372488,0.0006436811,0.0006632651,0.0002228726,0.0001507114,0.001437068,0.0001219961,0.00003026283],"category_scores_gemma":[0.00004409564,0.0003077816,0.0006085185,0.001775052,0.0001584533,0.0003534039,0.0002555618,0.0001939795,0.00002309496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007252883,"about_ca_system_score_gemma":0.00006156616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004668645,"about_ca_topic_score_gemma":0.00003445588,"domain_scores_codex":[0.9972779,0.00007908841,0.0006702799,0.0007982643,0.0006004294,0.0005741059],"domain_scores_gemma":[0.9977406,0.0003159761,0.0003003992,0.001207869,0.0002463504,0.0001887626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001722272,0.00215783,0.001284817,0.0003999184,0.006201998,0.0000320114,0.005107417,0.1467533,0.006202212,0.5438637,0.01109202,0.2767326],"study_design_scores_gemma":[0.0008609706,0.0006452689,0.001059309,0.00003713325,0.0005222739,0.000007956627,0.00002190982,0.9466745,0.004022172,0.007211498,0.03834776,0.0005892991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002665422,0.0002722455,0.9883709,0.003523238,0.000576255,0.0006517685,0.0003459124,0.0002709026,0.003323356],"genre_scores_gemma":[0.2894679,0.0002677907,0.7062239,0.001187186,0.0006759789,0.0002422164,0.0001773754,0.00006782897,0.001689817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7999211,"threshold_uncertainty_score":0.9999374,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02351267504006949,"score_gpt":0.2730710835262716,"score_spread":0.2495584084862021,"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."}}