{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5SYMK5IL3RMRTKAUVN7LHXJDCS","short_pith_number":"pith:5SYMK5IL","canonical_record":{"source":{"id":"1711.04748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-13T18:30:00Z","cross_cats_sorted":[],"title_canon_sha256":"ff38671a7be3ca7f409b4d55ed97405c0592316ecd22b9d8bc398e2fd064ac06","abstract_canon_sha256":"7c2117088e8d671017e532cb5db88fe74cd41ce0a5505b8a944449cda227a213"},"schema_version":"1.0"},"canonical_sha256":"ecb0c5750bdc5919a814ab7eb3dd2314b91aeac55d4489c324f0ad28a76204fb","source":{"kind":"arxiv","id":"1711.04748","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04748","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04748v2","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04748","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"5SYMK5IL3RMR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5SYMK5IL3RMRTKAU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5SYMK5IL","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5SYMK5IL3RMRTKAUVN7LHXJDCS","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-13T18:30:00Z","cross_cats_sorted":[],"title_canon_sha256":"ff38671a7be3ca7f409b4d55ed97405c0592316ecd22b9d8bc398e2fd064ac06","abstract_canon_sha256":"7c2117088e8d671017e532cb5db88fe74cd41ce0a5505b8a944449cda227a213"},"schema_version":"1.0"},"canonical_sha256":"ecb0c5750bdc5919a814ab7eb3dd2314b91aeac55d4489c324f0ad28a76204fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:48.234797Z","signature_b64":"tzoMWGItoakWPVj0oMxMDvpAS7wV2Kb3Ic/zBMYeWWFrNJ0i7nxdRvORLZ8JUDaBsv+c4plkyqHtLBqe3vfHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb0c5750bdc5919a814ab7eb3dd2314b91aeac55d4489c324f0ad28a76204fb","last_reissued_at":"2026-05-18T00:14:48.234106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:48.234106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04748","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:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZrdiotKcj7wVQLePABTxumtVcpnhWgxV5Y9WQbf0CS3zZ5p1TYyMMdQ8h6HySM/2fVqo8PebrhWp5LmrAmbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:50.720447Z"},"content_sha256":"efd4719583cd8a4b3d6e03a7f0d8f8f9425591ecc0c81a0a022107ba341741ab","schema_version":"1.0","event_id":"sha256:efd4719583cd8a4b3d6e03a7f0d8f8f9425591ecc0c81a0a022107ba341741ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5SYMK5IL3RMRTKAUVN7LHXJDCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning $2$-coloured complete $k$-uniform hypergraphs into monochromatic $\\ell$-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maya Stein, Sebastian Bustamante","submitted_at":"2017-11-13T18:30:00Z","abstract_excerpt":"We show that for all $\\ell, k, n$ with $\\ell \\leq k/2$ and $(k-\\ell)$ dividing $n$ the following hypergraph-variant of Lehel's conjecture is true. Every $2$-edge-colouring of the $k$-uniform complete hypergraph $\\mathcal{K}_n^{(k)}$ on $n$ vertices has at most two disjoint monochromatic $\\ell$-cycles in different colours that together cover all but at most $4(k-\\ell)$ vertices. If $\\ell \\leq k/3$, then at most two $\\ell$-cycles cover all but at most $2(k-\\ell)$ vertices. Furthermore, we can cover all vertices with at most $4$ ($3$ if $\\ell\\leq k/3$) disjoint monochromatic $\\ell$-cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04748","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:14:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYXnC9ZC4Q09ps+QOaf058CGWbvHuOmCkzwi7PruW/tdTunImbufpk/o25vW+ru3udY7dnCZfRekoLG97enLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:50.720794Z"},"content_sha256":"de9e99f715f562d0f30c7e0a57a19f118352e132309f2e73abbce3ca5894b6d1","schema_version":"1.0","event_id":"sha256:de9e99f715f562d0f30c7e0a57a19f118352e132309f2e73abbce3ca5894b6d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SYMK5IL3RMRTKAUVN7LHXJDCS/bundle.json","state_url":"https://pith.science/pith/5SYMK5IL3RMRTKAUVN7LHXJDCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SYMK5IL3RMRTKAUVN7LHXJDCS/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-01T16:44:50Z","links":{"resolver":"https://pith.science/pith/5SYMK5IL3RMRTKAUVN7LHXJDCS","bundle":"https://pith.science/pith/5SYMK5IL3RMRTKAUVN7LHXJDCS/bundle.json","state":"https://pith.science/pith/5SYMK5IL3RMRTKAUVN7LHXJDCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SYMK5IL3RMRTKAUVN7LHXJDCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5SYMK5IL3RMRTKAUVN7LHXJDCS","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":"7c2117088e8d671017e532cb5db88fe74cd41ce0a5505b8a944449cda227a213","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-13T18:30:00Z","title_canon_sha256":"ff38671a7be3ca7f409b4d55ed97405c0592316ecd22b9d8bc398e2fd064ac06"},"schema_version":"1.0","source":{"id":"1711.04748","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04748","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04748v2","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04748","created_at":"2026-05-18T00:14:48Z"},{"alias_kind":"pith_short_12","alias_value":"5SYMK5IL3RMR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5SYMK5IL3RMRTKAU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5SYMK5IL","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:de9e99f715f562d0f30c7e0a57a19f118352e132309f2e73abbce3ca5894b6d1","target":"graph","created_at":"2026-05-18T00:14:48Z","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":"We show that for all $\\ell, k, n$ with $\\ell \\leq k/2$ and $(k-\\ell)$ dividing $n$ the following hypergraph-variant of Lehel's conjecture is true. Every $2$-edge-colouring of the $k$-uniform complete hypergraph $\\mathcal{K}_n^{(k)}$ on $n$ vertices has at most two disjoint monochromatic $\\ell$-cycles in different colours that together cover all but at most $4(k-\\ell)$ vertices. If $\\ell \\leq k/3$, then at most two $\\ell$-cycles cover all but at most $2(k-\\ell)$ vertices. Furthermore, we can cover all vertices with at most $4$ ($3$ if $\\ell\\leq k/3$) disjoint monochromatic $\\ell$-cycles.","authors_text":"Maya Stein, Sebastian Bustamante","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-13T18:30:00Z","title":"Partitioning $2$-coloured complete $k$-uniform hypergraphs into monochromatic $\\ell$-cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04748","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:efd4719583cd8a4b3d6e03a7f0d8f8f9425591ecc0c81a0a022107ba341741ab","target":"record","created_at":"2026-05-18T00:14:48Z","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":"7c2117088e8d671017e532cb5db88fe74cd41ce0a5505b8a944449cda227a213","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-13T18:30:00Z","title_canon_sha256":"ff38671a7be3ca7f409b4d55ed97405c0592316ecd22b9d8bc398e2fd064ac06"},"schema_version":"1.0","source":{"id":"1711.04748","kind":"arxiv","version":2}},"canonical_sha256":"ecb0c5750bdc5919a814ab7eb3dd2314b91aeac55d4489c324f0ad28a76204fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecb0c5750bdc5919a814ab7eb3dd2314b91aeac55d4489c324f0ad28a76204fb","first_computed_at":"2026-05-18T00:14:48.234106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:48.234106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tzoMWGItoakWPVj0oMxMDvpAS7wV2Kb3Ic/zBMYeWWFrNJ0i7nxdRvORLZ8JUDaBsv+c4plkyqHtLBqe3vfHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:48.234797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04748","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efd4719583cd8a4b3d6e03a7f0d8f8f9425591ecc0c81a0a022107ba341741ab","sha256:de9e99f715f562d0f30c7e0a57a19f118352e132309f2e73abbce3ca5894b6d1"],"state_sha256":"e45c0f2cbf012ab26a665b8b5cfc1358df08f1c394c5198075378a5c21ca0520"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZO30xnmdfMfmInHUWFMCu3b1zk0JaXMmk700NUbG9Lve0sq1SQNxf7xUL9lcxbIrD3C+tLKiNblzfqFtXN/JAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:44:50.722683Z","bundle_sha256":"3ce4f10c1f325099e47d2c77e2dac83a6bcbc6f652da538614b6d960d51029c2"}}