{"id":"W7110393708","doi":"10.4230/lipics.stacs.2025.60","title":"Modular Counting CSP: Reductions and Algorithms","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Constraint satisfaction problem; Automorphism; Prime (order theory); Counting problem; Modular design; Focus (optics); Binary number; Binary tree","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.002040204,0.001442263,0.001280736,0.001536158,0.001389571,0.003365483,0.003517378,0.00154754,0.01114939],"category_scores_gemma":[0.01101006,0.000735495,0.002779331,0.003156526,0.00205851,0.005823879,0.00494547,0.005618448,0.002687679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003128442,"about_ca_system_score_gemma":0.002564524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002317211,"about_ca_topic_score_gemma":0.002961697,"domain_scores_codex":[0.9970722,0.0009197199,0.0001454965,0.0006300151,0.0008882044,0.0003442824],"domain_scores_gemma":[0.9949845,0.003114208,0.0002609628,0.001103724,0.0003431126,0.0001935151],"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.0001438398,0.0002305826,0.0004263558,0.0003345229,0.00004914375,0.0001218343,0.0002730844,0.04459367,0.002004588,0.7917893,0.01921123,0.1408218],"study_design_scores_gemma":[0.00005276887,0.00002253979,0.0001321264,0.0000382664,0.00002980142,0.0001164957,0.00005508643,0.1295166,0.001507071,0.8592659,0.009243675,0.0000197607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02451978,0.0009942048,0.9301909,0.002913532,0.0002401308,0.0003734089,0.0007884953,0.001849163,0.03813042],"genre_scores_gemma":[0.2663378,0.001438963,0.7044376,0.001192975,0.0007287647,0.0008290852,0.003013287,0.001235575,0.02078592],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01114939,"threshold_uncertainty_score":0.03729838,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00780693320543484,"score_gpt":0.2495654126293743,"score_spread":0.2417584794239394,"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."}}