{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E3HMSGWU3GWLOYMPK7ENBY3TM3","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":"3df3752bde0e1319d04dc7c161445f0c6845c73a88bfb69c23f58814531e0efa","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-18T16:34:49Z","title_canon_sha256":"ef24adef2c9f8616b44494ea479a05c5b60737c8856bcedd36e98cadb346f6ec"},"schema_version":"1.0","source":{"id":"2607.16879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.16879","created_at":"2026-07-21T01:21:03Z"},{"alias_kind":"arxiv_version","alias_value":"2607.16879v1","created_at":"2026-07-21T01:21:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16879","created_at":"2026-07-21T01:21:03Z"},{"alias_kind":"pith_short_12","alias_value":"E3HMSGWU3GWL","created_at":"2026-07-21T01:21:03Z"},{"alias_kind":"pith_short_16","alias_value":"E3HMSGWU3GWLOYMP","created_at":"2026-07-21T01:21:03Z"},{"alias_kind":"pith_short_8","alias_value":"E3HMSGWU","created_at":"2026-07-21T01:21:03Z"}],"graph_snapshots":[{"event_id":"sha256:2a6489a4ce1836e07d53220afefb5a3812670c35604916420d05787c18389550","target":"graph","created_at":"2026-07-21T01:21:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.16879/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study variants of graph colouring with parity constraints. More specifically, we consider $q$-colourings $c\\colon V(G)\\rightarrow \\{1,\\dots,q\\}$ of a graph $G$ where, for every vertex $v\\in V(G)$, the number of neighbours $w$ of $v$ with $c(w)=c(v)$ is restricted to be odd, even, positive, zero or a combination thereof. For every colour $i\\neq c(v)$ the number of neighbours $w$ of $v$ with $c(w)=i$ is restricted by a constraint of similar type. Many known colouring problems such as proper colouring, defective colouring, exact defective colouring, odd colouring, and strong odd colouring can ","authors_text":"Haiko M\\\"uller, Juan Pablo Bravo, Noleen K\\\"ohler, R\\'emy Belmonte","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-18T16:34:49Z","title":"Complexity Classification of Colouring Problems with Parity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16879","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:4588b5f9227848b4a28f25d8796cf38eb0494a9edcf88f3b2b48a1961c11ebff","target":"record","created_at":"2026-07-21T01:21:03Z","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":"3df3752bde0e1319d04dc7c161445f0c6845c73a88bfb69c23f58814531e0efa","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-18T16:34:49Z","title_canon_sha256":"ef24adef2c9f8616b44494ea479a05c5b60737c8856bcedd36e98cadb346f6ec"},"schema_version":"1.0","source":{"id":"2607.16879","kind":"arxiv","version":1}},"canonical_sha256":"26cec91ad4d9acb7618f57c8d0e37366cf3e5b84a8bd37af186cb2b91a796462","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26cec91ad4d9acb7618f57c8d0e37366cf3e5b84a8bd37af186cb2b91a796462","first_computed_at":"2026-07-21T01:21:03.610554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:21:03.610554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c5Ni72VWZJDoCajIH5P1jwUJkOgbCRf+1oB6uNh09SsqAlKe8rvYHuvZoahJ+PsUcVjAU3aXdPo5JfqQAENRCQ==","signature_status":"signed_v1","signed_at":"2026-07-21T01:21:03.611443Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.16879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4588b5f9227848b4a28f25d8796cf38eb0494a9edcf88f3b2b48a1961c11ebff","sha256:2a6489a4ce1836e07d53220afefb5a3812670c35604916420d05787c18389550"],"state_sha256":"68420cfbf99bc85a7adc86a9f2a1ee7dbc9aa441acfc0c11f738d8a03174d86e"}