{"id":"W2322966705","doi":"10.20381/ruor-19599","title":"Automatically generated lower bounds for search","year":2004,"lang":"en","type":"dissertation","venue":"uO Research (University of Ottawa)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Heuristic; Computer science; Upper and lower bounds; Simple (philosophy); Travelling salesman problem; Macro; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.0008953473,0.0001518833,0.0002580262,0.0008405631,0.0005684348,0.0001519677,0.001091321,0.0002982099,0.0004237579],"category_scores_gemma":[0.0001291053,0.0001920935,0.0001587746,0.0009546838,0.0001777467,0.0004267321,0.0001173049,0.0004516669,0.00007659014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002879585,"about_ca_system_score_gemma":0.001526025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001051039,"about_ca_topic_score_gemma":0.001437359,"domain_scores_codex":[0.9977837,0.0001540727,0.000181345,0.0004875414,0.0009545336,0.0004387842],"domain_scores_gemma":[0.9975504,0.000193546,0.0001032922,0.0004589469,0.001510537,0.0001832496],"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.00008403073,0.0005590073,0.0006361244,0.00127148,0.0003464857,0.0001477177,0.005769248,0.003210656,0.004265079,0.7979444,0.01763625,0.1681295],"study_design_scores_gemma":[0.008658694,0.002749578,0.08292664,0.001087536,0.0001431228,0.0000326377,0.008644336,0.7622457,0.006372793,0.01788333,0.1069079,0.002347796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04141323,0.00004447487,0.8748633,0.002633473,0.0009152611,0.001747065,0.00008462665,0.0003431715,0.07795537],"genre_scores_gemma":[0.3888195,0.0003275227,0.4330398,0.00007704991,0.0001983222,0.00001184061,0.001934835,0.00009404897,0.1754971],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7800611,"threshold_uncertainty_score":0.7833344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04041851152014229,"score_gpt":0.3164191805298294,"score_spread":0.2760006690096871,"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."}}