{"id":"W2132833274","doi":"10.1109/ismvl.2009.19","title":"Equivalence Checking of Reversible Circuits","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Universität Bremen; Deutscher Akademischer Austauschdienst","keywords":"Formal equivalence checking; Electronic circuit; Equivalence (formal languages); Computer science; Boolean function; Boolean satisfiability problem; Logical equivalence; Boolean circuit; Logic gate; Adder; Sequential logic; Algorithm; Arithmetic; Theoretical computer science; Mathematics; Formal verification; Discrete 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":[],"consensus_categories":[],"category_scores_codex":[0.0001689865,0.00007129382,0.0001073202,0.00006616237,0.00005436994,0.00003226813,0.0006635188,0.00002557939,0.00001101486],"category_scores_gemma":[0.00002042476,0.00005986241,0.00004942144,0.0003485974,0.00001707099,0.0001345503,0.0001000828,0.00008079837,0.000009689309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007336433,"about_ca_system_score_gemma":0.00002874292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006673217,"about_ca_topic_score_gemma":2.151162e-7,"domain_scores_codex":[0.999272,0.00001726181,0.0001382529,0.0002077417,0.0001781669,0.0001865308],"domain_scores_gemma":[0.9994767,0.00003572156,0.00005792986,0.0003411442,0.00004155801,0.00004694583],"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":[8.384138e-7,0.00007025651,0.0002042408,0.00001790824,0.000006563499,0.00001486588,0.0007662742,0.003875373,0.01358811,0.1200695,0.0007422391,0.8606439],"study_design_scores_gemma":[0.0003370526,0.0003496072,0.01074916,0.0001325511,0.000004028819,0.00005540895,0.00001788952,0.9024166,0.04722127,0.03698105,0.001414003,0.0003213311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06426086,0.0001183068,0.9183967,0.001120688,0.00016184,0.0000512651,2.840001e-7,0.0001794606,0.01571056],"genre_scores_gemma":[0.9276255,0.000004376197,0.07172881,0.0003586383,0.00003689103,1.738605e-7,1.3703e-7,0.000001751671,0.0002437095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8985413,"threshold_uncertainty_score":0.2441118,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01622098803924106,"score_gpt":0.2457504481682966,"score_spread":0.2295294601290556,"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."}}