{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JGFCQKHZPPGS7DK6SXWU6GHPSU","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":"ded8c562b4bbe8e14530e825cc81c180c3f86cf677aa11a2aeab8d3fa6a3e369","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-04T15:18:12Z","title_canon_sha256":"301b92f3a94ee32786ad4704a1e22b2a32d496bba0c5b7f484a990edd0706421"},"schema_version":"1.0","source":{"id":"1604.00905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00905","created_at":"2026-05-18T01:17:38Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00905v2","created_at":"2026-05-18T01:17:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00905","created_at":"2026-05-18T01:17:38Z"},{"alias_kind":"pith_short_12","alias_value":"JGFCQKHZPPGS","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JGFCQKHZPPGS7DK6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JGFCQKHZ","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:a162736da8096dad815a525e574ee29020bee8937321c39779e7bce63dc72770","target":"graph","created_at":"2026-05-18T01:17:38Z","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 sharpen the result that polarity and monopolarity are NP-complete problems by showing that they remain NP-complete if the input graph is restricted to be a $3$-colourable comparability graph. We start by presenting a construction reducing $1$-$3$-SAT to monopolarity of $3$-colourable comparability graphs. Then we show that polarity is at least as hard as monopolarity for input graphs restricted to a fixed disjoint-union-closed class. We conclude the paper by stating that both polarity and monopolarity of $3$-colourable comparability graphs are NP-complete problems.","authors_text":"Nikola Yolov","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-04T15:18:12Z","title":"Polarity and Monopolarity of $3$-colourable comparability graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00905","kind":"arxiv","version":2},"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:2d4c9367c13192e9b4866b713abc45b6ef339d4915febdcdbc2325c4c8e13ade","target":"record","created_at":"2026-05-18T01:17:38Z","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":"ded8c562b4bbe8e14530e825cc81c180c3f86cf677aa11a2aeab8d3fa6a3e369","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-04T15:18:12Z","title_canon_sha256":"301b92f3a94ee32786ad4704a1e22b2a32d496bba0c5b7f484a990edd0706421"},"schema_version":"1.0","source":{"id":"1604.00905","kind":"arxiv","version":2}},"canonical_sha256":"498a2828f97bcd2f8d5e95ed4f18ef953d87b43b7ec4b657d0ecccd38c479f5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"498a2828f97bcd2f8d5e95ed4f18ef953d87b43b7ec4b657d0ecccd38c479f5a","first_computed_at":"2026-05-18T01:17:38.860828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:38.860828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qEYfao+Z08MaCaYu6zam7OGZsqWBfGaK7gzIp7ILQg2ah+KY53pw1gy4y63qnOGRkLLvwXADTXnOaVSqAgixBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:38.861514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d4c9367c13192e9b4866b713abc45b6ef339d4915febdcdbc2325c4c8e13ade","sha256:a162736da8096dad815a525e574ee29020bee8937321c39779e7bce63dc72770"],"state_sha256":"fdaef04273d422fb2c79218f97c90877c3519f26dddf053c685d3c580f637f86"}