{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005101034,0.0008045201,0.0004212017,0.0007445207,0.001791514,0.001628921,0.005554332,0.0008847179,0.0457609],"category_scores_gemma":[0.002219008,0.001280777,0.002091423,0.001909593,0.002035269,0.001808306,0.002404157,0.002327145,0.0005856548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000251928,"about_ca_system_score_gemma":0.001532167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002368992,"about_ca_topic_score_gemma":0.0002526,"domain_scores_codex":[0.9894633,0.001061916,0.002392016,0.001316557,0.003467379,0.002298861],"domain_scores_gemma":[0.9891597,0.003025635,0.003275147,0.002992301,0.0005113793,0.001035856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001371185,0.0004080183,0.00002703985,0.000562792,0.0009578253,0.002045247,0.001018519,0.001760988,0.001020112,0.7309475,0.2584076,0.001473132],"study_design_scores_gemma":[0.005710179,0.005991913,0.0005140979,0.001718869,0.001419854,0.00289737,0.00146399,0.08699463,0.8642734,0.006394253,0.02065784,0.001963602],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5479128,0.004239175,0.01377692,0.001567652,0.006171469,0.00008064954,0.0003400324,0.000155889,0.4257554],"genre_scores_gemma":[0.9908004,0.001636498,0.003566704,0.0008568292,0.001642401,0.0001461631,0.000189615,0.0006355866,0.000525742],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8632533,"threshold_uncertainty_score":0.9999745,"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."}}