{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MR3NIER2KRV2YHXCYFBWAO2NGR","short_pith_number":"pith:MR3NIER2","canonical_record":{"source":{"id":"1607.06315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-21T13:32:00Z","cross_cats_sorted":[],"title_canon_sha256":"b3cd4707646a16a0511ad9b5cbbd3d9d2410bdbee76a6c0b24a6695bcf27c53c","abstract_canon_sha256":"b7fb66c54477288306298569ffc52e0d126b582ff4d3734263dc1cee97ae71b6"},"schema_version":"1.0"},"canonical_sha256":"6476d4123a546bac1ee2c143603b4d34691c67d4b2d726a2767215337cf3eb2a","source":{"kind":"arxiv","id":"1607.06315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06315","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06315v1","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06315","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"MR3NIER2KRV2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MR3NIER2KRV2YHXC","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MR3NIER2","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MR3NIER2KRV2YHXCYFBWAO2NGR","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-21T13:32:00Z","cross_cats_sorted":[],"title_canon_sha256":"b3cd4707646a16a0511ad9b5cbbd3d9d2410bdbee76a6c0b24a6695bcf27c53c","abstract_canon_sha256":"b7fb66c54477288306298569ffc52e0d126b582ff4d3734263dc1cee97ae71b6"},"schema_version":"1.0"},"canonical_sha256":"6476d4123a546bac1ee2c143603b4d34691c67d4b2d726a2767215337cf3eb2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:42.060918Z","signature_b64":"r14EhX8pOhkWaZIwbmaH+yKkVXtnFvu2tGgHnIC/wVzDXOQ9Qle8lgqLtJOrShf1uRWWJ3uGoK575SXxYzipDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6476d4123a546bac1ee2c143603b4d34691c67d4b2d726a2767215337cf3eb2a","last_reissued_at":"2026-05-18T01:10:42.060533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:42.060533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06315","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-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GvODloRg1KLofkmDSfLhXIMml/M9o1W4gpFI8OCr04GXnHpgG1eMww6bEu3T/1ew/l9k7VaIorPgDVtza1KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:32:49.031809Z"},"content_sha256":"e2231581649890655cd76854c56db6d90115b30e99834ff907d528e589088bf3","schema_version":"1.0","event_id":"sha256:e2231581649890655cd76854c56db6d90115b30e99834ff907d528e589088bf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MR3NIER2KRV2YHXCYFBWAO2NGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the exact decomposition threshold for even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amelia Taylor","submitted_at":"2016-07-21T13:32:00Z","abstract_excerpt":"A graph $G$ has a $C_k$-decomposition if its edge set can be partitioned into cycles of length $k$. We show that if $\\delta(G)\\geq 2|G|/3-1$, then $G$ has a $C_4$-decomposition, and if $\\delta(G)\\geq |G|/2$, then $G$ has a $C_{2k}$-decomposition, where $k\\in \\mathbb{N}$ and $k\\geq 4$ (we assume $G$ is large and satisfies necessary divisibility conditions). These minimum degree bounds are best possible and provide exact versions of asymptotic results obtained by Barber, K\\\"uhn, Lo and Osthus. In the process, we obtain asymptotic versions of these results when $G$ is bipartite or satisfies certa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06315","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-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DnuJg0KPS45c/6H0fRmTwQMZTX5jZ9mCIpqY93YHABOad9p3BLzds0Nd7E35/tXL+Q6p8PRTosd43BLkMCYOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:32:49.032154Z"},"content_sha256":"e1995a44e2ab90971ce6169755dadecf3d86cadce2f481d7a106102e029f98f0","schema_version":"1.0","event_id":"sha256:e1995a44e2ab90971ce6169755dadecf3d86cadce2f481d7a106102e029f98f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MR3NIER2KRV2YHXCYFBWAO2NGR/bundle.json","state_url":"https://pith.science/pith/MR3NIER2KRV2YHXCYFBWAO2NGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MR3NIER2KRV2YHXCYFBWAO2NGR/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-24T05:32:49Z","links":{"resolver":"https://pith.science/pith/MR3NIER2KRV2YHXCYFBWAO2NGR","bundle":"https://pith.science/pith/MR3NIER2KRV2YHXCYFBWAO2NGR/bundle.json","state":"https://pith.science/pith/MR3NIER2KRV2YHXCYFBWAO2NGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MR3NIER2KRV2YHXCYFBWAO2NGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MR3NIER2KRV2YHXCYFBWAO2NGR","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":"b7fb66c54477288306298569ffc52e0d126b582ff4d3734263dc1cee97ae71b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-21T13:32:00Z","title_canon_sha256":"b3cd4707646a16a0511ad9b5cbbd3d9d2410bdbee76a6c0b24a6695bcf27c53c"},"schema_version":"1.0","source":{"id":"1607.06315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06315","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06315v1","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06315","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"MR3NIER2KRV2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MR3NIER2KRV2YHXC","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MR3NIER2","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:e1995a44e2ab90971ce6169755dadecf3d86cadce2f481d7a106102e029f98f0","target":"graph","created_at":"2026-05-18T01:10:42Z","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 graph $G$ has a $C_k$-decomposition if its edge set can be partitioned into cycles of length $k$. We show that if $\\delta(G)\\geq 2|G|/3-1$, then $G$ has a $C_4$-decomposition, and if $\\delta(G)\\geq |G|/2$, then $G$ has a $C_{2k}$-decomposition, where $k\\in \\mathbb{N}$ and $k\\geq 4$ (we assume $G$ is large and satisfies necessary divisibility conditions). These minimum degree bounds are best possible and provide exact versions of asymptotic results obtained by Barber, K\\\"uhn, Lo and Osthus. In the process, we obtain asymptotic versions of these results when $G$ is bipartite or satisfies certa","authors_text":"Amelia Taylor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-21T13:32:00Z","title":"On the exact decomposition threshold for even cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06315","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:e2231581649890655cd76854c56db6d90115b30e99834ff907d528e589088bf3","target":"record","created_at":"2026-05-18T01:10:42Z","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":"b7fb66c54477288306298569ffc52e0d126b582ff4d3734263dc1cee97ae71b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-21T13:32:00Z","title_canon_sha256":"b3cd4707646a16a0511ad9b5cbbd3d9d2410bdbee76a6c0b24a6695bcf27c53c"},"schema_version":"1.0","source":{"id":"1607.06315","kind":"arxiv","version":1}},"canonical_sha256":"6476d4123a546bac1ee2c143603b4d34691c67d4b2d726a2767215337cf3eb2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6476d4123a546bac1ee2c143603b4d34691c67d4b2d726a2767215337cf3eb2a","first_computed_at":"2026-05-18T01:10:42.060533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:42.060533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r14EhX8pOhkWaZIwbmaH+yKkVXtnFvu2tGgHnIC/wVzDXOQ9Qle8lgqLtJOrShf1uRWWJ3uGoK575SXxYzipDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:42.060918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2231581649890655cd76854c56db6d90115b30e99834ff907d528e589088bf3","sha256:e1995a44e2ab90971ce6169755dadecf3d86cadce2f481d7a106102e029f98f0"],"state_sha256":"c8d3a55f91544fc378a1472e7fcc5ac7a30a8936d7508f9a534b340dc3d3425d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dehzH0xcIlFbjko8rN2rqnSgw5JZkBn0IRQnynVt6tEwq8y3JKc8Sl8iYcW4UMFFVzsLlTlWjS0XjqMFeI8EAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:32:49.034133Z","bundle_sha256":"6a8faea6deefe48b9fa71180379890e505e0d3633f6bb93f4414e2cad2d3b048"}}