{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007635459,0.0006298951,0.001390134,0.002660014,0.001926115,0.003517343,0.001465981,0.001722825,0.0105931],"category_scores_gemma":[0.006562344,0.001233693,0.0009256966,0.002836917,0.002915699,0.006000517,0.002931468,0.002912929,0.001125002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009100335,"about_ca_system_score_gemma":0.0002998321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006581406,"about_ca_topic_score_gemma":0.0007585627,"domain_scores_codex":[0.9991179,0.0003064163,0.00005785506,0.0001564306,0.0002549485,0.0001063998],"domain_scores_gemma":[0.9951047,0.002837073,0.0006417054,0.0005284368,0.00025114,0.0006370251],"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.000133053,0.00006319827,0.0005886456,0.0001179374,0.00002212046,0.0001969857,0.0004427147,0.006511579,0.00128373,0.9761438,0.003447657,0.01104861],"study_design_scores_gemma":[0.00001561317,0.00001842751,0.000359781,0.00002285014,0.000009077515,0.0001733948,0.0001270552,0.01364606,0.0003357746,0.9837313,0.001553417,0.00000723833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7490939,0.002238124,0.1303115,0.002797574,0.0003039555,0.00009489719,0.0006990217,0.0004985538,0.1139624],"genre_scores_gemma":[0.9487356,0.001192084,0.02572893,0.000460053,0.0003844913,0.0001500278,0.0008286496,0.0001903179,0.02232982],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0105931,"threshold_uncertainty_score":0.03543752,"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."}}