{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001917642,0.0001154308,0.0001589335,0.000229591,0.0003230904,0.00007549255,0.001296931,0.00003852706,0.000008444622],"category_scores_gemma":[0.0000803931,0.00007305641,0.00008971119,0.001341345,0.000132021,0.0004667629,0.00009028811,0.0009196819,0.00001379296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000243395,"about_ca_system_score_gemma":0.0003935967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001444504,"about_ca_topic_score_gemma":0.000006391764,"domain_scores_codex":[0.9981528,0.0001077596,0.0003318948,0.0001181432,0.000581587,0.0007078116],"domain_scores_gemma":[0.9982775,0.0004694174,0.0002757919,0.0004561093,0.0004004386,0.0001206893],"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.00004254605,0.00006649643,0.0001675519,0.000002253843,0.00004581775,0.00002766188,0.0001383647,0.0002860644,0.0001327701,0.9980206,0.0001072908,0.0009626041],"study_design_scores_gemma":[0.0005289093,0.0006941525,0.0007940733,0.00001222602,0.00001767116,0.001037664,0.0001147397,0.0001866605,0.001508442,0.9893789,0.00562606,0.0001004652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08199678,0.001316212,0.913862,0.001323423,0.0002780809,0.00009790491,3.870056e-7,0.00003578389,0.001089454],"genre_scores_gemma":[0.9981484,0.0002054465,0.001093421,0.00004285711,0.00006543291,0.000002029986,1.81454e-7,0.00001207819,0.0004300876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9161517,"threshold_uncertainty_score":0.3995611,"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."}}