{"id":"W4302142733","doi":"","title":"Rank: a tool to check program termination and computational complexity","year":2013,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Emera (Canada)","funders":"","keywords":"Computer science; Rank (graph theory); Computational complexity theory; Programming language; Theoretical computer science; Algorithm; Mathematics; Combinatorics","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.00190777,0.0001607939,0.0001796595,0.0001169729,0.000317488,0.0008483325,0.0007530617,0.00007171676,0.00005422099],"category_scores_gemma":[0.0003470294,0.0001533616,0.00005854837,0.0004459649,0.0001406732,0.0004604348,0.000438608,0.0001229979,0.0001518962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004469336,"about_ca_system_score_gemma":0.00006968599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006775532,"about_ca_topic_score_gemma":0.0001745069,"domain_scores_codex":[0.9975197,0.001072444,0.0003128463,0.0004794162,0.0003333066,0.000282281],"domain_scores_gemma":[0.9973604,0.0003556419,0.0001583156,0.0007271849,0.001226131,0.000172309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001529769,0.0002841629,0.001680217,0.00003165502,0.00001372187,0.000001377871,0.005003663,0.0000174094,0.0003054119,0.5364979,0.0006985283,0.4554644],"study_design_scores_gemma":[0.001738171,0.000008576494,0.2533918,0.0001685516,0.00001918689,0.00008943022,0.0001844826,0.5006647,0.005221169,0.1685916,0.06891102,0.001011271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07680102,0.00009055276,0.8988016,0.009297704,0.0001084675,0.0009816949,0.000001925771,0.0004202503,0.01349674],"genre_scores_gemma":[0.8015964,0.000005442014,0.1965148,0.0001604107,0.00001208209,0.0001531777,0.00003343281,0.000009230629,0.001515083],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7247953,"threshold_uncertainty_score":0.818049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02128605375426889,"score_gpt":0.2475466748098387,"score_spread":0.2262606210555698,"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."}}