{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KKGDJVMQZMZGOJQQHDTGRLZCML","short_pith_number":"pith:KKGDJVMQ","schema_version":"1.0","canonical_sha256":"528c34d590cb3267261038e668af2262c01cc92c61deebea9a6ff7bcc8fbcb72","source":{"kind":"arxiv","id":"1407.3555","version":2},"attestation_state":"computed","paper":{"title":"Bounded monochromatic components for random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Nicolas Broutin, Ross J. Kang","submitted_at":"2014-07-14T08:05:46Z","abstract_excerpt":"We consider vertex partitions of the binomial random graph $G_{n,p}$. For $np\\to\\infty$, we observe the following phenomenon: in any partition into asymptotically fewer than $\\chi(G_{n,p})$ parts, i.e. $o(np/\\log np)$ parts, one part must induce a connected component of order at least roughly the average part size.\n  Stated another way, we consider the $t$-component chromatic number, the smallest number of colours needed in a colouring of the vertices for which no monochromatic component has more than $t$ vertices. As long as $np \\to \\infty$, there is a threshold for $t$ around $\\Theta(p^{-1}\\"},"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":"1407.3555","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-14T08:05:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"d1c203c6b6dba3b1093c76922b8e88294d06eaf1f00c5b331879f71b1602cefd","abstract_canon_sha256":"8bec4ce9422d2ee59ef5045e1a57b3659797a0505eb52ea99afe8284b673b596"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:08.720425Z","signature_b64":"TqRl5CEZinReLe0tqpLde7b310TGAL/MP00Ua6tabc4WS6vgz2mJnfxfVTf53c9EZrpFkGCm6QMC+H6XV+hLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"528c34d590cb3267261038e668af2262c01cc92c61deebea9a6ff7bcc8fbcb72","last_reissued_at":"2026-05-18T00:40:08.719667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:08.719667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded monochromatic components for random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Nicolas Broutin, Ross J. Kang","submitted_at":"2014-07-14T08:05:46Z","abstract_excerpt":"We consider vertex partitions of the binomial random graph $G_{n,p}$. For $np\\to\\infty$, we observe the following phenomenon: in any partition into asymptotically fewer than $\\chi(G_{n,p})$ parts, i.e. $o(np/\\log np)$ parts, one part must induce a connected component of order at least roughly the average part size.\n  Stated another way, we consider the $t$-component chromatic number, the smallest number of colours needed in a colouring of the vertices for which no monochromatic component has more than $t$ vertices. As long as $np \\to \\infty$, there is a threshold for $t$ around $\\Theta(p^{-1}\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3555","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":"1407.3555","created_at":"2026-05-18T00:40:08.719772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3555v2","created_at":"2026-05-18T00:40:08.719772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3555","created_at":"2026-05-18T00:40:08.719772+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKGDJVMQZMZG","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKGDJVMQZMZGOJQQ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKGDJVMQ","created_at":"2026-05-18T12:28:35.611951+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/KKGDJVMQZMZGOJQQHDTGRLZCML","json":"https://pith.science/pith/KKGDJVMQZMZGOJQQHDTGRLZCML.json","graph_json":"https://pith.science/api/pith-number/KKGDJVMQZMZGOJQQHDTGRLZCML/graph.json","events_json":"https://pith.science/api/pith-number/KKGDJVMQZMZGOJQQHDTGRLZCML/events.json","paper":"https://pith.science/paper/KKGDJVMQ"},"agent_actions":{"view_html":"https://pith.science/pith/KKGDJVMQZMZGOJQQHDTGRLZCML","download_json":"https://pith.science/pith/KKGDJVMQZMZGOJQQHDTGRLZCML.json","view_paper":"https://pith.science/paper/KKGDJVMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3555&json=true","fetch_graph":"https://pith.science/api/pith-number/KKGDJVMQZMZGOJQQHDTGRLZCML/graph.json","fetch_events":"https://pith.science/api/pith-number/KKGDJVMQZMZGOJQQHDTGRLZCML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKGDJVMQZMZGOJQQHDTGRLZCML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKGDJVMQZMZGOJQQHDTGRLZCML/action/storage_attestation","attest_author":"https://pith.science/pith/KKGDJVMQZMZGOJQQHDTGRLZCML/action/author_attestation","sign_citation":"https://pith.science/pith/KKGDJVMQZMZGOJQQHDTGRLZCML/action/citation_signature","submit_replication":"https://pith.science/pith/KKGDJVMQZMZGOJQQHDTGRLZCML/action/replication_record"}},"created_at":"2026-05-18T00:40:08.719772+00:00","updated_at":"2026-05-18T00:40:08.719772+00:00"}