{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001355544,0.0009868462,0.0005867243,0.001763552,0.0003281882,0.001216043,0.001441758,0.0008527556,0.003255481],"category_scores_gemma":[0.009695145,0.000585083,0.001189744,0.001372822,0.0006758032,0.002062957,0.0007429562,0.0008777066,0.0004009972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000875917,"about_ca_system_score_gemma":0.001075107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001858034,"about_ca_topic_score_gemma":0.003423613,"domain_scores_codex":[0.9985257,0.000651982,0.00008535255,0.0001836911,0.000468747,0.00008454526],"domain_scores_gemma":[0.9950396,0.003858292,0.0004131382,0.0002857416,0.0003631228,0.00004009426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009844764,0.00005462192,0.001373481,0.0002929555,0.00006399124,0.0001675141,0.00007304719,0.8739997,0.006908237,0.0336129,0.001046662,0.08230844],"study_design_scores_gemma":[0.00001201652,0.00001757095,0.0001138254,0.00001467894,0.000007869826,0.00003986011,0.0000104477,0.9812403,0.002567977,0.01558995,0.0003800886,0.00000546645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01109918,0.00009078238,0.9868302,0.0001155498,0.000009957974,0.00005212413,0.0001837279,0.000423918,0.001194581],"genre_scores_gemma":[0.4714576,0.0003669736,0.5257931,0.0001081138,0.00004193291,0.0002613013,0.0008779069,0.0001659471,0.0009270427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003255481,"threshold_uncertainty_score":0.01089066,"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."}}