{"id":"W2577580961","doi":"10.1142/s0129054112400023","title":"ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Boolean function; Computer science; And-inverter graph; Boolean circuit; Product term; Transient (computer programming); Boolean expression; Mathematics; Theoretical computer science; Calculus (dental); Algorithm; Two-element Boolean algebra; Algebra over a field; Programming language; Medicine; Pure mathematics","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.004678572,0.0001178463,0.0002497642,0.0004371788,0.000172934,0.00005437927,0.003342021,0.00002854976,0.00004663583],"category_scores_gemma":[0.0007760449,0.00007373867,0.0002681073,0.001076159,0.001747386,0.0009112951,0.0004736746,0.0001837517,0.000001914795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001528968,"about_ca_system_score_gemma":0.000739845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003115675,"about_ca_topic_score_gemma":0.00000901519,"domain_scores_codex":[0.9953925,0.0002923447,0.001019902,0.0001820267,0.002937044,0.0001761894],"domain_scores_gemma":[0.9910827,0.0007714585,0.00137168,0.000719115,0.005978332,0.00007673817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005746668,0.002967491,0.004242052,0.00002654748,0.0002775398,7.311705e-7,0.005334788,0.1335411,0.0172422,0.6977024,0.0007270048,0.1378807],"study_design_scores_gemma":[0.0007971698,0.0004323221,0.4261676,0.0002422822,0.00008325328,0.0001067678,0.0001274187,0.4981849,0.01772023,0.05576346,0.0002247548,0.0001498677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4040275,0.00003860218,0.5897951,0.002729405,0.002971135,0.000165587,0.00001193062,0.000004277823,0.0002565634],"genre_scores_gemma":[0.9595082,0.000003559449,0.04029555,0.0000707013,0.0001120259,0.00000224411,7.957451e-7,0.000003202597,0.000003746025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.641939,"threshold_uncertainty_score":0.6438317,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1291512989180462,"score_gpt":0.3521225510733017,"score_spread":0.2229712521552555,"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."}}