{"id":"W2610653637","doi":"","title":"Une preuve formelle de l'algorithme de Tarjan-1972 pour trouver les composantes fortement connexes dans un graphe","year":2017,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Combinatorics; Humanities; Mathematics; Philosophy","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.001733075,0.002312458,0.001385453,0.002278684,0.001575113,0.003233057,0.002312532,0.002851449,0.01359998],"category_scores_gemma":[0.006684526,0.001294988,0.002433258,0.001814476,0.002182731,0.002860119,0.00194697,0.00423697,0.00422018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00172394,"about_ca_system_score_gemma":0.002693459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008354759,"about_ca_topic_score_gemma":0.01490183,"domain_scores_codex":[0.9986522,0.000260879,0.00008660847,0.0004307276,0.0004042208,0.0001654608],"domain_scores_gemma":[0.9963896,0.002453999,0.000100324,0.0005259787,0.0004311503,0.00009892201],"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.0008437469,0.0004340862,0.002261185,0.0006702063,0.0002212728,0.0004637735,0.000768889,0.1826589,0.03632624,0.1239192,0.01599871,0.6354337],"study_design_scores_gemma":[0.0003550682,0.0003145226,0.001232114,0.0001259608,0.0001332098,0.000442095,0.0002855104,0.8598658,0.02737682,0.07667165,0.03311029,0.00008700255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01210645,0.0001982286,0.9794133,0.0003303365,0.0001770201,0.0001628466,0.0001401221,0.002112892,0.005358763],"genre_scores_gemma":[0.06251441,0.0001865574,0.927675,0.0001723785,0.0000764069,0.0003105794,0.0004959965,0.0006248503,0.007943845],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01359998,"threshold_uncertainty_score":0.04549652,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02136758383861038,"score_gpt":0.242561074478154,"score_spread":0.2211934906395436,"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."}}