{"id":"W2946703759","doi":"10.4230/lipics.mfcs.2019.59","title":"Counting Homomorphisms Modulo a Prime Number","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Combinatorics; Modulo; Mathematics; Discrete mathematics; Graph homomorphism; Graph; Prime (order theory); Prime number; Graph power; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.00335145,0.001304118,0.002011182,0.002723134,0.002264206,0.005409231,0.003099822,0.002538048,0.007826264],"category_scores_gemma":[0.02661857,0.001055823,0.001881644,0.003542047,0.005046482,0.02248602,0.004455233,0.004883042,0.0009775953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002804527,"about_ca_system_score_gemma":0.001971807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001171335,"about_ca_topic_score_gemma":0.0008971654,"domain_scores_codex":[0.9934198,0.001708265,0.0004386351,0.002371527,0.001401018,0.0006608007],"domain_scores_gemma":[0.9658965,0.02509678,0.002381431,0.00397813,0.001193629,0.001453584],"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.0009363614,0.0004251472,0.01134764,0.001103424,0.0002414714,0.000726058,0.001591714,0.059567,0.008043926,0.7488096,0.02087365,0.1463339],"study_design_scores_gemma":[0.00005982236,0.00005924134,0.0007835108,0.00003998955,0.00005647492,0.0003919966,0.0001931913,0.06137321,0.002874005,0.929519,0.004608395,0.0000410713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5181272,0.002980839,0.4295257,0.01270909,0.0006189241,0.0004670809,0.002907073,0.002007743,0.03065628],"genre_scores_gemma":[0.8160205,0.001665314,0.1648336,0.001354883,0.001402494,0.0004652336,0.003337969,0.0004181679,0.01050187],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007826264,"threshold_uncertainty_score":0.02618146,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02275254421978275,"score_gpt":0.2976397857648421,"score_spread":0.2748872415450593,"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."}}