{"id":"W4402388714","doi":"10.1080/00150517.2022.12427477","title":"A Matrix-Based Recursion Relation for F <sub> F <sub>n</sub> </sub>","year":2022,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Recursion (computer science); Relation (database); Matrix (chemical analysis); Mathematics; Pure mathematics; Combinatorics; Computer science; Algorithm; Materials science; Data mining","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.001331849,0.0006669988,0.0004864993,0.001335929,0.001591827,0.00179832,0.0006915287,0.001058463,0.005233365],"category_scores_gemma":[0.004150211,0.0003424131,0.001030571,0.001185148,0.002259209,0.00274933,0.001079545,0.003127017,0.003246363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001480831,"about_ca_system_score_gemma":0.001192277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002897238,"about_ca_topic_score_gemma":0.003613855,"domain_scores_codex":[0.9991131,0.0001285376,0.00008460492,0.0002449278,0.0003173679,0.0001114394],"domain_scores_gemma":[0.9986531,0.000551107,0.0001029813,0.0001116027,0.0005268001,0.00005445138],"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.00001495804,0.00001985148,0.0001754531,0.00007136788,0.000005285341,0.0001340147,0.0004859338,0.001131037,0.006591337,0.9703026,0.003144513,0.01792351],"study_design_scores_gemma":[0.0000191855,0.0001399752,0.0005711361,0.00009331911,0.00003550191,0.001555262,0.000130195,0.03082664,0.01672176,0.8779883,0.07180826,0.0001105265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01957219,0.002430339,0.9025356,0.001054648,0.00105031,0.0001276494,0.0003184536,0.0003742841,0.07253657],"genre_scores_gemma":[0.3961603,0.00379554,0.555346,0.002124591,0.001411882,0.0003586836,0.0006525803,0.0003999509,0.03975055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005233365,"threshold_uncertainty_score":0.01750737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009473507065176343,"score_gpt":0.2291875706927449,"score_spread":0.2197140636275685,"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."}}