{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VHYEG3HBSBTYAN6IX6TDVKBS6K","short_pith_number":"pith:VHYEG3HB","schema_version":"1.0","canonical_sha256":"a9f0436ce190678037c8bfa63aa832f28e0984c1bb5d7a1103e97e732a8b2a2f","source":{"kind":"arxiv","id":"1509.09168","version":4},"attestation_state":"computed","paper":{"title":"Partitioning random graphs into monochromatic components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Bal, Louis DeBiasio","submitted_at":"2015-09-30T13:35:07Z","abstract_excerpt":"Erd\\H{o}s, Gy\\'arf\\'as, and Pyber (1991) conjectured that every $r$-colored complete graph can be partitioned into at most $r-1$ monochromatic components; this is a strengthening of a conjecture of Lov\\'asz (1975) in which the components are only required to form a cover. An important partial result of Haxell and Kohayakawa (1995) shows that a partition into $r$ monochromatic components is possible for sufficiently large $r$-colored complete graphs.\n  We start by extending Haxell and Kohayakawa's result to graphs with large minimum degree, then we provide some partial analogs of their result f"},"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":"1509.09168","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-30T13:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"f939736a923155e5e17bfca1465a589ed9575aba46be1f68ada3d005e178a2e1","abstract_canon_sha256":"766a99814ce8a925e4ef54c2ece1261a470bb00e986b07d1970c0a859e757d0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:40.537277Z","signature_b64":"OSYXtaLk4dGSjZyQnD0bt6kEBRWa+hZ8mXS/fei90EemcF+GXQWOpC4agzshRt7n9vOkDXMdietV5y2c7p2FDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9f0436ce190678037c8bfa63aa832f28e0984c1bb5d7a1103e97e732a8b2a2f","last_reissued_at":"2026-05-18T00:50:40.536593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:40.536593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning random graphs into monochromatic components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Bal, Louis DeBiasio","submitted_at":"2015-09-30T13:35:07Z","abstract_excerpt":"Erd\\H{o}s, Gy\\'arf\\'as, and Pyber (1991) conjectured that every $r$-colored complete graph can be partitioned into at most $r-1$ monochromatic components; this is a strengthening of a conjecture of Lov\\'asz (1975) in which the components are only required to form a cover. An important partial result of Haxell and Kohayakawa (1995) shows that a partition into $r$ monochromatic components is possible for sufficiently large $r$-colored complete graphs.\n  We start by extending Haxell and Kohayakawa's result to graphs with large minimum degree, then we provide some partial analogs of their result f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09168","kind":"arxiv","version":4},"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":"1509.09168","created_at":"2026-05-18T00:50:40.536691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.09168v4","created_at":"2026-05-18T00:50:40.536691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09168","created_at":"2026-05-18T00:50:40.536691+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHYEG3HBSBTY","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHYEG3HBSBTYAN6I","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHYEG3HB","created_at":"2026-05-18T12:29:44.643036+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/VHYEG3HBSBTYAN6IX6TDVKBS6K","json":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K.json","graph_json":"https://pith.science/api/pith-number/VHYEG3HBSBTYAN6IX6TDVKBS6K/graph.json","events_json":"https://pith.science/api/pith-number/VHYEG3HBSBTYAN6IX6TDVKBS6K/events.json","paper":"https://pith.science/paper/VHYEG3HB"},"agent_actions":{"view_html":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K","download_json":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K.json","view_paper":"https://pith.science/paper/VHYEG3HB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.09168&json=true","fetch_graph":"https://pith.science/api/pith-number/VHYEG3HBSBTYAN6IX6TDVKBS6K/graph.json","fetch_events":"https://pith.science/api/pith-number/VHYEG3HBSBTYAN6IX6TDVKBS6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/action/storage_attestation","attest_author":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/action/author_attestation","sign_citation":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/action/citation_signature","submit_replication":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/action/replication_record"}},"created_at":"2026-05-18T00:50:40.536691+00:00","updated_at":"2026-05-18T00:50:40.536691+00:00"}