{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4QTUESE2N3P7E22FY2755S3KST","short_pith_number":"pith:4QTUESE2","schema_version":"1.0","canonical_sha256":"e42742489a6edff26b45c6bfdecb6a94e50aa7e0a4a377d4965f80b7461823ac","source":{"kind":"arxiv","id":"2606.21548","version":1},"attestation_state":"computed","paper":{"title":"Determining decomposition thresholds for long odd cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bertille Granet, Daniel Horsley","submitted_at":"2026-06-19T15:44:55Z","abstract_excerpt":"An $\\ell$-cycle decomposition of a graph $G$ is a set of $\\ell$-cycles in $G$ whose edge sets partition the edge set of $G$. The $\\ell$-cycle decomposition threshold $\\delta_{C_\\ell}$ is then the least real number such that any $n$-vertex graph $G$ with minimum degree at least $(\\delta_{C_\\ell}+o(1))n$ has an $\\ell$-cycle decomposition if and only if $\\ell$ divides $|E(G)|$ and each vertex of $G$ has even degree. Nash-Williams' famous conjecture on triangle decompositions states, asymptotically, that $\\delta_{C_3}=\\frac{3}{4}$. A very recent breakthrough result of Delcourt and Postle completel"},"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":"2606.21548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T15:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"59635a6fecd7e85c7a71c6f77e033868f7e29515a0f865c50c4188043fc51222","abstract_canon_sha256":"8a77a2f82d61d0fb5e6d24bf0babcc31430ad6cd0c4d20b8e6fd5bb78ac5b9fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:13:14.320771Z","signature_b64":"DMGraD41FZaYRNhg3XOS47r7iTX/OYIicyCDcwqckM6kZB8h+R2mjI6Pyt4AK1RhxYYVlLtOUOXhhVRRv0pVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e42742489a6edff26b45c6bfdecb6a94e50aa7e0a4a377d4965f80b7461823ac","last_reissued_at":"2026-06-23T01:13:14.320291Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:13:14.320291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Determining decomposition thresholds for long odd cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bertille Granet, Daniel Horsley","submitted_at":"2026-06-19T15:44:55Z","abstract_excerpt":"An $\\ell$-cycle decomposition of a graph $G$ is a set of $\\ell$-cycles in $G$ whose edge sets partition the edge set of $G$. The $\\ell$-cycle decomposition threshold $\\delta_{C_\\ell}$ is then the least real number such that any $n$-vertex graph $G$ with minimum degree at least $(\\delta_{C_\\ell}+o(1))n$ has an $\\ell$-cycle decomposition if and only if $\\ell$ divides $|E(G)|$ and each vertex of $G$ has even degree. Nash-Williams' famous conjecture on triangle decompositions states, asymptotically, that $\\delta_{C_3}=\\frac{3}{4}$. A very recent breakthrough result of Delcourt and Postle completel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21548","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.21548/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":"2606.21548","created_at":"2026-06-23T01:13:14.320371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21548v1","created_at":"2026-06-23T01:13:14.320371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21548","created_at":"2026-06-23T01:13:14.320371+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QTUESE2N3P7","created_at":"2026-06-23T01:13:14.320371+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QTUESE2N3P7E22F","created_at":"2026-06-23T01:13:14.320371+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QTUESE2","created_at":"2026-06-23T01:13:14.320371+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/4QTUESE2N3P7E22FY2755S3KST","json":"https://pith.science/pith/4QTUESE2N3P7E22FY2755S3KST.json","graph_json":"https://pith.science/api/pith-number/4QTUESE2N3P7E22FY2755S3KST/graph.json","events_json":"https://pith.science/api/pith-number/4QTUESE2N3P7E22FY2755S3KST/events.json","paper":"https://pith.science/paper/4QTUESE2"},"agent_actions":{"view_html":"https://pith.science/pith/4QTUESE2N3P7E22FY2755S3KST","download_json":"https://pith.science/pith/4QTUESE2N3P7E22FY2755S3KST.json","view_paper":"https://pith.science/paper/4QTUESE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21548&json=true","fetch_graph":"https://pith.science/api/pith-number/4QTUESE2N3P7E22FY2755S3KST/graph.json","fetch_events":"https://pith.science/api/pith-number/4QTUESE2N3P7E22FY2755S3KST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QTUESE2N3P7E22FY2755S3KST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QTUESE2N3P7E22FY2755S3KST/action/storage_attestation","attest_author":"https://pith.science/pith/4QTUESE2N3P7E22FY2755S3KST/action/author_attestation","sign_citation":"https://pith.science/pith/4QTUESE2N3P7E22FY2755S3KST/action/citation_signature","submit_replication":"https://pith.science/pith/4QTUESE2N3P7E22FY2755S3KST/action/replication_record"}},"created_at":"2026-06-23T01:13:14.320371+00:00","updated_at":"2026-06-23T01:13:14.320371+00:00"}