{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872153,0.001439532,0.00142642,0.001069881,0.001264787,0.002668103,0.002851203,0.001473552,0.009573776],"category_scores_gemma":[0.01173017,0.000926421,0.002527181,0.001438278,0.002470506,0.007257674,0.006614929,0.005431284,0.002130127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00373384,"about_ca_system_score_gemma":0.002658289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001781447,"about_ca_topic_score_gemma":0.003835673,"domain_scores_codex":[0.9956909,0.0008548092,0.0001996501,0.0008176659,0.001503399,0.0009335731],"domain_scores_gemma":[0.9919345,0.005149594,0.000440701,0.001737259,0.0005067163,0.0002312324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001504953,0.0004417619,0.002126615,0.001459095,0.0001636579,0.0004037382,0.001085565,0.0961401,0.05785173,0.623948,0.0180019,0.1968729],"study_design_scores_gemma":[0.0002679569,0.0002005806,0.000611294,0.0001167877,0.0001821746,0.0002175143,0.0001753797,0.2782198,0.02780318,0.6785534,0.01358008,0.00007189322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2010543,0.001367872,0.7485216,0.003145267,0.0001997571,0.0003086431,0.0009857904,0.006236376,0.03818036],"genre_scores_gemma":[0.7128924,0.0007296508,0.271455,0.001465113,0.0002368292,0.0005009281,0.001230806,0.001390099,0.01009917],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009573776,"threshold_uncertainty_score":0.03202748,"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."}}