{"paper":{"title":"Multiplying matrices via polynomials: exposition and barriers","arxiv_id":"2610.30054","primary_cat":"cs.CC","submitted_at":"2026-10-21T17:15:05+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":0.81,"id":"s0","own":false,"role":"contribution","text":"We give an exposition of OpenAI's recent proof that the exponent $\\omega_\\mathbb{C}$ of matrix multiplication over the complex numbers satisfies $\\omega_\\mathbb{C}\\leq9/4$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.27,"main_claim_p":0.39,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.05,"background":0.13,"limitation":0.0,"future_work":0.0,"contribution":0.81,"interpretation":0.0}},{"i":1,"p":0.92,"id":"s1","own":true,"role":"result","text":"Our version of the proof gives $\\omega_\\mathbb{F}\\leq9/4$ over every field $\\mathbb{F}$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.9,"main_claim_p":0.38,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.92,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.08,"interpretation":0.0}},{"i":2,"p":0.97,"id":"s2","own":true,"role":"contribution","text":"We also treat the rectangular matrix multiplication exponent $\\omega_\\mathbb{F}(a,b,c)$.","hedge":{"p":0.81,"label":"asserted"},"own_p":0.72,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.03,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.97,"interpretation":0.0}},{"i":3,"p":0.99,"id":"s3","own":true,"role":"result","text":"Here we have $\\omega_\\mathbb{F}(1,k,1)=2$ for $0\\leq k\\leq1/2$ and $\\omega_\\mathbb{F}(1,k,1)\\leq1+k+1/(4k)$ for $k\\geq1/2$, and, for real numbers $a\\geq b\\geq c\\geq0$, $\\omega_\\mathbb{F}(a,b,c)=a+b$ if $c(a+b)\\leq ab$ and $\\omega_\\mathbb{F}(a,b,c)\\leq(a+b+c)/2+(ab/c+ac/b+bc/a)/4$ otherwise.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.7,"main_claim_p":0.19,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":4,"p":0.97,"id":"s4","own":true,"role":"method","text":"Our exposition is in the language of degeneration inequalities among polynomial multiplication tensors and Strassen's asymptotic spectrum duality.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.63,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.97,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.0}},{"i":5,"p":0.7,"id":"s5","own":true,"role":"result","text":"We moreover prove an operational barrier (which can be thought of as coming from an operational asymptotic spectrum) showing that the current analysis of all these upper bounds on $\\omega_\\mathbb{F}$ and $\\omega_\\mathbb{F}(a,b,c)$ is optimal and that in fact the current degeneration ingredients cannot improve the bounds.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.51,"quantitative":false,"quantitative_p":0.13,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.7,"background":0.0,"limitation":0.05,"future_work":0.0,"contribution":0.23,"interpretation":0.02}}]},"compiled":{"main_claim":{"p":0.68,"text":"We moreover prove an operational barrier (which can be thought of as coming from an operational asymptotic spectrum) showing that the current analysis of all these upper bounds on $\\omega_\\mathbb{F}$ and $\\omega_\\mathbb{F}(a,b,c)$ is optimal and that in fact the current degeneration ingredients cannot improve the bounds.","location":"abstract s5","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":5384,"cost_usd_reported":0.0},"compiled_at":"2026-10-22","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.05,"states_limitation":0.79,"human_participants":0.01,"controlled_comparison":0.01,"randomized_assignment":0.01,"states_quantitative_result":0.99,"compares_with_prior_results":0.68,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":0.98,"value":"theoretical result","probabilities":{"review":0.02,"method_or_tool":0.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.98,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.84,"text":"We moreover prove an operational barrier (which can be thought of as coming from an operational asymptotic spectrum) showing that the current analysis of all these upper bounds on $\\omega_\\mathbb{F}$ and $\\omega_\\mathbb{F}(a,b,c)$ is optimal and that in fact the current degeneration ingredients cannot improve the bounds.","location":"abstract s5"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":6,"sentences_in_abstract":6},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}