{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RDSYESUWW53E3C5IGGMDRWSLSJ","short_pith_number":"pith:RDSYESUW","canonical_record":{"source":{"id":"1708.01284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T19:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"2313f0f8fcf62d2fb7e40f06190119f18c032ee146e71a64611feae26700cd1c","abstract_canon_sha256":"d41b827642519cf9e2b96008c4cd9e7912f9a980e36169555dcbca0bdbf07286"},"schema_version":"1.0"},"canonical_sha256":"88e5824a96b7764d8ba8319838da4b924380b58eb4c743b5d5f4206a8c9ca256","source":{"kind":"arxiv","id":"1708.01284","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01284","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01284v2","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01284","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"RDSYESUWW53E","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RDSYESUWW53E3C5I","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RDSYESUW","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RDSYESUWW53E3C5IGGMDRWSLSJ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T19:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"2313f0f8fcf62d2fb7e40f06190119f18c032ee146e71a64611feae26700cd1c","abstract_canon_sha256":"d41b827642519cf9e2b96008c4cd9e7912f9a980e36169555dcbca0bdbf07286"},"schema_version":"1.0"},"canonical_sha256":"88e5824a96b7764d8ba8319838da4b924380b58eb4c743b5d5f4206a8c9ca256","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:44.713884Z","signature_b64":"F3Er7suaKKYZCqRxhvlWpdSM0MSjZf10YGzetABrLkA4lY3DA819navXXp+WOHONKimnrKPn7J7zk08OFuFrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e5824a96b7764d8ba8319838da4b924380b58eb4c743b5d5f4206a8c9ca256","last_reissued_at":"2026-05-18T00:37:44.713153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:44.713153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01284","source_version":2,"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:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6a3lZM6ioFWSoFCFsvaOhzg50DO8C7eG7KFJil9+nKyUpXCuHP3JKX+donAIuKqML3oBqryp+wV5XnHWk7ZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:06:23.797135Z"},"content_sha256":"7ce59e3077d7006a5e634966a40d95a37bc418794373e7d90f8468f549351a4f","schema_version":"1.0","event_id":"sha256:7ce59e3077d7006a5e634966a40d95a37bc418794373e7d90f8468f549351a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RDSYESUWW53E3C5IGGMDRWSLSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning a graph into monochromatic connected subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Julian Sahasrabudhe, Shoham Letzter","submitted_at":"2017-08-03T19:11:39Z","abstract_excerpt":"A well-known result by Haxell and Kohayakawa states that the vertices of an $r$-coloured complete graph can be partitioned into $r$ monochromatic connected subgraphs of distinct colours; this is a slightly weaker variant of a conjecture by Erd\\H{o}s, Pyber and Gy\\'arf\\'as that states that there exists a partition into $r-1$ monochromatic connected subgraphs. We consider a variant of this problem, where the complete graph is replaced by a graph with large minimum degree, and prove two conjectures of Bal and DeBiasio, for two and three colours."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01284","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"},"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:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zY3w+P5FSToe+r8xadZIFk73KLLfb2xIa4aKhvg88bcub77kYHjUvtGDAvsQ8w5ZXhXSGvFB9h2DeAOG+apXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:06:23.797488Z"},"content_sha256":"5b904b84c8742b5c8e5ceb8b2e3617d71bd87913fdd1794c80ce9da00176c6c2","schema_version":"1.0","event_id":"sha256:5b904b84c8742b5c8e5ceb8b2e3617d71bd87913fdd1794c80ce9da00176c6c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDSYESUWW53E3C5IGGMDRWSLSJ/bundle.json","state_url":"https://pith.science/pith/RDSYESUWW53E3C5IGGMDRWSLSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDSYESUWW53E3C5IGGMDRWSLSJ/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-22T07:06:23Z","links":{"resolver":"https://pith.science/pith/RDSYESUWW53E3C5IGGMDRWSLSJ","bundle":"https://pith.science/pith/RDSYESUWW53E3C5IGGMDRWSLSJ/bundle.json","state":"https://pith.science/pith/RDSYESUWW53E3C5IGGMDRWSLSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDSYESUWW53E3C5IGGMDRWSLSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RDSYESUWW53E3C5IGGMDRWSLSJ","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":"d41b827642519cf9e2b96008c4cd9e7912f9a980e36169555dcbca0bdbf07286","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T19:11:39Z","title_canon_sha256":"2313f0f8fcf62d2fb7e40f06190119f18c032ee146e71a64611feae26700cd1c"},"schema_version":"1.0","source":{"id":"1708.01284","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01284","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01284v2","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01284","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"RDSYESUWW53E","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RDSYESUWW53E3C5I","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RDSYESUW","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:5b904b84c8742b5c8e5ceb8b2e3617d71bd87913fdd1794c80ce9da00176c6c2","target":"graph","created_at":"2026-05-18T00:37:44Z","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":"A well-known result by Haxell and Kohayakawa states that the vertices of an $r$-coloured complete graph can be partitioned into $r$ monochromatic connected subgraphs of distinct colours; this is a slightly weaker variant of a conjecture by Erd\\H{o}s, Pyber and Gy\\'arf\\'as that states that there exists a partition into $r-1$ monochromatic connected subgraphs. We consider a variant of this problem, where the complete graph is replaced by a graph with large minimum degree, and prove two conjectures of Bal and DeBiasio, for two and three colours.","authors_text":"Ant\\'onio Gir\\~ao, Julian Sahasrabudhe, Shoham Letzter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T19:11:39Z","title":"Partitioning a graph into monochromatic connected subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01284","kind":"arxiv","version":2},"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:7ce59e3077d7006a5e634966a40d95a37bc418794373e7d90f8468f549351a4f","target":"record","created_at":"2026-05-18T00:37:44Z","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":"d41b827642519cf9e2b96008c4cd9e7912f9a980e36169555dcbca0bdbf07286","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T19:11:39Z","title_canon_sha256":"2313f0f8fcf62d2fb7e40f06190119f18c032ee146e71a64611feae26700cd1c"},"schema_version":"1.0","source":{"id":"1708.01284","kind":"arxiv","version":2}},"canonical_sha256":"88e5824a96b7764d8ba8319838da4b924380b58eb4c743b5d5f4206a8c9ca256","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88e5824a96b7764d8ba8319838da4b924380b58eb4c743b5d5f4206a8c9ca256","first_computed_at":"2026-05-18T00:37:44.713153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:44.713153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F3Er7suaKKYZCqRxhvlWpdSM0MSjZf10YGzetABrLkA4lY3DA819navXXp+WOHONKimnrKPn7J7zk08OFuFrAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:44.713884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01284","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ce59e3077d7006a5e634966a40d95a37bc418794373e7d90f8468f549351a4f","sha256:5b904b84c8742b5c8e5ceb8b2e3617d71bd87913fdd1794c80ce9da00176c6c2"],"state_sha256":"409ac77221130fb2a79c2a9287d5ee62c82d049a936290e46ff785a2d9c5ba6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anSVsAvITM6vBggkQPjRjDFennW1yyYbH/zLqQewH/0t3npHpF4FMbxBXEFoQSacmwmYss93NN7Lpt/xYo1qBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T07:06:23.799401Z","bundle_sha256":"9cda531ed29386d431cfe573fd6d5c111c13d6102173fe9c1ad4ac31fcc6932b"}}