{"id":"W2487095096","doi":"10.1007/978-3-319-40578-0_22","title":"A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; University of New Brunswick","funders":"","keywords":"Computer science; Transformation (genetics); Algorithm; Representation (politics); Function (biology); State (computer science); Theoretical computer science","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.001098406,0.0006782648,0.0006967651,0.001114389,0.0004867389,0.0004874067,0.003207892,0.0003919666,0.00001758661],"category_scores_gemma":[0.00008451519,0.000525733,0.0003289637,0.0005779642,0.0004677585,0.0005091864,0.0004254672,0.0005462734,0.00003662688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002885794,"about_ca_system_score_gemma":0.0006458007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006532534,"about_ca_topic_score_gemma":0.000007717012,"domain_scores_codex":[0.995885,0.00005055153,0.0006210087,0.001603207,0.0008943221,0.0009459814],"domain_scores_gemma":[0.9965683,0.001370515,0.0003348919,0.001211687,0.0002957088,0.0002188538],"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.000003113235,0.00002103674,6.946905e-7,0.00005682277,0.00001020442,0.00001315006,0.0002776257,0.01380522,0.0000475554,0.01015928,0.00001702388,0.9755883],"study_design_scores_gemma":[0.0003719085,0.0001876046,0.000006690653,0.000735255,0.00001332397,0.00004196852,1.173241e-7,0.8761871,0.001766587,0.1177719,0.002258703,0.0006587629],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000006761783,0.0002439837,0.9922932,0.003351471,0.001454762,0.0007612071,0.00005363307,0.0003065706,0.001528347],"genre_scores_gemma":[0.004352912,0.00002629693,0.9926435,0.001960478,0.000677504,0.00004561765,0.000006428951,0.00005057544,0.0002366254],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9749295,"threshold_uncertainty_score":0.9997194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01412225893105541,"score_gpt":0.2322448805862181,"score_spread":0.2181226216551627,"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."}}