{"id":"W2013085877","doi":"10.1109/tcad.2011.2169259","title":"Maximum Circuit Activity Estimation Using Pseudo-Boolean Satisfiability","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Boolean satisfiability problem; Computer science; Satisfiability; Combinational logic; Scalability; Robustness (evolution); Algorithm; Formal equivalence checking; Electronic circuit; Boolean circuit; Integrated circuit; Equivalence (formal languages); Grid; Boolean function; Computer engineering; Logic gate; Formal verification; Mathematics; Electrical engineering; Engineering","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.002074075,0.0003668474,0.0005467757,0.0003972069,0.0002986816,0.0002200083,0.0005111218,0.0002430829,0.000007950123],"category_scores_gemma":[0.00002967775,0.0003392818,0.0001204225,0.0007672598,0.0001335402,0.001512485,0.000005881644,0.000398818,0.00001188007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000300379,"about_ca_system_score_gemma":0.0001539264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003537755,"about_ca_topic_score_gemma":0.000001393468,"domain_scores_codex":[0.9966498,0.001079789,0.0007492802,0.0005563602,0.0004852533,0.0004795251],"domain_scores_gemma":[0.9977249,0.0004307838,0.0004335622,0.0008632321,0.0003118975,0.0002356272],"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.00003378372,0.0005880871,0.0001111418,0.0002473752,0.000137145,0.000002494561,0.001456996,0.3026851,0.04592163,0.009018342,0.00002596117,0.6397719],"study_design_scores_gemma":[0.0003518561,0.0002990659,0.0006026258,0.0001749838,0.00003929226,0.0001330899,0.00005181252,0.9653369,0.03217084,0.0005020806,0.00001333855,0.0003241352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06588949,0.00007931843,0.930415,0.00001095449,0.002488734,0.0007956902,0.00002001893,0.0002377103,0.00006308391],"genre_scores_gemma":[0.8198817,0.0000116843,0.1799513,0.00002054781,0.00005839562,0.0000393716,0.000001396851,0.00002189032,0.00001378082],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7539922,"threshold_uncertainty_score":0.9999059,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08674072348592853,"score_gpt":0.289699180289201,"score_spread":0.2029584568032725,"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."}}