{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LTYKZORORA2GBBUZIF43GRN5UC","short_pith_number":"pith:LTYKZORO","schema_version":"1.0","canonical_sha256":"5cf0acba2e88346086994179b345bda0afbebb7f31a6d8887d8600cfee577023","source":{"kind":"arxiv","id":"1612.06539","version":2},"attestation_state":"computed","paper":{"title":"Clique coloring of dense random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich, Noga Alon","submitted_at":"2016-12-20T08:03:49Z","abstract_excerpt":"The clique chromatic number of a graph G=(V,E) is the minimum number of colors in a vertex coloring so that no maximal (with respect to containment) clique is monochromatic. We prove that the clique chromatic number of the binomial random graph G=G(n,1/2) is, with high probability, \\Omega(log n). This settles a problem of McDiarmid, Mitsche and Pralat who proved that it is O(log n) with high probability."},"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":"1612.06539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-20T08:03:49Z","cross_cats_sorted":[],"title_canon_sha256":"ce7e0499a6da0a67b0dbc130711647e2e1aa8b65e6761b1df1a51a67272c9ba9","abstract_canon_sha256":"9232f4c6e2530c61c1ea30151f7fe2307bbb8fc13cf30eb4765a806a65f8fb55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:22.256558Z","signature_b64":"f1PanNKATHs3qXbgODyJxM4IVl4bDAa2pz2kTBGDuiDOwSuYFvu++08dwiG5eQml0RV3sjVQM2QQocVS0z6oCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cf0acba2e88346086994179b345bda0afbebb7f31a6d8887d8600cfee577023","last_reissued_at":"2026-05-18T00:31:22.256103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:22.256103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique coloring of dense random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich, Noga Alon","submitted_at":"2016-12-20T08:03:49Z","abstract_excerpt":"The clique chromatic number of a graph G=(V,E) is the minimum number of colors in a vertex coloring so that no maximal (with respect to containment) clique is monochromatic. We prove that the clique chromatic number of the binomial random graph G=G(n,1/2) is, with high probability, \\Omega(log n). This settles a problem of McDiarmid, Mitsche and Pralat who proved that it is O(log n) with high probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06539","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":"1612.06539","created_at":"2026-05-18T00:31:22.256169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06539v2","created_at":"2026-05-18T00:31:22.256169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06539","created_at":"2026-05-18T00:31:22.256169+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTYKZORORA2G","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTYKZORORA2GBBUZ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTYKZORO","created_at":"2026-05-18T12:30:29.479603+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/LTYKZORORA2GBBUZIF43GRN5UC","json":"https://pith.science/pith/LTYKZORORA2GBBUZIF43GRN5UC.json","graph_json":"https://pith.science/api/pith-number/LTYKZORORA2GBBUZIF43GRN5UC/graph.json","events_json":"https://pith.science/api/pith-number/LTYKZORORA2GBBUZIF43GRN5UC/events.json","paper":"https://pith.science/paper/LTYKZORO"},"agent_actions":{"view_html":"https://pith.science/pith/LTYKZORORA2GBBUZIF43GRN5UC","download_json":"https://pith.science/pith/LTYKZORORA2GBBUZIF43GRN5UC.json","view_paper":"https://pith.science/paper/LTYKZORO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06539&json=true","fetch_graph":"https://pith.science/api/pith-number/LTYKZORORA2GBBUZIF43GRN5UC/graph.json","fetch_events":"https://pith.science/api/pith-number/LTYKZORORA2GBBUZIF43GRN5UC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTYKZORORA2GBBUZIF43GRN5UC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTYKZORORA2GBBUZIF43GRN5UC/action/storage_attestation","attest_author":"https://pith.science/pith/LTYKZORORA2GBBUZIF43GRN5UC/action/author_attestation","sign_citation":"https://pith.science/pith/LTYKZORORA2GBBUZIF43GRN5UC/action/citation_signature","submit_replication":"https://pith.science/pith/LTYKZORORA2GBBUZIF43GRN5UC/action/replication_record"}},"created_at":"2026-05-18T00:31:22.256169+00:00","updated_at":"2026-05-18T00:31:22.256169+00:00"}