{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TEP2NBRITO6BZVJJLEILG7HHEW","short_pith_number":"pith:TEP2NBRI","canonical_record":{"source":{"id":"1611.01782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-06T13:55:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d3751a45c28f01ac9ee2be5015840d58d933454cde965e3da612eb55f1716637","abstract_canon_sha256":"9cf9d24e8a1c098ea10f6a5180a3c73333aaaf2353215a32f65ca06def302b6c"},"schema_version":"1.0"},"canonical_sha256":"991fa686289bbc1cd5295910b37ce725b6fad71163cbc9803bbf2a5b23743a29","source":{"kind":"arxiv","id":"1611.01782","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01782","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01782v1","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01782","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"TEP2NBRITO6B","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TEP2NBRITO6BZVJJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TEP2NBRI","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TEP2NBRITO6BZVJJLEILG7HHEW","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-06T13:55:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d3751a45c28f01ac9ee2be5015840d58d933454cde965e3da612eb55f1716637","abstract_canon_sha256":"9cf9d24e8a1c098ea10f6a5180a3c73333aaaf2353215a32f65ca06def302b6c"},"schema_version":"1.0"},"canonical_sha256":"991fa686289bbc1cd5295910b37ce725b6fad71163cbc9803bbf2a5b23743a29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:04.487804Z","signature_b64":"K2cCLFI0dnIBf2Rtb27fGVRrF9Ytml3hMzFxs5qLRbfLWm8uiIeRJF4h0kyLIqBY/5/JowvSS5TFC2FwpDeqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"991fa686289bbc1cd5295910b37ce725b6fad71163cbc9803bbf2a5b23743a29","last_reissued_at":"2026-05-18T01:00:04.487183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:04.487183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01782","source_version":1,"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-18T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QQamnP5YtnRx8I/AEeH2hyYCagO1LxAbPkgotUj15b5vxjsKGYWwc2IyX1f+QJlrT1oY23ucpKEw9l5bOvDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:15:11.814587Z"},"content_sha256":"c080e6e3925ff8866e05824d35b99ff4c3dd678e75cc248c58c00932b4237f25","schema_version":"1.0","event_id":"sha256:c080e6e3925ff8866e05824d35b99ff4c3dd678e75cc248c58c00932b4237f25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TEP2NBRITO6BZVJJLEILG7HHEW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clique colouring of binomial random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Colin McDiarmid, Dieter Mitsche, Pawel Pralat","submitted_at":"2016-11-06T13:55:39Z","abstract_excerpt":"A clique colouring of a graph is a colouring of the vertices so that no maximal clique is monochromatic (ignoring isolated vertices). The smallest number of colours in such a colouring is the clique chromatic number.\n  In this paper, we study the asymptotic behaviour of the clique chromatic number of the random graph G(n,p) for a wide range of edge-probabilities p=p(n). We see that the typical clique chromatic number, as a function of the average degree, forms an intriguing step function."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01782","kind":"arxiv","version":1},"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-18T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Au8hR6gczkagy9E/Xi4KQRdDht/0h4ndaQLHHYEt/0s2sUJlX+eWf94gE1l6BicROZ48ETkdhuia7APg41ctBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:15:11.814924Z"},"content_sha256":"627120d7f2f3d685c2815eb4da075b3706c4402759dce7a2994425cba5a14279","schema_version":"1.0","event_id":"sha256:627120d7f2f3d685c2815eb4da075b3706c4402759dce7a2994425cba5a14279"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW/bundle.json","state_url":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TEP2NBRITO6BZVJJLEILG7HHEW/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-06-27T16:15:11Z","links":{"resolver":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW","bundle":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW/bundle.json","state":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TEP2NBRITO6BZVJJLEILG7HHEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TEP2NBRITO6BZVJJLEILG7HHEW","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":"9cf9d24e8a1c098ea10f6a5180a3c73333aaaf2353215a32f65ca06def302b6c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-06T13:55:39Z","title_canon_sha256":"d3751a45c28f01ac9ee2be5015840d58d933454cde965e3da612eb55f1716637"},"schema_version":"1.0","source":{"id":"1611.01782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01782","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01782v1","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01782","created_at":"2026-05-18T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"TEP2NBRITO6B","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TEP2NBRITO6BZVJJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TEP2NBRI","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:627120d7f2f3d685c2815eb4da075b3706c4402759dce7a2994425cba5a14279","target":"graph","created_at":"2026-05-18T01:00:04Z","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 colouring of a graph is a colouring of the vertices so that no maximal clique is monochromatic (ignoring isolated vertices). The smallest number of colours in such a colouring is the clique chromatic number.\n  In this paper, we study the asymptotic behaviour of the clique chromatic number of the random graph G(n,p) for a wide range of edge-probabilities p=p(n). We see that the typical clique chromatic number, as a function of the average degree, forms an intriguing step function.","authors_text":"Colin McDiarmid, Dieter Mitsche, Pawel Pralat","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-06T13:55:39Z","title":"Clique colouring of binomial random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01782","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:c080e6e3925ff8866e05824d35b99ff4c3dd678e75cc248c58c00932b4237f25","target":"record","created_at":"2026-05-18T01:00:04Z","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":"9cf9d24e8a1c098ea10f6a5180a3c73333aaaf2353215a32f65ca06def302b6c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-06T13:55:39Z","title_canon_sha256":"d3751a45c28f01ac9ee2be5015840d58d933454cde965e3da612eb55f1716637"},"schema_version":"1.0","source":{"id":"1611.01782","kind":"arxiv","version":1}},"canonical_sha256":"991fa686289bbc1cd5295910b37ce725b6fad71163cbc9803bbf2a5b23743a29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"991fa686289bbc1cd5295910b37ce725b6fad71163cbc9803bbf2a5b23743a29","first_computed_at":"2026-05-18T01:00:04.487183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:04.487183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K2cCLFI0dnIBf2Rtb27fGVRrF9Ytml3hMzFxs5qLRbfLWm8uiIeRJF4h0kyLIqBY/5/JowvSS5TFC2FwpDeqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:04.487804Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c080e6e3925ff8866e05824d35b99ff4c3dd678e75cc248c58c00932b4237f25","sha256:627120d7f2f3d685c2815eb4da075b3706c4402759dce7a2994425cba5a14279"],"state_sha256":"23fbcfe547b7e80c957253baadf09a3d9156b1bf52e1392c8a969ebedbe55912"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5NRlKDlE8OYtLFv9u5tyMzbt9rff772Q+szoqvoUFi+fzVCE/Y/8/ja+pj/HpueJgKH71vhyyv0KWKo5/rkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:15:11.816852Z","bundle_sha256":"af1ba47aee7580b49389c9f3ef454a30840233eda5f86cdf5d6cfb9ea093e3ae"}}