{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VI72RMZ4KAJCORCRH2MJJLDDXJ","short_pith_number":"pith:VI72RMZ4","canonical_record":{"source":{"id":"1204.3368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-16T06:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"c2d2427ca120195099d1c17c279c46d22994192c930828d1a9d5950115e8cffc","abstract_canon_sha256":"a46fc1e77fca369f7c82d79419de310e5a2a8e521fe76ce2de691506e5e05b14"},"schema_version":"1.0"},"canonical_sha256":"aa3fa8b33c50122744513e9894ac63ba57101f553eba538f0f02fa8af3d090f7","source":{"kind":"arxiv","id":"1204.3368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3368","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3368v1","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3368","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"VI72RMZ4KAJC","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VI72RMZ4KAJCORCR","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VI72RMZ4","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VI72RMZ4KAJCORCRH2MJJLDDXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-16T06:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"c2d2427ca120195099d1c17c279c46d22994192c930828d1a9d5950115e8cffc","abstract_canon_sha256":"a46fc1e77fca369f7c82d79419de310e5a2a8e521fe76ce2de691506e5e05b14"},"schema_version":"1.0"},"canonical_sha256":"aa3fa8b33c50122744513e9894ac63ba57101f553eba538f0f02fa8af3d090f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:51.696802Z","signature_b64":"67/zx0rbIT/8uhAI0NPmXdCqrG8XGRFZtZEFU3lTWM68Pyt08uh+ftX245xrs7LlSSye4CsCb/tGKDZ72yqEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa3fa8b33c50122744513e9894ac63ba57101f553eba538f0f02fa8af3d090f7","last_reissued_at":"2026-05-18T03:57:51.696177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:51.696177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3368","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-18T03:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wzgzy0gdbUTalfl7/KHI05cAe77SNFCRoxW14WexWVExnCCA3Z4OFbJGA6QO54qFitV6/P8X1OKBzG/LlfFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T04:21:40.288159Z"},"content_sha256":"f9b08f69e6a5601def09ba4f67cf62243c6c8847337d04324a9473757f2b091d","schema_version":"1.0","event_id":"sha256:f9b08f69e6a5601def09ba4f67cf62243c6c8847337d04324a9473757f2b091d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VI72RMZ4KAJCORCRH2MJJLDDXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing various graphs into short even-length cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley","submitted_at":"2012-04-16T06:05:09Z","abstract_excerpt":"We prove that a complete bipartite graph can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, the length of each cycle is at most the size of the smallest part, and the longest cycle is at most three times as long as the second longest. We then use this result to obtain results on incomplete even cycle systems with a hole and on decompositions of complete multipartite graphs into cycles of uniform even length."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3368","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-18T03:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"llcJ4Hh1q/hPfxl2fp20l67h6EhOgMDjVkELMWjY8sRIAcDH4R0N2SE/a44uRGKwlFSLzr0kHZGk0gFo+6HQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T04:21:40.288527Z"},"content_sha256":"50ccf0ebe28cd75efb19d687ca03d4961a507304cae23f9f002ad86a4aefd48c","schema_version":"1.0","event_id":"sha256:50ccf0ebe28cd75efb19d687ca03d4961a507304cae23f9f002ad86a4aefd48c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VI72RMZ4KAJCORCRH2MJJLDDXJ/bundle.json","state_url":"https://pith.science/pith/VI72RMZ4KAJCORCRH2MJJLDDXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VI72RMZ4KAJCORCRH2MJJLDDXJ/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-07-02T04:21:40Z","links":{"resolver":"https://pith.science/pith/VI72RMZ4KAJCORCRH2MJJLDDXJ","bundle":"https://pith.science/pith/VI72RMZ4KAJCORCRH2MJJLDDXJ/bundle.json","state":"https://pith.science/pith/VI72RMZ4KAJCORCRH2MJJLDDXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VI72RMZ4KAJCORCRH2MJJLDDXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VI72RMZ4KAJCORCRH2MJJLDDXJ","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":"a46fc1e77fca369f7c82d79419de310e5a2a8e521fe76ce2de691506e5e05b14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-16T06:05:09Z","title_canon_sha256":"c2d2427ca120195099d1c17c279c46d22994192c930828d1a9d5950115e8cffc"},"schema_version":"1.0","source":{"id":"1204.3368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3368","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3368v1","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3368","created_at":"2026-05-18T03:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"VI72RMZ4KAJC","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VI72RMZ4KAJCORCR","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VI72RMZ4","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:50ccf0ebe28cd75efb19d687ca03d4961a507304cae23f9f002ad86a4aefd48c","target":"graph","created_at":"2026-05-18T03:57:51Z","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 prove that a complete bipartite graph can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, the length of each cycle is at most the size of the smallest part, and the longest cycle is at most three times as long as the second longest. We then use this result to obtain results on incomplete even cycle systems with a hole and on decompositions of complete multipartite graphs into cycles of uniform even length.","authors_text":"Daniel Horsley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-16T06:05:09Z","title":"Decomposing various graphs into short even-length cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3368","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:f9b08f69e6a5601def09ba4f67cf62243c6c8847337d04324a9473757f2b091d","target":"record","created_at":"2026-05-18T03:57:51Z","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":"a46fc1e77fca369f7c82d79419de310e5a2a8e521fe76ce2de691506e5e05b14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-16T06:05:09Z","title_canon_sha256":"c2d2427ca120195099d1c17c279c46d22994192c930828d1a9d5950115e8cffc"},"schema_version":"1.0","source":{"id":"1204.3368","kind":"arxiv","version":1}},"canonical_sha256":"aa3fa8b33c50122744513e9894ac63ba57101f553eba538f0f02fa8af3d090f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa3fa8b33c50122744513e9894ac63ba57101f553eba538f0f02fa8af3d090f7","first_computed_at":"2026-05-18T03:57:51.696177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:51.696177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"67/zx0rbIT/8uhAI0NPmXdCqrG8XGRFZtZEFU3lTWM68Pyt08uh+ftX245xrs7LlSSye4CsCb/tGKDZ72yqEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:51.696802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9b08f69e6a5601def09ba4f67cf62243c6c8847337d04324a9473757f2b091d","sha256:50ccf0ebe28cd75efb19d687ca03d4961a507304cae23f9f002ad86a4aefd48c"],"state_sha256":"f4948ea4b11cbf3c2ca88e0d4bd9b6903f60986762a9f8744c05e935f0b5ceab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zHVcZ/ZxI0RG9cqSRRyPEpQ1+GMsMJLq0qbRseDTe9IBlzvAKicoH+3RKtDN++NBE2Cnj2CRLRAGN/k3DRgHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T04:21:40.290494Z","bundle_sha256":"95b91553023e7309f8fb88c6805cb8aadd1fdfe999731e8498e98c4533ec17ef"}}