{"id":"W2916420924","doi":"10.4230/lipics.icalp.2019.78","title":"Towards Optimal Depth Reductions for Syntactically Multilinear Circuits","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Department of Science and Technology, Ministry of Science and Technology, India; Tata Institute of Fundamental Research","keywords":"Exponent; Multilinear map; Combinatorics; Upper and lower bounds; Omega; Mathematics; Degree (music); Polynomial; Discrete mathematics; Mathematical analysis; Physics; Pure mathematics; Quantum mechanics","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001026529,0.0009736713,0.001175796,0.0006354577,0.0006592686,0.001505039,0.004038143,0.0008806888,0.00002941238],"category_scores_gemma":[0.0004059853,0.0009753435,0.001210435,0.0004236419,0.0002572425,0.00169988,0.003146928,0.001643554,0.0001504604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003187002,"about_ca_system_score_gemma":0.000732039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003571159,"about_ca_topic_score_gemma":0.00001638556,"domain_scores_codex":[0.9946288,0.00006697222,0.001978479,0.001003523,0.0009123511,0.001409906],"domain_scores_gemma":[0.9944884,0.0004309257,0.0009805465,0.002628949,0.001042117,0.0004291061],"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.0005756281,0.004842426,0.001121941,0.01895118,0.004657675,0.00003758767,0.03979541,0.0471365,0.0001609879,0.2957892,0.04438608,0.5425454],"study_design_scores_gemma":[0.002901583,0.0004759328,0.0003467939,0.0006132704,0.0001703223,0.0001370809,0.0005789432,0.8945641,0.0008334947,0.008602835,0.08920375,0.001571933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008958111,0.00009621263,0.9708291,0.0009474868,0.008080494,0.004220867,0.002504542,0.0006357767,0.0037274],"genre_scores_gemma":[0.2000076,0.0001375002,0.7933145,0.001098117,0.001130142,0.001286169,0.002033351,0.0001590883,0.0008335721],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8474275,"threshold_uncertainty_score":0.9995315,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04334568267748137,"score_gpt":0.3074808794513182,"score_spread":0.2641351967738368,"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."}}