{"id":"W1521918479","doi":"10.37236/976","title":"Matrix Partitions with Finitely Many Obstructions","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Matrix (chemical analysis); Diagonal; Characterization (materials science); Induced subgraph; Graph; Finite set; Block matrix; Discrete mathematics; Diagonal matrix; Eigenvalues and eigenvectors","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.0007689148,0.0005770266,0.0006499791,0.0007724271,0.001582252,0.00262254,0.0009830086,0.001063888,0.009876777],"category_scores_gemma":[0.007393181,0.0004961643,0.001057166,0.001026094,0.002504753,0.004079381,0.002430798,0.001826141,0.0009923758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001007775,"about_ca_system_score_gemma":0.0007233263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008542427,"about_ca_topic_score_gemma":0.00126498,"domain_scores_codex":[0.9984058,0.0003613481,0.0001241666,0.0003987773,0.0003821599,0.0003278022],"domain_scores_gemma":[0.9936579,0.003386116,0.000856061,0.001192566,0.000372818,0.0005346321],"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.0002816529,0.000174634,0.002009085,0.000148199,0.00003051815,0.0004446848,0.0007512142,0.02037267,0.008651974,0.9463913,0.003169396,0.01757455],"study_design_scores_gemma":[0.00006323415,0.00008032419,0.0007728828,0.00002151189,0.00002355775,0.0004731086,0.000312492,0.07277243,0.006514157,0.9141628,0.004759786,0.00004382262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6981134,0.0001579702,0.2742828,0.001088117,0.00008068114,0.0001533681,0.000615438,0.000701205,0.02480711],"genre_scores_gemma":[0.9326602,0.0001184389,0.05778044,0.0001691592,0.00008220341,0.0002279351,0.0009213966,0.0001577429,0.007882427],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009876777,"threshold_uncertainty_score":0.03304112,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01056754447556898,"score_gpt":0.2827804071419084,"score_spread":0.2722128626663395,"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."}}