{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GMLTBMZ3KQYSQKMKRON3JI3GSN","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":"568429da7d083150f7921f217a6b197e4b6e8e8a8604baef7a2103a77377066d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T15:33:30Z","title_canon_sha256":"acf23d742aeb2259f6cbc53925163f49b650a57e2b3865ec91f972ba96ab1f07"},"schema_version":"1.0","source":{"id":"2606.21534","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21534","created_at":"2026-06-23T01:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21534v1","created_at":"2026-06-23T01:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21534","created_at":"2026-06-23T01:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"GMLTBMZ3KQYS","created_at":"2026-06-23T01:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"GMLTBMZ3KQYSQKMK","created_at":"2026-06-23T01:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"GMLTBMZ3","created_at":"2026-06-23T01:13:13Z"}],"graph_snapshots":[{"event_id":"sha256:9f7d728cbcf21aaee6659570a219dae48153560686c08e6c476bf78c1565f7fa","target":"graph","created_at":"2026-06-23T01:13:13Z","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/2606.21534/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is conformable if it admits a proper $(\\Delta(G)+1)$-coloring in which, among the $\\Delta(G)+1$ color classes including the empty ones, at most $\\sum_{v\\in V(G)}(\\Delta(G)-d_G(v))$ have parity different from that of $|V(G)|$. The complexity of deciding conformability was left open in recent work, and positive results for several graph classes had suggested that the problem might be polynomial-time solvable. We settle the general problem by proving that Conformability is NP-complete. Hardness holds even for connected regular graphs $G$ of odd order with independence number $\\alpha(G","authors_text":"J\\'ozsef Pint\\'er","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T15:33:30Z","title":"Conformability is NP-complete, even on connected regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21534","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:674fd2ce9cb944971fc3d3cb456e83d6ba1627d0d0efaf47cdc811ab45a0fc7a","target":"record","created_at":"2026-06-23T01:13:13Z","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":"568429da7d083150f7921f217a6b197e4b6e8e8a8604baef7a2103a77377066d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T15:33:30Z","title_canon_sha256":"acf23d742aeb2259f6cbc53925163f49b650a57e2b3865ec91f972ba96ab1f07"},"schema_version":"1.0","source":{"id":"2606.21534","kind":"arxiv","version":1}},"canonical_sha256":"331730b33b543128298a8b9bb4a366934fa288f3299a37491e92cdfaa19546d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"331730b33b543128298a8b9bb4a366934fa288f3299a37491e92cdfaa19546d6","first_computed_at":"2026-06-23T01:13:13.728543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:13:13.728543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q2d3/0g0PxNSGN3xNG4ac6KsJIgNxDw21aLgj+3JwqjfEHF/Spl5W9GG6jtwSi1UjcL0crsoTFcryUpWqmSxBQ==","signature_status":"signed_v1","signed_at":"2026-06-23T01:13:13.728993Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21534","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:674fd2ce9cb944971fc3d3cb456e83d6ba1627d0d0efaf47cdc811ab45a0fc7a","sha256:9f7d728cbcf21aaee6659570a219dae48153560686c08e6c476bf78c1565f7fa"],"state_sha256":"8fc6241014f12c075325fd1c0f938563c6eb2373b341e75b1d6a3cadb02f05b2"}