{"id":"W4255840877","doi":"10.1109/dac.1992.227805","title":"An efficient algorithm for microword length minimization","year":2003,"lang":"en","type":"article","venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Minification; Computer science; Graph; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; 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.0006612125,0.0004306533,0.0003634335,0.0003186098,0.0002191689,0.0003612007,0.0005056009,0.0003022882,0.00006997387],"category_scores_gemma":[0.0002026651,0.0004632706,0.00008729693,0.0003644182,0.00006053518,0.0006017502,0.000014886,0.0002063144,0.00003473665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001638667,"about_ca_system_score_gemma":0.0001138241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004917175,"about_ca_topic_score_gemma":8.808803e-7,"domain_scores_codex":[0.9979576,0.00004171027,0.0005760674,0.0005266775,0.0003324576,0.0005654276],"domain_scores_gemma":[0.9987254,0.000124534,0.000183974,0.000306975,0.0004595254,0.0001995767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005558741,0.0004505148,0.0001233141,0.0007585165,0.0001584311,0.000005065037,0.003955323,0.01795543,0.5652549,0.03195142,0.02253387,0.3567976],"study_design_scores_gemma":[0.0004465546,0.000186862,0.00005137483,0.00007479499,0.0000354827,0.0000153315,0.0001292486,0.7140645,0.2805905,0.002305068,0.001638443,0.0004617618],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009613523,0.00006327283,0.9841794,0.00004018261,0.0003097357,0.00150557,0.00002820484,0.002667896,0.001592188],"genre_scores_gemma":[0.6367944,0.00003341573,0.3624677,0.00005734379,0.00008495991,0.0004104808,0.00003503967,0.00007556303,0.00004107519],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6961091,"threshold_uncertainty_score":0.9997819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03351824797113805,"score_gpt":0.2569164784611113,"score_spread":0.2233982304899733,"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."}}