{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NCO25ZXKMLFVXR5LH2RLLDHBUD","short_pith_number":"pith:NCO25ZXK","canonical_record":{"source":{"id":"1907.06187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-14T08:30:28Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"2c0ab627319aa24f4212bd301e443fc87f935721c6d7ea6d31b899d9b25fe1aa","abstract_canon_sha256":"e8778d020063d18d1d717b39f42e7d3f9b24f858c40cf99c1a8dd2ae08c6e6d0"},"schema_version":"1.0"},"canonical_sha256":"689daee6ea62cb5bc7ab3ea2b58ce1a0fcacf2dce87e80a2e6081c74f09cfd58","source":{"kind":"arxiv","id":"1907.06187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06187","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06187v1","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06187","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"NCO25ZXKMLFV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NCO25ZXKMLFVXR5L","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NCO25ZXK","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NCO25ZXKMLFVXR5LH2RLLDHBUD","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-14T08:30:28Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"2c0ab627319aa24f4212bd301e443fc87f935721c6d7ea6d31b899d9b25fe1aa","abstract_canon_sha256":"e8778d020063d18d1d717b39f42e7d3f9b24f858c40cf99c1a8dd2ae08c6e6d0"},"schema_version":"1.0"},"canonical_sha256":"689daee6ea62cb5bc7ab3ea2b58ce1a0fcacf2dce87e80a2e6081c74f09cfd58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:38.282004Z","signature_b64":"ab/6+IFhkobLuozdb73Ii7ny1kCWy47kQ7rVADhYNBKNIeRhvOo5wN0RrhrnQvIx8d2ENJeXXyCLUX/moVQRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"689daee6ea62cb5bc7ab3ea2b58ce1a0fcacf2dce87e80a2e6081c74f09cfd58","last_reissued_at":"2026-05-17T23:40:38.281530Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:38.281530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06187","source_version":1,"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-17T23:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjTPmli3KtZkWc/IsgyrAM+y1TtUK4Y7hikz1lgaMsyFnKQKYaDaZXszoQm1Ge9tZiyrkZ0XehtQvD/HBjb7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:23:02.049563Z"},"content_sha256":"fc94c5421015fb6a6ed6d98deff147aa9936546d02d7b35571785021e326e027","schema_version":"1.0","event_id":"sha256:fc94c5421015fb6a6ed6d98deff147aa9936546d02d7b35571785021e326e027"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NCO25ZXKMLFVXR5LH2RLLDHBUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On decomposing complete tripartite graphs into 5-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"E.S. Mahmoodian, M. Abdolmaleki, MA. Shabani, S. Gh. Ilchi","submitted_at":"2019-07-14T08:30:28Z","abstract_excerpt":"The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph $K_{r,s,t}$ into 5-cycles was first considered by E.S. Mahmoodian and Maryam Mirzakhani (1995). They stated some necessary conditions and conjectured that those conditions are also sufficient. Since then, many cases of the problem have been solved by various authors; however, the case when the partite sets $r\\leq s\\leq t$ have odd and distinct sizes remained open. We show the conjecture is true when $r$, $s$ and $t$ are all multiples of 5, $t+90 \\leq \\frac{4rs}{r+s}$, and $t \\neq s+10$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06187","kind":"arxiv","version":1},"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-17T23:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbI7mqd6oJakVgl04n1F6BhYE+4eh2JSgoq9oj1dImHlPersQ75+Q3FGoImV0t0NxB0ykrHQCutSM9pkbgexAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:23:02.050259Z"},"content_sha256":"46641afd35f60be388bb45a1ec614f3d59fe0d5d4284b88dab8327884620710a","schema_version":"1.0","event_id":"sha256:46641afd35f60be388bb45a1ec614f3d59fe0d5d4284b88dab8327884620710a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NCO25ZXKMLFVXR5LH2RLLDHBUD/bundle.json","state_url":"https://pith.science/pith/NCO25ZXKMLFVXR5LH2RLLDHBUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NCO25ZXKMLFVXR5LH2RLLDHBUD/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-11T02:23:02Z","links":{"resolver":"https://pith.science/pith/NCO25ZXKMLFVXR5LH2RLLDHBUD","bundle":"https://pith.science/pith/NCO25ZXKMLFVXR5LH2RLLDHBUD/bundle.json","state":"https://pith.science/pith/NCO25ZXKMLFVXR5LH2RLLDHBUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NCO25ZXKMLFVXR5LH2RLLDHBUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NCO25ZXKMLFVXR5LH2RLLDHBUD","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":"e8778d020063d18d1d717b39f42e7d3f9b24f858c40cf99c1a8dd2ae08c6e6d0","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-14T08:30:28Z","title_canon_sha256":"2c0ab627319aa24f4212bd301e443fc87f935721c6d7ea6d31b899d9b25fe1aa"},"schema_version":"1.0","source":{"id":"1907.06187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06187","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06187v1","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06187","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"NCO25ZXKMLFV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NCO25ZXKMLFVXR5L","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NCO25ZXK","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:46641afd35f60be388bb45a1ec614f3d59fe0d5d4284b88dab8327884620710a","target":"graph","created_at":"2026-05-17T23:40:38Z","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":"The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph $K_{r,s,t}$ into 5-cycles was first considered by E.S. Mahmoodian and Maryam Mirzakhani (1995). They stated some necessary conditions and conjectured that those conditions are also sufficient. Since then, many cases of the problem have been solved by various authors; however, the case when the partite sets $r\\leq s\\leq t$ have odd and distinct sizes remained open. We show the conjecture is true when $r$, $s$ and $t$ are all multiples of 5, $t+90 \\leq \\frac{4rs}{r+s}$, and $t \\neq s+10$.","authors_text":"E.S. Mahmoodian, M. Abdolmaleki, MA. Shabani, S. Gh. Ilchi","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-14T08:30:28Z","title":"On decomposing complete tripartite graphs into 5-cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06187","kind":"arxiv","version":1},"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:fc94c5421015fb6a6ed6d98deff147aa9936546d02d7b35571785021e326e027","target":"record","created_at":"2026-05-17T23:40:38Z","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":"e8778d020063d18d1d717b39f42e7d3f9b24f858c40cf99c1a8dd2ae08c6e6d0","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-14T08:30:28Z","title_canon_sha256":"2c0ab627319aa24f4212bd301e443fc87f935721c6d7ea6d31b899d9b25fe1aa"},"schema_version":"1.0","source":{"id":"1907.06187","kind":"arxiv","version":1}},"canonical_sha256":"689daee6ea62cb5bc7ab3ea2b58ce1a0fcacf2dce87e80a2e6081c74f09cfd58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"689daee6ea62cb5bc7ab3ea2b58ce1a0fcacf2dce87e80a2e6081c74f09cfd58","first_computed_at":"2026-05-17T23:40:38.281530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:38.281530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ab/6+IFhkobLuozdb73Ii7ny1kCWy47kQ7rVADhYNBKNIeRhvOo5wN0RrhrnQvIx8d2ENJeXXyCLUX/moVQRBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:38.282004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc94c5421015fb6a6ed6d98deff147aa9936546d02d7b35571785021e326e027","sha256:46641afd35f60be388bb45a1ec614f3d59fe0d5d4284b88dab8327884620710a"],"state_sha256":"77968e5bbb5c4d078f1e7f123bad0b820748748983032fbbd16272fd38be649c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UvwmoAZYFidoJqmiPQr/HHbIUNuUtyEwpYj9JseFHnKaqyhXsqfeLaPdI/J8ZuFisWc6Nb3DBbROdz9yBCGBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:23:02.054091Z","bundle_sha256":"b86a33b7ae9d0ac634ef9f64f2b6f14726d6345b787c3ff0d79282fb4e790ef6"}}