{"id":"W4390306948","doi":"10.4230/lipics.ccc.2024.20","title":"Lower Bounds for Set-Multilinear Branching Programs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Tel Aviv University; Tata Institute of Fundamental Research","keywords":"Multilinear map; Branching (polymer chemistry); Set (abstract data type); Mathematics; Combinatorics; Computer science; Discrete mathematics; Pure mathematics; Chemistry; Programming language","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058577,0.003138963,0.002758954,0.003182025,0.003452357,0.007915132,0.007860811,0.002960911,0.02370716],"category_scores_gemma":[0.04080742,0.001523044,0.00579808,0.003801595,0.005230965,0.02517898,0.01000713,0.01882852,0.004580567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008650125,"about_ca_system_score_gemma":0.004676482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003759428,"about_ca_topic_score_gemma":0.005476191,"domain_scores_codex":[0.98844,0.001787624,0.0003876231,0.002485814,0.003690831,0.003208055],"domain_scores_gemma":[0.941359,0.04394541,0.002087045,0.006702587,0.003332218,0.002573814],"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.0009924482,0.0004162285,0.003655739,0.001021449,0.000228226,0.000316426,0.0007781488,0.1027074,0.009317166,0.8275911,0.0155029,0.03747278],"study_design_scores_gemma":[0.00006110323,0.00008717521,0.0004046301,0.0001014986,0.0001104967,0.0001702958,0.0001050771,0.2997207,0.003472932,0.6885489,0.007165363,0.0000518209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08195847,0.004262825,0.8286146,0.01318445,0.0005939609,0.0003127987,0.002777364,0.003574606,0.06472096],"genre_scores_gemma":[0.7635301,0.003678492,0.1924966,0.005077865,0.001808299,0.0009895943,0.00431743,0.003060476,0.02504109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02370716,"threshold_uncertainty_score":0.07930833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1861832532536893,"score_gpt":0.2341522735751831,"score_spread":0.04796902032149389,"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."}}