{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002211731,0.001726774,0.00180255,0.002159215,0.00164031,0.008099842,0.003608109,0.002698331,0.008365029],"category_scores_gemma":[0.0144412,0.001259784,0.002236046,0.003963204,0.002763252,0.0137152,0.003557781,0.005033792,0.001485974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00610919,"about_ca_system_score_gemma":0.002658513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004723096,"about_ca_topic_score_gemma":0.005246645,"domain_scores_codex":[0.9961333,0.001096339,0.0002292814,0.001047534,0.001021861,0.0004717025],"domain_scores_gemma":[0.9877138,0.009109672,0.0007469094,0.001529402,0.0005746741,0.0003254959],"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.0004308615,0.0004670428,0.003420903,0.001046696,0.0001930854,0.0001485887,0.0008833233,0.1771078,0.003794311,0.6199022,0.02317663,0.1694285],"study_design_scores_gemma":[0.00007477658,0.00003199758,0.0004392146,0.00004048296,0.00002710856,0.0001367986,0.0001270489,0.3336852,0.001088193,0.6599811,0.004342068,0.00002607957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1591912,0.00773742,0.7870411,0.0102986,0.0002787445,0.000657814,0.002601766,0.003312032,0.02888133],"genre_scores_gemma":[0.4826844,0.004779504,0.4902446,0.0009751513,0.0007161715,0.0009144554,0.004823012,0.0007352016,0.01412758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008365029,"threshold_uncertainty_score":0.04432553,"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."}}