{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TEP2NBRITO6BZVJJLEILG7HHEW","short_pith_number":"pith:TEP2NBRI","schema_version":"1.0","canonical_sha256":"991fa686289bbc1cd5295910b37ce725b6fad71163cbc9803bbf2a5b23743a29","source":{"kind":"arxiv","id":"1611.01782","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.01782","created_at":"2026-05-18T01:00:04.487278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01782v1","created_at":"2026-05-18T01:00:04.487278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01782","created_at":"2026-05-18T01:00:04.487278+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEP2NBRITO6B","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEP2NBRITO6BZVJJ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEP2NBRI","created_at":"2026-05-18T12:30:44.179134+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/TEP2NBRITO6BZVJJLEILG7HHEW","json":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW.json","graph_json":"https://pith.science/api/pith-number/TEP2NBRITO6BZVJJLEILG7HHEW/graph.json","events_json":"https://pith.science/api/pith-number/TEP2NBRITO6BZVJJLEILG7HHEW/events.json","paper":"https://pith.science/paper/TEP2NBRI"},"agent_actions":{"view_html":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW","download_json":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW.json","view_paper":"https://pith.science/paper/TEP2NBRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01782&json=true","fetch_graph":"https://pith.science/api/pith-number/TEP2NBRITO6BZVJJLEILG7HHEW/graph.json","fetch_events":"https://pith.science/api/pith-number/TEP2NBRITO6BZVJJLEILG7HHEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW/action/storage_attestation","attest_author":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW/action/author_attestation","sign_citation":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW/action/citation_signature","submit_replication":"https://pith.science/pith/TEP2NBRITO6BZVJJLEILG7HHEW/action/replication_record"}},"created_at":"2026-05-18T01:00:04.487278+00:00","updated_at":"2026-05-18T01:00:04.487278+00:00"}