{"id":"W2399524571","doi":"","title":"Cross recurrence relations for r-Lah numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Recurrence relation; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00117793,0.0005764837,0.0004882784,0.003073277,0.001449158,0.002806007,0.0007008043,0.0009801824,0.01751093],"category_scores_gemma":[0.006348188,0.0003224995,0.0005653196,0.001787602,0.001522466,0.004541129,0.001886698,0.002113729,0.005548873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001246157,"about_ca_system_score_gemma":0.0005002555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006918355,"about_ca_topic_score_gemma":0.001049562,"domain_scores_codex":[0.9990134,0.0001895767,0.00008309325,0.0001919632,0.000315472,0.0002063916],"domain_scores_gemma":[0.9979531,0.0008492572,0.0003188479,0.0002825998,0.0004322426,0.0001640828],"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.00001868542,0.000009925125,0.0001826455,0.00003357229,0.000003964025,0.00007685727,0.0001368259,0.000368616,0.0006853684,0.9842091,0.003704925,0.0105695],"study_design_scores_gemma":[0.000009328285,0.00002084854,0.000273519,0.00002836761,0.000008131388,0.0002601189,0.00006385696,0.004388758,0.001276518,0.9812722,0.01237632,0.00002213942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1636723,0.007031165,0.3352685,0.00439921,0.001992021,0.0001635132,0.001164396,0.001279494,0.4850294],"genre_scores_gemma":[0.8870441,0.001994739,0.04104305,0.0015186,0.001095276,0.0002070617,0.0007346433,0.0003575984,0.06600493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01751093,"threshold_uncertainty_score":0.05857986,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01372081933889435,"score_gpt":0.2596190871288584,"score_spread":0.245898267789964,"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."}}