{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001828459,0.0003679455,0.0003350627,0.0002630684,0.001368306,0.0002859697,0.001503169,0.0001251974,0.00002590969],"category_scores_gemma":[0.00002182903,0.0003297837,0.0003547895,0.0008882977,0.00007199622,0.0005738769,0.0001611653,0.0004958795,0.0001826909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000189939,"about_ca_system_score_gemma":0.000201155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008526393,"about_ca_topic_score_gemma":0.00001676818,"domain_scores_codex":[0.9965354,0.000607787,0.0006019608,0.0008327984,0.0007299314,0.0006920762],"domain_scores_gemma":[0.997452,0.000656808,0.0003877891,0.001202208,0.0001335529,0.0001676197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005372675,0.0005278005,0.000061056,0.0001255548,0.00007791656,0.00005724371,0.004377958,0.002455397,0.2024678,0.1005624,0.009697565,0.6790521],"study_design_scores_gemma":[0.00573064,0.006422139,0.001557261,0.0001078117,0.0001531927,0.0002147539,0.001064004,0.6370395,0.122028,0.1799004,0.04374118,0.002041116],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4345577,0.0002232621,0.5589209,0.002490071,0.001687739,0.001271914,0.00007755282,0.0004975736,0.000273281],"genre_scores_gemma":[0.9943345,0.000003977016,0.00381078,0.0006984083,0.000335587,0.0004860089,0.00007198579,0.00005341304,0.000205295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6770109,"threshold_uncertainty_score":0.9999318,"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."}}