{"id":"W2087899083","doi":"10.1016/j.jcss.2005.11.002","title":"Corrigendum to “Completeness results for graph isomorphism” [J. Comput. System Sci. 66 (2003) 549–566]","year":2006,"lang":"en","type":"erratum","venue":"Journal of Computer and System Sciences","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Graph isomorphism; Isomorphism (crystallography); Completeness (order theory); Graph; Combinatorics; Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Line graph; Chemistry","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004153187,0.0007933406,0.001907504,0.001759425,0.0006912626,0.001477057,0.00468536,0.0004584646,3.424202e-7],"category_scores_gemma":[0.00002214407,0.0006345876,0.0004110709,0.002087097,0.0002430947,0.0008002759,0.0007453627,0.0007003194,0.000005723539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003842344,"about_ca_system_score_gemma":0.0008986229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009399687,"about_ca_topic_score_gemma":0.00001027096,"domain_scores_codex":[0.9933007,0.0002946737,0.002376674,0.001231173,0.001856414,0.0009404183],"domain_scores_gemma":[0.9942353,0.0001809655,0.00199308,0.0009421246,0.002113712,0.0005347814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000263089,0.00004428773,0.00002667336,0.001055675,0.00007217204,0.0001335974,0.0002956986,0.003826773,0.000006392769,0.04889429,0.9386204,0.006997732],"study_design_scores_gemma":[0.000825873,0.001613845,0.0003025574,0.00565757,0.00006889221,0.002153094,0.00003604096,0.4566861,0.00002873416,0.0001951353,0.5314782,0.0009538955],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007133393,0.001444658,0.9175283,0.0003297205,0.07832641,0.0009002834,0.0001097045,0.0004849772,0.0008046238],"genre_scores_gemma":[0.01061004,0.00004506789,0.9799397,0.0002122316,0.005471694,0.00005375858,0.00002523865,0.00007000816,0.003572273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4528593,"threshold_uncertainty_score":0.9996105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02942560221008793,"score_gpt":0.2482003294429134,"score_spread":0.2187747272328255,"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."}}