{"id":"W7002292107","doi":"","title":"Matrix Partitions of Graphs: Algorithms and Complexity","year":2016,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Data Analysis with R","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Simon Fraser University; Strong","keywords":"Graph homomorphism; Homomorphism; Bipartite graph; Time complexity; Computational complexity theory; Approximation algorithm; Partition (number theory); Graph; Regular polygon","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001169819,0.0002440029,0.0004016631,0.0008635937,0.0001910557,0.00006321619,0.001183594,0.0001909746,0.00009874953],"category_scores_gemma":[0.00002059772,0.0002409138,0.000172757,0.001071693,0.0001550305,0.0007464185,0.0002023506,0.0001772719,0.00004617732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005413903,"about_ca_system_score_gemma":0.0001153072,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002849378,"about_ca_topic_score_gemma":0.02829984,"domain_scores_codex":[0.9985061,0.00009833579,0.0002396046,0.000575098,0.0003280305,0.0002528394],"domain_scores_gemma":[0.9984312,0.00008270194,0.0003223773,0.000779457,0.0002296959,0.0001545654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000210196,0.00068224,0.201748,0.0007543328,0.001645401,0.0005588435,0.0003353667,0.00002139183,0.0001424259,0.6605867,0.08929719,0.04401797],"study_design_scores_gemma":[0.008501722,0.0009480276,0.05771245,0.002285966,0.003179506,1.542942e-7,0.03448347,0.007026627,0.0168429,0.1579098,0.7050407,0.006068732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5945145,0.002330708,0.2590607,0.001831442,0.003886198,0.00207707,0.004915236,0.001438501,0.1299456],"genre_scores_gemma":[0.8780627,0.002140219,0.03781196,0.0001344248,0.0001662113,0.000006097414,0.004360212,0.0000983636,0.07721976],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6157435,"threshold_uncertainty_score":0.9894311,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.020399275165071,"score_gpt":0.2463460873362829,"score_spread":0.2259468121712119,"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."}}