{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075407,0.002750281,0.002902286,0.006204699,0.001921023,0.005670975,0.006087831,0.002950441,0.0157877],"category_scores_gemma":[0.05263232,0.001951692,0.003987586,0.003969271,0.004212178,0.01619858,0.006110444,0.005524086,0.004214623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001944915,"about_ca_system_score_gemma":0.003685331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0019285,"about_ca_topic_score_gemma":0.002367132,"domain_scores_codex":[0.9866278,0.003888404,0.001226239,0.002024167,0.00497205,0.001261399],"domain_scores_gemma":[0.927856,0.05186205,0.003706505,0.01018243,0.004893203,0.001499777],"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.002267005,0.0007355054,0.01441782,0.003065838,0.0005494307,0.0007067413,0.0008707545,0.08094154,0.01657502,0.385243,0.08549031,0.4091371],"study_design_scores_gemma":[0.0003803406,0.0005527458,0.001843139,0.0003033966,0.0003309374,0.0005523813,0.0002614342,0.4704042,0.02760572,0.4698116,0.02771065,0.0002434726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02621444,0.0004969185,0.9227967,0.0007981247,0.0002718932,0.000233187,0.001649825,0.04078726,0.006751472],"genre_scores_gemma":[0.4455873,0.0006297574,0.5261719,0.0008685648,0.0006836044,0.0009428317,0.004557213,0.01090113,0.009657787],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0157877,"threshold_uncertainty_score":0.05281508,"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."}}