{"id":"W2557594551","doi":"10.1002/jgt.22102","title":"Characterizing Graphs with Crossing Number at Least 2","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Crossing number (knot theory); Mathematics; Vertex (graph theory); Disjoint sets; Graph; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0004538123,0.0007006076,0.0005189256,0.002230402,0.0006791377,0.001730058,0.0005789503,0.0009353582,0.004309774],"category_scores_gemma":[0.004148571,0.0003740956,0.0004006922,0.001807748,0.0009316538,0.002035797,0.0008256028,0.0006981608,0.0004007495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000658212,"about_ca_system_score_gemma":0.0002826783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003499427,"about_ca_topic_score_gemma":0.0003089669,"domain_scores_codex":[0.99946,0.00008985291,0.00003143048,0.0002104585,0.00009141938,0.0001168291],"domain_scores_gemma":[0.9964237,0.001606232,0.0009247403,0.0002955277,0.0003726846,0.0003771248],"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.001430732,0.0004363878,0.07424206,0.0009553918,0.0002631395,0.005605748,0.002122777,0.1175166,0.1426537,0.5281247,0.01836595,0.1082828],"study_design_scores_gemma":[0.0001361562,0.0003215415,0.02460887,0.0001090804,0.0001790291,0.005292138,0.001424574,0.127706,0.02619109,0.7963898,0.01750829,0.0001334804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9449034,0.0003976537,0.03946014,0.0005081114,0.00008822531,0.00003929068,0.0005544994,0.0002448229,0.01380385],"genre_scores_gemma":[0.9898484,0.0001515126,0.008231871,0.0001267057,0.00005777149,0.00001997798,0.0005939027,0.00003222497,0.0009376259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004309774,"threshold_uncertainty_score":0.01441765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01596033645025523,"score_gpt":0.2768418955727738,"score_spread":0.2608815591225186,"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."}}