{"id":"W2064666203","doi":"10.1016/j.tcs.2013.09.034","title":"Safe recursion revisited I: Categorical semantics for lower complexity","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; Western University","funders":"","keywords":"Soundness; Mathematics; Bounded function; Categorical variable; Recursion (computer science); Polynomial; Semantics (computer science); Set (abstract data type); Discrete mathematics; Computer science; Algorithm; Programming language; Statistics","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.001529238,0.0002420022,0.000338376,0.0001476631,0.0005887543,0.0009210794,0.002617215,0.00009767478,0.00007463885],"category_scores_gemma":[0.000153686,0.0001774627,0.0001294425,0.001065038,0.002130612,0.0007602946,0.0009276936,0.0001962834,0.0003683783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008255206,"about_ca_system_score_gemma":0.00009464725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000157532,"about_ca_topic_score_gemma":3.907474e-7,"domain_scores_codex":[0.9970034,0.0001282329,0.0004112048,0.0009084236,0.0007034346,0.000845255],"domain_scores_gemma":[0.9975647,0.0003040688,0.0001181421,0.001036503,0.000569027,0.0004075919],"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.000005375118,0.00008537398,0.00004929898,0.00002296108,0.000003721434,0.000004573666,0.0001799988,0.000006049067,0.000158817,0.9725425,0.0009784834,0.02596285],"study_design_scores_gemma":[0.0002211576,0.0003698427,0.0004383908,0.000006301398,0.000004138391,0.00003609202,0.000004552838,0.3318601,0.0005169491,0.6633018,0.002995792,0.0002449089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002777374,0.0000376448,0.9889741,0.002074196,0.001338034,0.0007660592,6.074082e-7,0.0002809074,0.003751111],"genre_scores_gemma":[0.8419784,0.000002944214,0.1570773,0.0005910872,0.00025109,0.00002936978,0.000002018775,0.000009321511,0.00005843704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8392011,"threshold_uncertainty_score":0.888199,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02868647565985513,"score_gpt":0.269885498180035,"score_spread":0.2411990225201799,"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."}}