{"id":"W2397618970","doi":"","title":"On a Conjecture Concerning the Friendly Index Sets of Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Vertex (graph theory); Graph; Index (typography); Discrete mathematics; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003071788,0.000703902,0.0011524,0.002454813,0.003297086,0.003527001,0.001831382,0.002264346,0.004663925],"category_scores_gemma":[0.01867165,0.0007674709,0.00110644,0.00238804,0.005712674,0.00834146,0.00312761,0.003102502,0.0008407523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00190788,"about_ca_system_score_gemma":0.0006171039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001230084,"about_ca_topic_score_gemma":0.0008534514,"domain_scores_codex":[0.9970871,0.0004877728,0.0002116211,0.0007807327,0.0007651747,0.0006676047],"domain_scores_gemma":[0.9777979,0.01572271,0.0019277,0.002690996,0.00091892,0.0009418229],"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.0008868393,0.0001841104,0.01083752,0.0002810335,0.00003986853,0.000480887,0.002148462,0.01151779,0.006278228,0.9124634,0.01497197,0.03990991],"study_design_scores_gemma":[0.000113777,0.000227288,0.005685947,0.0001003181,0.00004975359,0.001140171,0.0006395851,0.01885742,0.005093405,0.9479865,0.02001884,0.00008699394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7517521,0.002486415,0.1477829,0.007590315,0.0006386687,0.0001453301,0.002037136,0.0007380795,0.08682916],"genre_scores_gemma":[0.9565552,0.0009266764,0.03272453,0.001316367,0.0006178461,0.0001537829,0.001585443,0.00007430897,0.006045813],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004663925,"threshold_uncertainty_score":0.01624537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01123047320899054,"score_gpt":0.2336918424219469,"score_spread":0.2224613692129563,"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."}}