{"id":"W3122774847","doi":"10.1920/wp.cem.2008.0708","title":"Computationally efficient recursions for top-order invariant polynomials with applications","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Invariant (physics); Computer science; Order (exchange); Mathematics; Algebra over a field; Algorithm; Applied mathematics; Pure mathematics; Mathematical physics","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.001460574,0.0008579293,0.0009387799,0.001370924,0.0008536153,0.001692957,0.001444142,0.0007050786,0.007210269],"category_scores_gemma":[0.01205125,0.0004060901,0.0008610471,0.001778499,0.001012465,0.00235816,0.002129987,0.001713609,0.002270238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001179136,"about_ca_system_score_gemma":0.001625451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007485532,"about_ca_topic_score_gemma":0.01176223,"domain_scores_codex":[0.9990011,0.0002983541,0.00006199318,0.0001146583,0.0003486859,0.000175188],"domain_scores_gemma":[0.9971671,0.001812624,0.0001495461,0.0003370624,0.0004194812,0.0001142712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002771788,0.0001501925,0.001686886,0.0002306339,0.0000409372,0.000267885,0.0004833097,0.2784934,0.007200587,0.3247969,0.005826657,0.3805454],"study_design_scores_gemma":[0.00003335298,0.00002544607,0.0001511458,0.00001527803,0.000007262496,0.00006033964,0.00003987131,0.8980094,0.001581569,0.09731404,0.002749193,0.00001315131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01182891,0.0002839279,0.9847848,0.0001387752,0.00004085275,0.0000401054,0.0000584361,0.0005965686,0.002227598],"genre_scores_gemma":[0.1997742,0.0004581748,0.7953766,0.0001072538,0.0001358051,0.0001320238,0.0002250617,0.0003453218,0.003445459],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007485532,"threshold_uncertainty_score":0.02412069,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0479005870939764,"score_gpt":0.2543574732028274,"score_spread":0.206456886108851,"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."}}