{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DGXEBUSORJVFEYYNIAZGJPR22C","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":"4fba5b1d1fe9836db5f3d129f5ca37ef2a9ad593f2f12b032b1e2ff4bd6013e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T08:54:32Z","title_canon_sha256":"17395938d15af3106ae533c079fb566081a0f74e44d8c63cae8851629cb28293"},"schema_version":"1.0","source":{"id":"2411.17232","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17232","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17232v2","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17232","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"DGXEBUSORJVF","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"pith_short_16","alias_value":"DGXEBUSORJVFEYYN","created_at":"2026-06-09T01:05:04Z"},{"alias_kind":"pith_short_8","alias_value":"DGXEBUSO","created_at":"2026-06-09T01:05:04Z"}],"graph_snapshots":[{"event_id":"sha256:b10c0cc2153773a2832ab4aa2106d0e160e51e7c97d244f6da251908d509f5fb","target":"graph","created_at":"2026-06-09T01:05:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.17232/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An (edge) decomposition of a graph $G$ is a set of subgraphs of $G$ whose edge sets partition the edge set of $G$. Here we show, for each odd $\\ell \\geq 5$, that any graph $G$ of sufficiently large order $n$ with minimum degree at least $(\\frac{1}{2}+\\frac{1}{2\\ell-4}+o(1))n$ has a decomposition into $\\ell$-cycles if and only if $\\ell$ divides $|E(G)|$ and each vertex of $G$ has even degree. This threshold cannot be improved beyond $\\frac{1}{2}+\\frac{1}{2\\ell-2}$. It was previously shown that the thresholds approach $\\frac{1}{2}$ as $\\ell$ becomes large, but our thresholds do so significantly ","authors_text":"Barbara Maenhaut, Daniel Horsley, Darryn Bryant, Peter Dukes, Richard Montgomery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T08:54:32Z","title":"On decomposition thresholds for odd-length cycles and other tripartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17232","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:f23d684f4fa59de0e5a903d01b252757eed5599d1d60980e1efa0dc062d5162f","target":"record","created_at":"2026-06-09T01:05:04Z","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":"4fba5b1d1fe9836db5f3d129f5ca37ef2a9ad593f2f12b032b1e2ff4bd6013e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T08:54:32Z","title_canon_sha256":"17395938d15af3106ae533c079fb566081a0f74e44d8c63cae8851629cb28293"},"schema_version":"1.0","source":{"id":"2411.17232","kind":"arxiv","version":2}},"canonical_sha256":"19ae40d24e8a6a52630d403264be3ad0aaeaaff5c2633343ca4b6d739cb8baa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19ae40d24e8a6a52630d403264be3ad0aaeaaff5c2633343ca4b6d739cb8baa6","first_computed_at":"2026-06-09T01:05:04.286806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:04.286806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VGrML81bajVX5GU62pQnaieC4GewXnxN6BmfJ/DDsJCS5AmWaSBxFIHjhFhOhJTjSa6XyDhceVsgKDd3C05fBA==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:04.287367Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17232","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f23d684f4fa59de0e5a903d01b252757eed5599d1d60980e1efa0dc062d5162f","sha256:b10c0cc2153773a2832ab4aa2106d0e160e51e7c97d244f6da251908d509f5fb"],"state_sha256":"3265b082959de3714d724225521fb2dc5ec64b8d05923c236d8b844706838cf0"}