{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VHYEG3HBSBTYAN6IX6TDVKBS6K","short_pith_number":"pith:VHYEG3HB","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"},"canonical_sha256":"a9f0436ce190678037c8bfa63aa832f28e0984c1bb5d7a1103e97e732a8b2a2f","source":{"kind":"arxiv","id":"1509.09168","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09168","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09168v4","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09168","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"VHYEG3HBSBTY","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHYEG3HBSBTYAN6I","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHYEG3HB","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VHYEG3HBSBTYAN6IX6TDVKBS6K","target":"record","payload":{"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"},"canonical_sha256":"a9f0436ce190678037c8bfa63aa832f28e0984c1bb5d7a1103e97e732a8b2a2f","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"},"source_kind":"arxiv","source_id":"1509.09168","source_version":4,"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-18T00:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exZIlZwsPVfgh5HVqbOSs+bL0MfBcx0qRYHmXvUpty2c/K5BOrobV6Mk/h0p7EZ+ZhiNRv8kkJC1kZR0STvzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:07:12.813927Z"},"content_sha256":"c161d14b5437b052b31db9a538feb358a2b8c552be4c57108befdf516e8de903","schema_version":"1.0","event_id":"sha256:c161d14b5437b052b31db9a538feb358a2b8c552be4c57108befdf516e8de903"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VHYEG3HBSBTYAN6IX6TDVKBS6K","target":"graph","payload":{"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"},"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-18T00:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QO4jepKC6WVU988ItJENepOFlX5qV+Uj3FJGP/pvdOs8COLqNfdCdtBHiHXdrccUMAz2in7GGVOgF2f4T3thAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:07:12.814297Z"},"content_sha256":"51765f1c46748c773c2639a29bd192b2b7b66567561cb99437f9fb4a4903e5c1","schema_version":"1.0","event_id":"sha256:51765f1c46748c773c2639a29bd192b2b7b66567561cb99437f9fb4a4903e5c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/bundle.json","state_url":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/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-02T21:07:12Z","links":{"resolver":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K","bundle":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/bundle.json","state":"https://pith.science/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHYEG3HBSBTYAN6IX6TDVKBS6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VHYEG3HBSBTYAN6IX6TDVKBS6K","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":"766a99814ce8a925e4ef54c2ece1261a470bb00e986b07d1970c0a859e757d0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-30T13:35:07Z","title_canon_sha256":"f939736a923155e5e17bfca1465a589ed9575aba46be1f68ada3d005e178a2e1"},"schema_version":"1.0","source":{"id":"1509.09168","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09168","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09168v4","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09168","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"VHYEG3HBSBTY","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHYEG3HBSBTYAN6I","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHYEG3HB","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:51765f1c46748c773c2639a29bd192b2b7b66567561cb99437f9fb4a4903e5c1","target":"graph","created_at":"2026-05-18T00:50:40Z","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":"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","authors_text":"Deepak Bal, Louis DeBiasio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-30T13:35:07Z","title":"Partitioning random graphs into monochromatic components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09168","kind":"arxiv","version":4},"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:c161d14b5437b052b31db9a538feb358a2b8c552be4c57108befdf516e8de903","target":"record","created_at":"2026-05-18T00:50:40Z","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":"766a99814ce8a925e4ef54c2ece1261a470bb00e986b07d1970c0a859e757d0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-30T13:35:07Z","title_canon_sha256":"f939736a923155e5e17bfca1465a589ed9575aba46be1f68ada3d005e178a2e1"},"schema_version":"1.0","source":{"id":"1509.09168","kind":"arxiv","version":4}},"canonical_sha256":"a9f0436ce190678037c8bfa63aa832f28e0984c1bb5d7a1103e97e732a8b2a2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9f0436ce190678037c8bfa63aa832f28e0984c1bb5d7a1103e97e732a8b2a2f","first_computed_at":"2026-05-18T00:50:40.536593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:40.536593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OSYXtaLk4dGSjZyQnD0bt6kEBRWa+hZ8mXS/fei90EemcF+GXQWOpC4agzshRt7n9vOkDXMdietV5y2c7p2FDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:40.537277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09168","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c161d14b5437b052b31db9a538feb358a2b8c552be4c57108befdf516e8de903","sha256:51765f1c46748c773c2639a29bd192b2b7b66567561cb99437f9fb4a4903e5c1"],"state_sha256":"a699bf15f9704a6f248838077f9c5b0fbffc870da2df501d72c85a7433f7c51a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axuLyAScdL51tijBdvWXuEi9YgtjxcNNmd+WPh6gIb6VilnlWead8fzTKn7cU0cNzldJ9FMhiSfA2ik6bT4MDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:07:12.816288Z","bundle_sha256":"6699bc9de59f745ea5d13418885b4f6da3c797267f5773818c839f7ead6276a9"}}