{"id":"W4379086819","doi":"10.48550/arxiv.2305.19320","title":"On the algebraic proof complexity of Tensor Isomorphism","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Isomorphism (crystallography); Rank (graph theory); Linear algebra; Upper and lower bounds; Combinatorics; Algebraic number; Tensor (intrinsic definition); Bounded function; Conjecture; Discrete mathematics; Algebra over a field; Pure mathematics","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.00039772,0.0002378453,0.0003046952,0.0002381575,0.0001729753,0.00006151661,0.002495466,0.0001782782,0.00001947956],"category_scores_gemma":[0.00009899998,0.0002051859,0.0001937096,0.0006597249,0.0002899297,0.00008407237,0.001929859,0.0004964251,0.00006546164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007536451,"about_ca_system_score_gemma":0.0001211408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009538238,"about_ca_topic_score_gemma":0.000009141346,"domain_scores_codex":[0.9984472,0.0002235782,0.000222329,0.0007369005,0.0001282641,0.0002417296],"domain_scores_gemma":[0.9976119,0.0003120906,0.0003530054,0.001455437,0.0001992761,0.00006822514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009079496,0.00006300127,0.0001919252,0.0000314607,0.0000411496,0.0000305891,0.0001080048,0.2373604,0.000005537881,0.7578392,0.004255214,0.00006447396],"study_design_scores_gemma":[0.0001095381,0.00005248282,0.0006361799,0.00009405202,0.00001263011,0.000001034628,0.000008713464,0.6101565,0.0003672808,0.3883075,0.0000710226,0.0001831393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04979416,0.00001370221,0.9455884,0.001102228,0.0002918702,0.0004064964,0.00001553522,0.000724822,0.002062777],"genre_scores_gemma":[0.9919519,0.00003741872,0.006025807,0.0002087691,0.00002640149,0.000001627866,0.000009488464,0.00001673507,0.001721803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9421578,"threshold_uncertainty_score":0.8367239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1728259515000753,"score_gpt":0.2151925318202324,"score_spread":0.04236658032015714,"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."}}