{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:E3HMSGWU3GWLOYMPK7ENBY3TM3","short_pith_number":"pith:E3HMSGWU","schema_version":"1.0","canonical_sha256":"26cec91ad4d9acb7618f57c8d0e37366cf3e5b84a8bd37af186cb2b91a796462","source":{"kind":"arxiv","id":"2607.16879","version":1},"attestation_state":"computed","paper":{"title":"Complexity Classification of Colouring Problems with Parity Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Haiko M\\\"uller, Juan Pablo Bravo, Noleen K\\\"ohler, R\\'emy Belmonte","submitted_at":"2026-07-18T16:34:49Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.16879","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-18T16:34:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ef24adef2c9f8616b44494ea479a05c5b60737c8856bcedd36e98cadb346f6ec","abstract_canon_sha256":"3df3752bde0e1319d04dc7c161445f0c6845c73a88bfb69c23f58814531e0efa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:03.611443Z","signature_b64":"c5Ni72VWZJDoCajIH5P1jwUJkOgbCRf+1oB6uNh09SsqAlKe8rvYHuvZoahJ+PsUcVjAU3aXdPo5JfqQAENRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26cec91ad4d9acb7618f57c8d0e37366cf3e5b84a8bd37af186cb2b91a796462","last_reissued_at":"2026-07-21T01:21:03.610554Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:03.610554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Classification of Colouring Problems with Parity Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Haiko M\\\"uller, Juan Pablo Bravo, Noleen K\\\"ohler, R\\'emy Belmonte","submitted_at":"2026-07-18T16:34:49Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16879","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.16879/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.16879","created_at":"2026-07-21T01:21:03.611003+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.16879v1","created_at":"2026-07-21T01:21:03.611003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16879","created_at":"2026-07-21T01:21:03.611003+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3HMSGWU3GWL","created_at":"2026-07-21T01:21:03.611003+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3HMSGWU3GWLOYMP","created_at":"2026-07-21T01:21:03.611003+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3HMSGWU","created_at":"2026-07-21T01:21:03.611003+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E3HMSGWU3GWLOYMPK7ENBY3TM3","json":"https://pith.science/pith/E3HMSGWU3GWLOYMPK7ENBY3TM3.json","graph_json":"https://pith.science/api/pith-number/E3HMSGWU3GWLOYMPK7ENBY3TM3/graph.json","events_json":"https://pith.science/api/pith-number/E3HMSGWU3GWLOYMPK7ENBY3TM3/events.json","paper":"https://pith.science/paper/E3HMSGWU"},"agent_actions":{"view_html":"https://pith.science/pith/E3HMSGWU3GWLOYMPK7ENBY3TM3","download_json":"https://pith.science/pith/E3HMSGWU3GWLOYMPK7ENBY3TM3.json","view_paper":"https://pith.science/paper/E3HMSGWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.16879&json=true","fetch_graph":"https://pith.science/api/pith-number/E3HMSGWU3GWLOYMPK7ENBY3TM3/graph.json","fetch_events":"https://pith.science/api/pith-number/E3HMSGWU3GWLOYMPK7ENBY3TM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3HMSGWU3GWLOYMPK7ENBY3TM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3HMSGWU3GWLOYMPK7ENBY3TM3/action/storage_attestation","attest_author":"https://pith.science/pith/E3HMSGWU3GWLOYMPK7ENBY3TM3/action/author_attestation","sign_citation":"https://pith.science/pith/E3HMSGWU3GWLOYMPK7ENBY3TM3/action/citation_signature","submit_replication":"https://pith.science/pith/E3HMSGWU3GWLOYMPK7ENBY3TM3/action/replication_record"}},"created_at":"2026-07-21T01:21:03.611003+00:00","updated_at":"2026-07-21T01:21:03.611003+00:00"}