{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SADMVCY3263ILJUI2CHIOFXGYC","short_pith_number":"pith:SADMVCY3","schema_version":"1.0","canonical_sha256":"9006ca8b1bd7b685a688d08e8716e6c080d5569e1b6886bb0742bb2f1fe35a84","source":{"kind":"arxiv","id":"1408.3935","version":2},"attestation_state":"computed","paper":{"title":"Coloring clique-hypergraph of $K_5$-minor-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erfang Shan, Liying Kang, Yuxiao Sun","submitted_at":"2014-08-18T08:50:55Z","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"},"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":"1408.3935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T08:50:55Z","cross_cats_sorted":[],"title_canon_sha256":"8723499caea5c9626decfb0980809435322540aabd6e25104dc6d18db402c66b","abstract_canon_sha256":"2e07ddbdad130a28bfe9c10b1f7ec852b2c7d2b6efe8795a3485aa98f1c85f41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:41.776275Z","signature_b64":"rQcW0sZUZgJwLIjVk0PkdPbqWdyzG7hDTkWmFdfQQL/IIU2L9BeU9A6BY7tBuDwHKpPveyuxnNEImfwNFLz5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9006ca8b1bd7b685a688d08e8716e6c080d5569e1b6886bb0742bb2f1fe35a84","last_reissued_at":"2026-05-18T02:44:41.775866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:41.775866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring clique-hypergraph of $K_5$-minor-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erfang Shan, Liying Kang, Yuxiao Sun","submitted_at":"2014-08-18T08:50:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3935","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1408.3935","created_at":"2026-05-18T02:44:41.775930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3935v2","created_at":"2026-05-18T02:44:41.775930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3935","created_at":"2026-05-18T02:44:41.775930+00:00"},{"alias_kind":"pith_short_12","alias_value":"SADMVCY3263I","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SADMVCY3263ILJUI","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SADMVCY3","created_at":"2026-05-18T12:28:49.207871+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/SADMVCY3263ILJUI2CHIOFXGYC","json":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC.json","graph_json":"https://pith.science/api/pith-number/SADMVCY3263ILJUI2CHIOFXGYC/graph.json","events_json":"https://pith.science/api/pith-number/SADMVCY3263ILJUI2CHIOFXGYC/events.json","paper":"https://pith.science/paper/SADMVCY3"},"agent_actions":{"view_html":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC","download_json":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC.json","view_paper":"https://pith.science/paper/SADMVCY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3935&json=true","fetch_graph":"https://pith.science/api/pith-number/SADMVCY3263ILJUI2CHIOFXGYC/graph.json","fetch_events":"https://pith.science/api/pith-number/SADMVCY3263ILJUI2CHIOFXGYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC/action/storage_attestation","attest_author":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC/action/author_attestation","sign_citation":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC/action/citation_signature","submit_replication":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC/action/replication_record"}},"created_at":"2026-05-18T02:44:41.775930+00:00","updated_at":"2026-05-18T02:44:41.775930+00:00"}