{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000500589,0.001586774,0.0009656965,0.001634572,0.001074259,0.00138662,0.001779156,0.001422007,0.01422588],"category_scores_gemma":[0.001889224,0.0006626722,0.0009333912,0.001710692,0.0007017242,0.001946745,0.002010389,0.00140777,0.006757825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007916779,"about_ca_system_score_gemma":0.001409011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001464185,"about_ca_topic_score_gemma":0.002954285,"domain_scores_codex":[0.9992513,0.00009583858,0.00005343385,0.0001729884,0.0003368015,0.00008963647],"domain_scores_gemma":[0.9994129,0.0001919847,0.00004695742,0.000111652,0.0002081227,0.00002843978],"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.0001714181,0.0001032934,0.0003248189,0.0002907367,0.00005399251,0.0001324486,0.0001282712,0.07668924,0.02133562,0.04262288,0.0224576,0.8356898],"study_design_scores_gemma":[0.0002204874,0.0001983663,0.0003809733,0.0000694445,0.00005001919,0.0005177127,0.0001235561,0.8223518,0.02022957,0.09558462,0.06021132,0.00006214958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001733014,0.0001737714,0.9928514,0.0001123924,0.0000779558,0.0001031296,0.000063682,0.001702545,0.003182116],"genre_scores_gemma":[0.02159017,0.0001639472,0.9713719,0.0001056805,0.00004336759,0.0003105125,0.000339011,0.0004068002,0.005668469],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01422588,"threshold_uncertainty_score":0.04759026,"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."}}