{"id":"W3170248899","doi":"10.1145/3519935.3520075","title":"Complexity classification of counting graph homomorphisms modulo a prime number","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Modulo; Conjecture; Counting problem; Mathematics; Prime (order theory); Combinatorics; Discrete mathematics; Constraint satisfaction problem; Graph homomorphism; Graph; Prime number; Computer science; Line graph; Voltage graph; Statistics","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.00223818,0.00101577,0.001837099,0.002414537,0.001836398,0.006322166,0.002972683,0.00249538,0.007250501],"category_scores_gemma":[0.02112126,0.0006733692,0.001825475,0.003078413,0.003934766,0.01272911,0.002609238,0.00524521,0.0005407383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004115634,"about_ca_system_score_gemma":0.001768938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00215084,"about_ca_topic_score_gemma":0.001472495,"domain_scores_codex":[0.9955738,0.0009524573,0.0002082302,0.00154614,0.001137662,0.0005816982],"domain_scores_gemma":[0.9689615,0.02370752,0.002409625,0.002507319,0.000910647,0.001503347],"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.0005916366,0.0004011992,0.01111675,0.0006329605,0.000168399,0.0004014951,0.001309453,0.04771641,0.005609022,0.8671018,0.01344666,0.05150419],"study_design_scores_gemma":[0.00007838965,0.0000447137,0.001938645,0.00002888319,0.00006177456,0.0002406899,0.0001519142,0.1290018,0.001677556,0.8644905,0.002241945,0.00004305134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7719817,0.001928047,0.1812104,0.01113997,0.0002261411,0.0002159953,0.002280648,0.001178843,0.02983834],"genre_scores_gemma":[0.9515579,0.0008440474,0.03676656,0.0006989122,0.0008449648,0.0002121347,0.002518193,0.0002762508,0.006280934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007250501,"threshold_uncertainty_score":0.02986121,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09513486052490078,"score_gpt":0.3465210272567365,"score_spread":0.2513861667318357,"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."}}