{"id":"W2024091095","doi":"10.1016/s0022-0000(02)00025-9","title":"Uniform constant-depth threshold circuits for division and iterated multiplication","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"McGill University; Clay Mathematics Institute; National Science Foundation","keywords":"Modulo; Mathematics; Division (mathematics); Iterated function; Constant (computer programming); Natural number; Discrete mathematics; Electronic circuit; Integer (computer science); Multiplication (music); Boolean circuit; Arithmetic; Combinatorics; Computer science; Boolean function; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914873,0.0001046333,0.0002256893,0.0002161639,0.0003881367,0.0005581173,0.0004990753,0.00003552662,9.472484e-7],"category_scores_gemma":[0.000008669896,0.00007362403,0.00005629994,0.0003437554,0.0001642057,0.000810154,0.0001109072,0.00007633182,7.189815e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001573697,"about_ca_system_score_gemma":0.00002157783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001804469,"about_ca_topic_score_gemma":0.000001224665,"domain_scores_codex":[0.9988495,0.00004002357,0.0003998831,0.000222881,0.0003117988,0.000175911],"domain_scores_gemma":[0.9990744,0.0002037423,0.0002828408,0.0001274508,0.0001988549,0.0001127005],"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.000007158492,0.0001287031,0.006900843,0.0002247276,0.00005094271,0.00002503931,0.003475251,0.0005426259,0.0004960784,0.2820128,0.00131459,0.7048212],"study_design_scores_gemma":[0.0005702378,0.000491962,0.003392911,0.0002155383,0.000006033307,0.0005443707,0.0001126809,0.9912161,0.00008304785,0.002688256,0.0005562807,0.0001225872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08157626,0.001168761,0.9152676,0.0004500789,0.0006190644,0.0001663752,0.000002374035,0.00003130347,0.000718196],"genre_scores_gemma":[0.9584338,0.00005508608,0.0413131,0.00007408614,0.0001083978,0.000001584766,1.405819e-7,0.000002229017,0.00001155464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9906735,"threshold_uncertainty_score":0.5381938,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05525673498615786,"score_gpt":0.2671099806480158,"score_spread":0.211853245661858,"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."}}