{"id":"W2094660491","doi":"10.1145/2070336.2070351","title":"Stack safe parallel recursion with paraffin","year":2011,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Stack (abstract data type); Call stack; Recursion (computer science); Computer science; Subroutine; Parallel computing; Parallelism (grammar); Feature (linguistics); Algorithm; Programming language; Distributed computing","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":[],"consensus_categories":[],"category_scores_codex":[0.0002146005,0.0002193279,0.0001934289,0.0001176926,0.0001573586,0.00009581616,0.001721974,0.00006402549,0.00003553892],"category_scores_gemma":[0.00005840958,0.0001820786,0.0000551423,0.0003774952,0.00007193453,0.0004611856,0.0003577861,0.0001905758,0.00006578206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004103746,"about_ca_system_score_gemma":0.00004662064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001098208,"about_ca_topic_score_gemma":0.000009170442,"domain_scores_codex":[0.9984381,0.00009469804,0.0002458599,0.000496763,0.0003349918,0.0003896467],"domain_scores_gemma":[0.9983332,0.0001232545,0.0001491018,0.001209576,0.00006389982,0.0001209632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007206202,0.001057823,0.0168945,0.000169903,0.0004124368,0.001139556,0.02025821,0.04347822,0.007190565,0.05368891,0.7527745,0.1022147],"study_design_scores_gemma":[0.01561709,0.00726477,0.06386962,0.002257279,0.0002560141,0.00106709,0.0007984747,0.2980387,0.1742258,0.04810448,0.3734464,0.01505424],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03708861,0.00006057974,0.9552073,0.004019258,0.000156476,0.0001961801,8.462555e-7,0.0007769904,0.002493774],"genre_scores_gemma":[0.2543473,0.00002256031,0.7404276,0.004967555,0.00003970309,0.00001770628,0.000003816137,0.00001748921,0.0001562456],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3793282,"threshold_uncertainty_score":0.7424949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02888066258292444,"score_gpt":0.2236974589418251,"score_spread":0.1948167963589007,"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."}}