{"id":"W4206382042","doi":"10.1016/j.ejc.2006.06.009","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-Free bound for the class of planar graphs","year":2006,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph; Vertex (graph theory); Homomorphism; Scroll; Discrete mathematics; Algorithm; Philosophy; Theology","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":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005387921,0.001168094,0.001006629,0.002234332,0.001042825,0.004897478,0.002519125,0.001320168,0.5694078],"category_scores_gemma":[0.003074618,0.0008203451,0.0008057591,0.003759714,0.0006748855,0.005653683,0.001855418,0.002604173,0.4105826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0020783,"about_ca_system_score_gemma":0.001001172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006252558,"about_ca_topic_score_gemma":0.006643658,"domain_scores_codex":[0.9996277,0.00005198121,0.00003126131,0.00007611143,0.0001633824,0.00004954011],"domain_scores_gemma":[0.9984952,0.0004891434,0.0001064488,0.0003596895,0.0003830803,0.0001664451],"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.00005996974,0.00003408934,0.0001524061,0.0002142877,0.000007656891,0.00004058019,0.00009701642,0.0003809407,0.001094959,0.05542219,0.8981038,0.04439215],"study_design_scores_gemma":[0.00003924436,0.00001571171,0.0008282132,0.00006606455,0.000009420677,0.000169889,0.00006873997,0.002590866,0.003673187,0.05644835,0.9360502,0.00004008944],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002756331,0.000560275,0.1206133,0.005823994,0.001206082,0.0001991841,0.0998664,0.06055138,0.708423],"genre_scores_gemma":[0.0422407,0.002080365,0.09832152,0.002114412,0.001046711,0.0005616981,0.1735979,0.06992983,0.6101068],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4305922,"threshold_uncertainty_score":0.6141875,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01973816240423871,"score_gpt":0.2475374538787734,"score_spread":0.2277992914745347,"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."}}