{"id":"W2606011227","doi":"","title":"Formal proofs of two algorithms for strongly connected components in graphs","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Mathematical proof; Computer science; Algorithm; Mathematics; Geometry","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.005170234,0.001946419,0.0007307701,0.003194572,0.002081034,0.004016612,0.003404759,0.002311348,0.01061842],"category_scores_gemma":[0.02819721,0.001587306,0.003065032,0.002706883,0.007695917,0.007149633,0.005047555,0.004487628,0.001754861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003621937,"about_ca_system_score_gemma":0.004172728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002899494,"about_ca_topic_score_gemma":0.002525898,"domain_scores_codex":[0.9937637,0.001912758,0.0004715535,0.001039624,0.002186478,0.0006257313],"domain_scores_gemma":[0.9760522,0.01775764,0.0008883127,0.001871442,0.002931202,0.0004991886],"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.00006783614,0.0001165685,0.0003790903,0.0003306103,0.00004870739,0.0001947404,0.000667564,0.00897395,0.001793171,0.9464389,0.004592769,0.03639609],"study_design_scores_gemma":[0.000121144,0.00005629313,0.0002561203,0.0001629545,0.00006754558,0.0002872718,0.0001869611,0.03989842,0.01051651,0.9255485,0.02283287,0.00006539503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007866212,0.0003399955,0.9809912,0.0009551739,0.0001353787,0.0001840546,0.0002279894,0.001269477,0.008030456],"genre_scores_gemma":[0.1924428,0.00069067,0.7955397,0.0008925613,0.0001799879,0.0006450649,0.0008666103,0.0008807839,0.007861704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01061842,"threshold_uncertainty_score":0.03552216,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03405352663281687,"score_gpt":0.2638218291713237,"score_spread":0.2297683025385069,"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."}}