{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WCA7DFC4ILONTTKLJLY2XBR3B4","short_pith_number":"pith:WCA7DFC4","canonical_record":{"source":{"id":"1409.1874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-05T17:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"2e298f36b1f54564d189c7e440bb9bf9184ea735a677a40a6850c714bbcd2c88","abstract_canon_sha256":"6db94a26457c397bcc257a63e633a5fa1842a3eedad5e802d9c38b1fd74665ca"},"schema_version":"1.0"},"canonical_sha256":"b081f1945c42dcd9cd4b4af1ab863b0f1a9b66558d2f7b571e0e4fe2385d14ed","source":{"kind":"arxiv","id":"1409.1874","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1874","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1874v2","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1874","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"pith_short_12","alias_value":"WCA7DFC4ILON","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WCA7DFC4ILONTTKL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WCA7DFC4","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WCA7DFC4ILONTTKLJLY2XBR3B4","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-05T17:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"2e298f36b1f54564d189c7e440bb9bf9184ea735a677a40a6850c714bbcd2c88","abstract_canon_sha256":"6db94a26457c397bcc257a63e633a5fa1842a3eedad5e802d9c38b1fd74665ca"},"schema_version":"1.0"},"canonical_sha256":"b081f1945c42dcd9cd4b4af1ab863b0f1a9b66558d2f7b571e0e4fe2385d14ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:29.360851Z","signature_b64":"YAenHo08RgkmIRffoYVE+UWdaCYy48SliwnUiDKnMCgrJALHp4TokZxii4/VtU0Xu8iWuQPE8bql1qvtrdhzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b081f1945c42dcd9cd4b4af1ab863b0f1a9b66558d2f7b571e0e4fe2385d14ed","last_reissued_at":"2026-05-18T01:06:29.360236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:29.360236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1874","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-18T01:06:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3sGB1ctHhF4R95Su0WYqCoIda8ZdFgqEYt/CmwQtctsYrcemrmqhIPTV4gii4187fIsCQj2k0DT9AQSZ+ZmWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:30:56.540434Z"},"content_sha256":"7671940a1052f3a623429085c3d062adc5df22299e44c65531d5afed8125ec79","schema_version":"1.0","event_id":"sha256:7671940a1052f3a623429085c3d062adc5df22299e44c65531d5afed8125ec79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WCA7DFC4ILONTTKLJLY2XBR3B4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monochromatic cycle partitions of graphs with large minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis DeBiasio, Luke Nelsen","submitted_at":"2014-09-05T17:07:07Z","abstract_excerpt":"Lehel conjectured that in every $2$-coloring of the edges of $K_n$, there is a vertex disjoint red and blue cycle which span $V(K_n)$. \\L uczak, R\\\"odl, and Szemer\\'edi proved Lehel's conjecture for large $n$, Allen gave a different proof for large $n$, and finally Bessy and Thomass\\'e gave a proof for all $n$.\n  Balogh, Bar\\'at, Gerbner, Gy\\'arf\\'as, and S\\'ark\\\"ozy proposed a significant strengthening of Lehel's conjecture where $K_n$ is replaced by any graph $G$ with $\\delta(G)> 3n/4$; if true, this minimum degree condition is essentially best possible. We prove that their conjecture holds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1874","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-18T01:06:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQtv26pWG8kDcbvks1wIT4FYLDSy75cm0klhuuB8T7ziK2i8u2XpCCdZkPGQaB/1D9LFDSBsLVm2zgqI4eASCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:30:56.540779Z"},"content_sha256":"aa38bed130f001e3a1aebc497c14e0f1b651c4b3d5201a7a86707319ec88df04","schema_version":"1.0","event_id":"sha256:aa38bed130f001e3a1aebc497c14e0f1b651c4b3d5201a7a86707319ec88df04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCA7DFC4ILONTTKLJLY2XBR3B4/bundle.json","state_url":"https://pith.science/pith/WCA7DFC4ILONTTKLJLY2XBR3B4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCA7DFC4ILONTTKLJLY2XBR3B4/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-25T20:30:56Z","links":{"resolver":"https://pith.science/pith/WCA7DFC4ILONTTKLJLY2XBR3B4","bundle":"https://pith.science/pith/WCA7DFC4ILONTTKLJLY2XBR3B4/bundle.json","state":"https://pith.science/pith/WCA7DFC4ILONTTKLJLY2XBR3B4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCA7DFC4ILONTTKLJLY2XBR3B4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WCA7DFC4ILONTTKLJLY2XBR3B4","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":"6db94a26457c397bcc257a63e633a5fa1842a3eedad5e802d9c38b1fd74665ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-05T17:07:07Z","title_canon_sha256":"2e298f36b1f54564d189c7e440bb9bf9184ea735a677a40a6850c714bbcd2c88"},"schema_version":"1.0","source":{"id":"1409.1874","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1874","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1874v2","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1874","created_at":"2026-05-18T01:06:29Z"},{"alias_kind":"pith_short_12","alias_value":"WCA7DFC4ILON","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WCA7DFC4ILONTTKL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WCA7DFC4","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:aa38bed130f001e3a1aebc497c14e0f1b651c4b3d5201a7a86707319ec88df04","target":"graph","created_at":"2026-05-18T01:06:29Z","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":"Lehel conjectured that in every $2$-coloring of the edges of $K_n$, there is a vertex disjoint red and blue cycle which span $V(K_n)$. \\L uczak, R\\\"odl, and Szemer\\'edi proved Lehel's conjecture for large $n$, Allen gave a different proof for large $n$, and finally Bessy and Thomass\\'e gave a proof for all $n$.\n  Balogh, Bar\\'at, Gerbner, Gy\\'arf\\'as, and S\\'ark\\\"ozy proposed a significant strengthening of Lehel's conjecture where $K_n$ is replaced by any graph $G$ with $\\delta(G)> 3n/4$; if true, this minimum degree condition is essentially best possible. We prove that their conjecture holds ","authors_text":"Louis DeBiasio, Luke Nelsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-05T17:07:07Z","title":"Monochromatic cycle partitions of graphs with large minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1874","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:7671940a1052f3a623429085c3d062adc5df22299e44c65531d5afed8125ec79","target":"record","created_at":"2026-05-18T01:06:29Z","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":"6db94a26457c397bcc257a63e633a5fa1842a3eedad5e802d9c38b1fd74665ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-05T17:07:07Z","title_canon_sha256":"2e298f36b1f54564d189c7e440bb9bf9184ea735a677a40a6850c714bbcd2c88"},"schema_version":"1.0","source":{"id":"1409.1874","kind":"arxiv","version":2}},"canonical_sha256":"b081f1945c42dcd9cd4b4af1ab863b0f1a9b66558d2f7b571e0e4fe2385d14ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b081f1945c42dcd9cd4b4af1ab863b0f1a9b66558d2f7b571e0e4fe2385d14ed","first_computed_at":"2026-05-18T01:06:29.360236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:29.360236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YAenHo08RgkmIRffoYVE+UWdaCYy48SliwnUiDKnMCgrJALHp4TokZxii4/VtU0Xu8iWuQPE8bql1qvtrdhzDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:29.360851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1874","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7671940a1052f3a623429085c3d062adc5df22299e44c65531d5afed8125ec79","sha256:aa38bed130f001e3a1aebc497c14e0f1b651c4b3d5201a7a86707319ec88df04"],"state_sha256":"ad0326bb39dfc4f5f8ba63272157874e207e5bdbde0e3e60f73aae6dfc0c58a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pW0MkcT2kpL/NeElz1Qa9W0qXHs2/15nrNNolPAHEusbziO9PzMgmavSmH+wc/CqfrvsZeLSySScoUR8/qHNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:30:56.542709Z","bundle_sha256":"4569dd123277a99f7e82017fa7c2c4320b10b8e241be24852db531864d2dba58"}}