{"id":"W2042572227","doi":"10.1007/s10878-012-9541-4","title":"A lower bound of the surviving rate of a planar graph with girth at least seven","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Planar graph; Graph; Wheel graph; Mathematics; Upper and lower bounds; Girth (graph theory); Discrete mathematics; Graph power; Line graph","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.002973726,0.002757259,0.00287237,0.003309302,0.001581617,0.003183966,0.004635967,0.002607348,0.01153634],"category_scores_gemma":[0.02297097,0.0008622935,0.002051158,0.002283772,0.003241152,0.004393901,0.004220214,0.004619705,0.00190595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002081571,"about_ca_system_score_gemma":0.001374564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001769223,"about_ca_topic_score_gemma":0.00136275,"domain_scores_codex":[0.9978564,0.000447073,0.00007515596,0.0003762076,0.0005537912,0.0006912591],"domain_scores_gemma":[0.973123,0.02049986,0.001144608,0.001950171,0.001195405,0.002086936],"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.002133728,0.0004280619,0.005902341,0.001950737,0.0004922207,0.0007716747,0.001156831,0.3996823,0.0428858,0.4227284,0.02969284,0.09217504],"study_design_scores_gemma":[0.0001427957,0.0005830629,0.003296713,0.0003564153,0.0003434269,0.001300547,0.0003804807,0.6640426,0.01400028,0.3023905,0.01295639,0.0002068672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4633107,0.01254965,0.4052979,0.007147624,0.0008704536,0.0002783143,0.003727656,0.002066283,0.1047513],"genre_scores_gemma":[0.9060344,0.005871113,0.06707083,0.0009587779,0.0007819752,0.0004631943,0.002680826,0.0008315446,0.01530724],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01153634,"threshold_uncertainty_score":0.03859288,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007577310179705699,"score_gpt":0.2124624381415707,"score_spread":0.204885127961865,"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."}}