{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DGXEBUSORJVFEYYNIAZGJPR22C","short_pith_number":"pith:DGXEBUSO","schema_version":"1.0","canonical_sha256":"19ae40d24e8a6a52630d403264be3ad0aaeaaff5c2633343ca4b6d739cb8baa6","source":{"kind":"arxiv","id":"2411.17232","version":2},"attestation_state":"computed","paper":{"title":"On decomposition thresholds for odd-length cycles and other tripartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barbara Maenhaut, Daniel Horsley, Darryn Bryant, Peter Dukes, Richard Montgomery","submitted_at":"2024-11-26T08:54:32Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.17232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T08:54:32Z","cross_cats_sorted":[],"title_canon_sha256":"17395938d15af3106ae533c079fb566081a0f74e44d8c63cae8851629cb28293","abstract_canon_sha256":"4fba5b1d1fe9836db5f3d129f5ca37ef2a9ad593f2f12b032b1e2ff4bd6013e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:04.287367Z","signature_b64":"VGrML81bajVX5GU62pQnaieC4GewXnxN6BmfJ/DDsJCS5AmWaSBxFIHjhFhOhJTjSa6XyDhceVsgKDd3C05fBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19ae40d24e8a6a52630d403264be3ad0aaeaaff5c2633343ca4b6d739cb8baa6","last_reissued_at":"2026-06-09T01:05:04.286806Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:04.286806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On decomposition thresholds for odd-length cycles and other tripartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barbara Maenhaut, Daniel Horsley, Darryn Bryant, Peter Dukes, Richard Montgomery","submitted_at":"2024-11-26T08:54:32Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17232","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17232/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.17232","created_at":"2026-06-09T01:05:04.286861+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17232v2","created_at":"2026-06-09T01:05:04.286861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17232","created_at":"2026-06-09T01:05:04.286861+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGXEBUSORJVF","created_at":"2026-06-09T01:05:04.286861+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGXEBUSORJVFEYYN","created_at":"2026-06-09T01:05:04.286861+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGXEBUSO","created_at":"2026-06-09T01:05:04.286861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGXEBUSORJVFEYYNIAZGJPR22C","json":"https://pith.science/pith/DGXEBUSORJVFEYYNIAZGJPR22C.json","graph_json":"https://pith.science/api/pith-number/DGXEBUSORJVFEYYNIAZGJPR22C/graph.json","events_json":"https://pith.science/api/pith-number/DGXEBUSORJVFEYYNIAZGJPR22C/events.json","paper":"https://pith.science/paper/DGXEBUSO"},"agent_actions":{"view_html":"https://pith.science/pith/DGXEBUSORJVFEYYNIAZGJPR22C","download_json":"https://pith.science/pith/DGXEBUSORJVFEYYNIAZGJPR22C.json","view_paper":"https://pith.science/paper/DGXEBUSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17232&json=true","fetch_graph":"https://pith.science/api/pith-number/DGXEBUSORJVFEYYNIAZGJPR22C/graph.json","fetch_events":"https://pith.science/api/pith-number/DGXEBUSORJVFEYYNIAZGJPR22C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGXEBUSORJVFEYYNIAZGJPR22C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGXEBUSORJVFEYYNIAZGJPR22C/action/storage_attestation","attest_author":"https://pith.science/pith/DGXEBUSORJVFEYYNIAZGJPR22C/action/author_attestation","sign_citation":"https://pith.science/pith/DGXEBUSORJVFEYYNIAZGJPR22C/action/citation_signature","submit_replication":"https://pith.science/pith/DGXEBUSORJVFEYYNIAZGJPR22C/action/replication_record"}},"created_at":"2026-06-09T01:05:04.286861+00:00","updated_at":"2026-06-09T01:05:04.286861+00:00"}