{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003707036,0.0002100156,0.0002338505,0.0003238078,0.0004967984,0.000539126,0.0003927162,0.0001293469,0.00001730613],"category_scores_gemma":[0.00009032928,0.0002097514,0.00009627669,0.0004491753,0.0001055316,0.001613036,0.0002489596,0.0002253553,0.00002128093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008291999,"about_ca_system_score_gemma":0.00009337843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001367322,"about_ca_topic_score_gemma":0.00000896498,"domain_scores_codex":[0.9985239,0.00002216615,0.0006246466,0.0002389602,0.0002280789,0.0003622575],"domain_scores_gemma":[0.9989211,0.00008151661,0.0001997376,0.0004504834,0.0002472299,0.00009996063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004673105,0.0003428978,0.01254128,0.0008982992,0.0004630848,0.00000562079,0.01199648,0.005604677,0.0003883432,0.3595513,0.01190773,0.5962535],"study_design_scores_gemma":[0.001667979,0.0000562575,0.00422913,0.00013062,0.0000330389,0.00006534016,0.0009157421,0.9050597,0.0004315937,0.002678851,0.0843519,0.0003798458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01469994,0.00004837041,0.9754194,0.001444924,0.001243536,0.0005517374,0.00006213091,0.0002646458,0.006265307],"genre_scores_gemma":[0.643428,0.000171615,0.3517215,0.002372158,0.0001508561,0.0001417568,0.0001983311,0.00002846808,0.001787233],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.899455,"threshold_uncertainty_score":0.8553414,"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."}}