{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SADMVCY3263ILJUI2CHIOFXGYC","short_pith_number":"pith:SADMVCY3","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"},"canonical_sha256":"9006ca8b1bd7b685a688d08e8716e6c080d5569e1b6886bb0742bb2f1fe35a84","source":{"kind":"arxiv","id":"1408.3935","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SADMVCY3263ILJUI2CHIOFXGYC","target":"record","payload":{"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"},"canonical_sha256":"9006ca8b1bd7b685a688d08e8716e6c080d5569e1b6886bb0742bb2f1fe35a84","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"},"source_kind":"arxiv","source_id":"1408.3935","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/w/svE7RQDnQE58c3FGV+vYy9F+kHd7ih2YgNRvn/6zJVYulikJ7XLJzOhLWJIaeeGMvR73biKjg12wLFs7CCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:05:23.859236Z"},"content_sha256":"b8d15115905601cb2e4f44ef3f521e9690c6a87b09e4677802c0e28d0dabc626","schema_version":"1.0","event_id":"sha256:b8d15115905601cb2e4f44ef3f521e9690c6a87b09e4677802c0e28d0dabc626"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SADMVCY3263ILJUI2CHIOFXGYC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYtf+O/KfqJbbE6d3SuC9RNIUmWpXCa8GdOFsg0ubROMrlYnivSAd6YsYvK0Csbr0Vd/dJ1dCESxEYTDmoi5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:05:23.859724Z"},"content_sha256":"61f40d6f8504d96f811b5871c4481177d4e43851fc83775d664fc1e45bb1e97c","schema_version":"1.0","event_id":"sha256:61f40d6f8504d96f811b5871c4481177d4e43851fc83775d664fc1e45bb1e97c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC/bundle.json","state_url":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SADMVCY3263ILJUI2CHIOFXGYC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T12:05:23Z","links":{"resolver":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC","bundle":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC/bundle.json","state":"https://pith.science/pith/SADMVCY3263ILJUI2CHIOFXGYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SADMVCY3263ILJUI2CHIOFXGYC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIrh11Z5yqWAdePZbeuQ+MNU449bpsZN4IUTQQokso2xhP+fb5BVSRgaJy1BVFt6icOeFY5pJowHVQw7Mvh/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:05:23.862023Z","bundle_sha256":"76e41fb724b180360557d15b3d6aac6db2ba60dcd400fb07a87fc9bdb1fbf7c4"}}