{"id":"W4246027188","doi":"10.2307/2695500","title":"Inverting the Pascal Matrix Plus One","year":2002,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Pascal (unit); Computer science; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0005354142,0.001501044,0.0007824599,0.001632273,0.0008200669,0.00171759,0.001117539,0.000532651,0.2375036],"category_scores_gemma":[0.003755708,0.0004245866,0.0008068233,0.001116364,0.0005242242,0.002153458,0.001999666,0.0016589,0.1227526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004547594,"about_ca_system_score_gemma":0.0007884643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001877288,"about_ca_topic_score_gemma":0.004040028,"domain_scores_codex":[0.999074,0.00007742238,0.00004273815,0.0001364524,0.0005176428,0.0001517979],"domain_scores_gemma":[0.998991,0.0002206164,0.00004007368,0.0002115426,0.0004502231,0.00008646665],"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.0001753624,0.0001126419,0.000640805,0.0004169754,0.00002847057,0.0002950802,0.0001719653,0.002362849,0.01037217,0.04528479,0.3714641,0.5686747],"study_design_scores_gemma":[0.0001306148,0.0001830274,0.001296848,0.000124673,0.00003093091,0.001221171,0.0002457543,0.04517856,0.03112762,0.1209968,0.7993709,0.0000930124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0116226,0.0009098362,0.7001434,0.001933328,0.003179772,0.0004107916,0.004970297,0.0354971,0.2413329],"genre_scores_gemma":[0.1154449,0.001099169,0.6942039,0.001136586,0.0008399645,0.0006134854,0.006755922,0.01557571,0.1643305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2375036,"threshold_uncertainty_score":0.7945287,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0257300314419334,"score_gpt":0.2601622319651434,"score_spread":0.23443220052321,"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."}}