{"id":"W2061237693","doi":"10.1007/s10107-005-0649-5","title":"Independent packings in structured graphs","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Indifference graph; Pathwidth; Mathematics; Cograph; Clique-sum; Split graph; 1-planar graph; Maximal independent set; Modular decomposition; Disjoint sets; Discrete mathematics; Interval graph; Treewidth; Partial k-tree; Graph; 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.00113807,0.0009032221,0.0014403,0.00280279,0.001916987,0.004409209,0.001889388,0.002214507,0.008522787],"category_scores_gemma":[0.008069434,0.002237722,0.001457289,0.00390013,0.002858932,0.007931883,0.002706013,0.00390689,0.001259595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126811,"about_ca_system_score_gemma":0.000590687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000705414,"about_ca_topic_score_gemma":0.001130412,"domain_scores_codex":[0.998852,0.0003676076,0.00006571654,0.0002163751,0.000338278,0.0001599914],"domain_scores_gemma":[0.9936941,0.00405974,0.0009184103,0.000509718,0.0003333405,0.00048465],"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.00004752861,0.00006972908,0.0004031584,0.0000946503,0.00002342815,0.0001134694,0.0003376452,0.01375525,0.0005110442,0.9690699,0.003667235,0.01190695],"study_design_scores_gemma":[0.0000120045,0.00001190977,0.000117427,0.00001579465,0.00001118448,0.00006431706,0.00007970171,0.03169609,0.000232189,0.9666857,0.001067586,0.000006193667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3506495,0.00115236,0.5818549,0.002244528,0.0002609834,0.0001741732,0.0005350356,0.0005171574,0.06261131],"genre_scores_gemma":[0.7716635,0.001588158,0.1858468,0.0007713171,0.0006192485,0.0003811592,0.001356688,0.0005100138,0.03726307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008522787,"threshold_uncertainty_score":0.02851152,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02153618353391824,"score_gpt":0.3025726694849464,"score_spread":0.2810364859510282,"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."}}