{"id":"W2006409610","doi":"10.1016/j.dam.2009.04.014","title":"Limited packings in graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"Saint Mary's University; Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Packing problems; Graph; Upper and lower bounds; Set packing; Simple graph; Discrete mathematics; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0004407266,0.0001879543,0.0002555407,0.0003027014,0.00007222222,0.0001165209,0.00106582,0.00007108851,0.000009790653],"category_scores_gemma":[0.00005843684,0.0001650822,0.00006624371,0.001158641,0.00006763401,0.0002509989,0.0001620395,0.0002490079,0.00007854257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003225429,"about_ca_system_score_gemma":0.00002171639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.005146e-7,"about_ca_topic_score_gemma":0.000001755989,"domain_scores_codex":[0.9984009,0.0000194474,0.0003368476,0.0003634708,0.0003972363,0.0004821478],"domain_scores_gemma":[0.9987393,0.0001661666,0.00009869978,0.0008523766,0.00003522017,0.0001082303],"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.000005433486,0.00008478706,0.00001685823,0.00001838548,0.000004164567,0.00001220263,0.001249449,0.00003912171,0.005927774,0.9819778,0.00005814548,0.01060593],"study_design_scores_gemma":[0.0003471178,0.00004678163,0.000475232,0.00003022671,0.00000230917,0.000006379395,0.0001557498,0.009003427,0.004194544,0.9853583,0.0001611608,0.0002187995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06712497,0.00007043402,0.8700753,0.0008416264,0.00004888418,0.0006735804,0.000002388422,0.0004210485,0.0607417],"genre_scores_gemma":[0.774251,0.0000181219,0.2253102,0.0003022495,0.00001023982,0.00002910602,0.000002881395,0.00001354191,0.00006269292],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.707126,"threshold_uncertainty_score":0.6731855,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01961147427158829,"score_gpt":0.2841082372443037,"score_spread":0.2644967629727154,"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."}}