{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4ZS5IGCC2LK76JDBFQQQFHPJX3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0ae82ff07acb722b6830133432af830530457e2e51017e283ee493ee9753d05f","cross_cats_sorted":["cs.DS","cs.IT","cs.LO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-13T04:49:40Z","title_canon_sha256":"b45fc73fd9039cc22c43c237703f641bd584e245100b948bd9c9f161e7f196c3"},"schema_version":"1.0","source":{"id":"1902.04740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04740","created_at":"2026-05-17T23:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04740v1","created_at":"2026-05-17T23:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04740","created_at":"2026-05-17T23:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"4ZS5IGCC2LK7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4ZS5IGCC2LK76JDB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4ZS5IGCC","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c3aa0792d68fe96b94742b7153c4c210415f7f96e0ef017e68cf17a9baf6c207","target":"graph","created_at":"2026-05-17T23:54:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the complexity of Boolean constraint satisfaction problems (CSPs) when the assignment must have Hamming weight in some congruence class modulo M, for various choices of the modulus M. Due to the known classification of tractable Boolean CSPs, this mainly reduces to the study of three cases: 2-SAT, HORN-SAT, and LIN-2 (linear equations mod 2). We classify the moduli M for which these respective problems are polynomial time solvable, and when they are not (assuming the ETH). Our study reveals that this modular constraint lends a surprising richness to these classic, well-studied problem","authors_text":"Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami","cross_cats":["cs.DS","cs.IT","cs.LO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-13T04:49:40Z","title":"CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04740","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5f45fbe802ac60572fef2e932598d67004b16ca070ba23b00fcb25d5e5eaa0f1","target":"record","created_at":"2026-05-17T23:54:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0ae82ff07acb722b6830133432af830530457e2e51017e283ee493ee9753d05f","cross_cats_sorted":["cs.DS","cs.IT","cs.LO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-13T04:49:40Z","title_canon_sha256":"b45fc73fd9039cc22c43c237703f641bd584e245100b948bd9c9f161e7f196c3"},"schema_version":"1.0","source":{"id":"1902.04740","kind":"arxiv","version":1}},"canonical_sha256":"e665d41842d2d5ff24612c21029de9bef1f1d54898dc6cf1f60af4da3ad727c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e665d41842d2d5ff24612c21029de9bef1f1d54898dc6cf1f60af4da3ad727c0","first_computed_at":"2026-05-17T23:54:06.113579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:06.113579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KuRsJxAB6YbpotEf8HEKoW5qQa8O0+DtYGvTifdvgwis91GxcMhH4e3wm45AMlkmSHrjfE4HbFuuFVfn5C7WAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:06.114187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f45fbe802ac60572fef2e932598d67004b16ca070ba23b00fcb25d5e5eaa0f1","sha256:c3aa0792d68fe96b94742b7153c4c210415f7f96e0ef017e68cf17a9baf6c207"],"state_sha256":"eeff284ba1adb5a8457a6488b94945219acd1cd4c4f27887975e63d03b4303a0"}