{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SADMVCY3263ILJUI2CHIOFXGYC","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":"2e07ddbdad130a28bfe9c10b1f7ec852b2c7d2b6efe8795a3485aa98f1c85f41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T08:50:55Z","title_canon_sha256":"8723499caea5c9626decfb0980809435322540aabd6e25104dc6d18db402c66b"},"schema_version":"1.0","source":{"id":"1408.3935","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3935","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3935v2","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3935","created_at":"2026-05-18T02:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"SADMVCY3263I","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SADMVCY3263ILJUI","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SADMVCY3","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:61f40d6f8504d96f811b5871c4481177d4e43851fc83775d664fc1e45bb1e97c","target":"graph","created_at":"2026-05-18T02:44:41Z","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":"A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $\\mathcal{H}(G)$, of a graph $G$ has $V(G)$ as its set of vertices and the maximal cliques of $G$ as its hyperedges. A (vertex) coloring of $\\mathcal{H}(G)$ is a clique-coloring of $G$. The clique-chromatic number of $G$ is the least number of colors for which $G$ admits a clique-coloring. Every planar graph has been proved to be 3-clique-colorable (Electr. J. Combin. 6 (1999), \\#R26). Recently, we showed that every claw-free planar graph","authors_text":"Erfang Shan, Liying Kang, Yuxiao Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T08:50:55Z","title":"Coloring clique-hypergraph of $K_5$-minor-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3935","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:b8d15115905601cb2e4f44ef3f521e9690c6a87b09e4677802c0e28d0dabc626","target":"record","created_at":"2026-05-18T02:44:41Z","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":"2e07ddbdad130a28bfe9c10b1f7ec852b2c7d2b6efe8795a3485aa98f1c85f41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T08:50:55Z","title_canon_sha256":"8723499caea5c9626decfb0980809435322540aabd6e25104dc6d18db402c66b"},"schema_version":"1.0","source":{"id":"1408.3935","kind":"arxiv","version":2}},"canonical_sha256":"9006ca8b1bd7b685a688d08e8716e6c080d5569e1b6886bb0742bb2f1fe35a84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9006ca8b1bd7b685a688d08e8716e6c080d5569e1b6886bb0742bb2f1fe35a84","first_computed_at":"2026-05-18T02:44:41.775866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:41.775866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rQcW0sZUZgJwLIjVk0PkdPbqWdyzG7hDTkWmFdfQQL/IIU2L9BeU9A6BY7tBuDwHKpPveyuxnNEImfwNFLz5AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:41.776275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3935","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8d15115905601cb2e4f44ef3f521e9690c6a87b09e4677802c0e28d0dabc626","sha256:61f40d6f8504d96f811b5871c4481177d4e43851fc83775d664fc1e45bb1e97c"],"state_sha256":"5eb24fccc0064e09687fa00ea92f14603487241b1fdac4d2a401ab08234e2ffa"}