{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005941748,0.0007080524,0.0006783777,0.0002700814,0.002092315,0.001611114,0.003131357,0.0005540629,0.0004599055],"category_scores_gemma":[0.001089664,0.0007993964,0.0005138792,0.000448809,0.0009011144,0.0007046974,0.001896479,0.0009830708,0.00006611348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006627351,"about_ca_system_score_gemma":0.001207609,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01389743,"about_ca_topic_score_gemma":0.01698952,"domain_scores_codex":[0.9911029,0.004890745,0.001025063,0.001321158,0.0006843351,0.0009757669],"domain_scores_gemma":[0.9910244,0.001651815,0.001350907,0.003183065,0.00227856,0.0005112732],"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.00002944664,0.001228539,0.02931198,0.0002718944,0.0004064693,0.00003199236,0.04966701,0.003338459,0.004485924,0.5339656,0.001862151,0.3754005],"study_design_scores_gemma":[0.002171294,0.000004298033,0.07734657,0.002902439,0.0002217463,0.0001748925,0.001405098,0.8086026,0.05048036,0.03744059,0.01785885,0.001391306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03077787,0.0009264087,0.9055701,0.0293344,0.0006086383,0.0008402771,0.0001396968,0.0003342931,0.03146825],"genre_scores_gemma":[0.6300244,0.001669729,0.3520561,0.0001739179,0.00006204461,0.0001243046,0.0002948726,0.00006101886,0.01553361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8052641,"threshold_uncertainty_score":0.9994457,"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."}}